全文获取类型
收费全文 | 12694篇 |
免费 | 1460篇 |
国内免费 | 559篇 |
专业分类
化学 | 2477篇 |
晶体学 | 99篇 |
力学 | 1373篇 |
综合类 | 335篇 |
数学 | 6058篇 |
物理学 | 4371篇 |
出版年
2024年 | 20篇 |
2023年 | 105篇 |
2022年 | 262篇 |
2021年 | 321篇 |
2020年 | 266篇 |
2019年 | 281篇 |
2018年 | 284篇 |
2017年 | 410篇 |
2016年 | 563篇 |
2015年 | 362篇 |
2014年 | 641篇 |
2013年 | 934篇 |
2012年 | 638篇 |
2011年 | 717篇 |
2010年 | 570篇 |
2009年 | 751篇 |
2008年 | 773篇 |
2007年 | 859篇 |
2006年 | 694篇 |
2005年 | 607篇 |
2004年 | 576篇 |
2003年 | 477篇 |
2002年 | 464篇 |
2001年 | 385篇 |
2000年 | 370篇 |
1999年 | 322篇 |
1998年 | 299篇 |
1997年 | 261篇 |
1996年 | 226篇 |
1995年 | 185篇 |
1994年 | 158篇 |
1993年 | 143篇 |
1992年 | 131篇 |
1991年 | 77篇 |
1990年 | 69篇 |
1989年 | 52篇 |
1988年 | 56篇 |
1987年 | 46篇 |
1986年 | 58篇 |
1985年 | 61篇 |
1984年 | 61篇 |
1983年 | 16篇 |
1982年 | 34篇 |
1981年 | 21篇 |
1980年 | 16篇 |
1979年 | 10篇 |
1978年 | 15篇 |
1977年 | 18篇 |
1976年 | 15篇 |
1973年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
103.
I.IlltroductionWhenanactiveunderwateracousticalpositioningsystemissearchingforanunderwatertarget,itisnecessaryforittocompleteatransmittingandreceivingcycIewithineachworkingperiodinordertofindoutthelocationofthetargetcorrectly.Forexample,whenanunder-wateracoustica1synchronouspositioningsystemistrackinganunderwatertargetwithagivensynchr0nizingperiod,thepropagati0ntimeofthepositioningsignaltravellingfr0mthetaJrgettothearrayofthesystemshouldbelessthanthesynchronizingperiod0therwisetargetdis-tance… 相似文献
104.
A transient molecular network model is built to describe the nonlinear viscoelasticity of polymers by considering the effect
of entanglement loss and regeneration on the relaxation of molecular strands. It is an extension of previous network theories.
The experimental data on three thermoplastic polymers (ABS, PVC and PA6) obtained under various loading conditions are used
to test the model. Agreement between the theoretical and experimental curves shows that the suggested model can describe successfully
the relaxation behavior of the thermoplastic polymers under different loading rates by using relatively few relaxation modes.
Thus the micromechanism responsible for strain-rate dependence of relaxation process and the origin of nonlinear viscoelasticity
may be disclosed.
The project supported by the National Natural Science Foundation of China and Doctorial Fund 相似文献
105.
几种约束广义逆矩阵的有限算法 总被引:2,自引:0,他引:2
陈永林 《高等学校计算数学学报》1997,19(3):232-240
1引言与引理众所周知,关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的,这就是著名的Faddeev算法[1,P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来,有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩 相似文献
106.
Summary Dielectric measurements on Na2B4O7(99.5%)−V2O5(0.5%) glass system, in the frequency range 10−3 to 104 Hz and temperature range 300 to 500 K, have been carried out. The normalized plots of complex capacitance have shown a single
mechanism responsible for conduction for both volume and surface measurements with their close values of activation energies
(0.67±0.03) eV and (0.64±0.03) eV, respectively. The low-frequency dispersion (LFD) behaviour has been observed to be perturbed
by the presence of more than one competing process. The impedance plots have shown a parallel combination of a capacitor (C) and a resistor (R), with some contribution of a dispersive element due to charge accumulation in the vicinity of the electrodes. The values
ofR andC were found to be of the same order of magnitude, for both surface and volume measurements. The observedR has shown a decrease with an increase in temperature due to an increase in mobility of Na+ ions, whereasC remains practicaly constant. The complex capacitance surface behaviour is dominated by volume, due to hygroscopy of this
glass system. 相似文献
107.
Satoru Ibaraki Masao Fukushima Toshihide Ibaraki 《Computational Optimization and Applications》1992,1(2):207-226
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs. 相似文献
108.
This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems. 相似文献
109.
关于可达矩阵的求法探讨 总被引:6,自引:0,他引:6
在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 . 相似文献
110.
Hossam A. Zaki 《Computational Optimization and Applications》1995,4(1):23-45
State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented. 相似文献