全文获取类型
收费全文 | 31706篇 |
免费 | 2402篇 |
国内免费 | 1331篇 |
专业分类
化学 | 6829篇 |
晶体学 | 68篇 |
力学 | 1761篇 |
综合类 | 190篇 |
数学 | 5674篇 |
物理学 | 3706篇 |
综合类 | 17211篇 |
出版年
2024年 | 57篇 |
2023年 | 276篇 |
2022年 | 382篇 |
2021年 | 470篇 |
2020年 | 660篇 |
2019年 | 535篇 |
2018年 | 495篇 |
2017年 | 565篇 |
2016年 | 809篇 |
2015年 | 880篇 |
2014年 | 1373篇 |
2013年 | 1744篇 |
2012年 | 1615篇 |
2011年 | 1698篇 |
2010年 | 1231篇 |
2009年 | 1655篇 |
2008年 | 1670篇 |
2007年 | 1998篇 |
2006年 | 1765篇 |
2005年 | 1558篇 |
2004年 | 1508篇 |
2003年 | 1372篇 |
2002年 | 1323篇 |
2001年 | 1177篇 |
2000年 | 1117篇 |
1999年 | 962篇 |
1998年 | 917篇 |
1997年 | 785篇 |
1996年 | 748篇 |
1995年 | 676篇 |
1994年 | 563篇 |
1993年 | 487篇 |
1992年 | 399篇 |
1991年 | 331篇 |
1990年 | 312篇 |
1989年 | 273篇 |
1988年 | 244篇 |
1987年 | 170篇 |
1986年 | 146篇 |
1985年 | 73篇 |
1984年 | 66篇 |
1983年 | 20篇 |
1982年 | 36篇 |
1981年 | 39篇 |
1980年 | 24篇 |
1979年 | 32篇 |
1978年 | 43篇 |
1977年 | 43篇 |
1976年 | 44篇 |
1975年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
82.
83.
The projective method for solving linear matrix inequalities 总被引:2,自引:0,他引:2
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving
an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest
in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs
with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical
arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is
provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed. 相似文献
84.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
85.
ELSO is an environment for the solution oflarge-scale optimization problems. With ELSO the user is required to provide only code for the evaluation of a partially separable function. ELSO exploits the partialseparability structure of the function to computethe gradient efficiently using automatic differentiation.We demonstrate ELSO's efficiency by comparing thevarious options available in ELSO.Our conclusion is that the hybrid option in ELSOprovides performance comparable to the hand-coded option, while having the significantadvantage of not requiring a hand-coded gradient orthe sparsity pattern of the partially separable function.In our test problems, which have carefully coded gradients,the computing time for the hybrid AD option is within a factor of two of thehand-coded option. 相似文献
86.
Peptides containing azaglycine located terminally or within the backbone have been prepared in the solid phase by means of an automatic synthesizer. 相似文献
87.
The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions. 相似文献
88.
Wolfgang Kirmse 《Angewandte Chemie (International ed. in English)》1997,36(11):1164-1170
Alkenylidenes R2C?C: (= alkylidene carbenes) undergo regio- and stereoselective intramolecular C? H insertion reactions that are excellently suited for the synthesis of cyclopentenes. The 1, 2-shifts occurring with R?H and R?Ar are useful for the preparation of alkynes. Alkenylidenes are efficiently generated from carbonyl compounds by diazomethylation, from vinyl halides by α-elimination, from alkynyliodonium salts by addition of nucleophiles, and from alkynes by retro-1, 2-shifts. Specific applications of the various methods, particularly in the synthesis of natural products, are discussed. 相似文献
89.
威布尔分布是描述部件寿伞的一种极为主要的分布,本文对确定威布尔分布的三参数,给出了一种试探性算法,方法简单、实用。 相似文献
90.
采用分枝理论推导非线性系统两变量P和PI控制下的分枝特性,所导得的几个定理阐明了简单分枝点和Hopf分枝点的位置和性质。一个简化精馏塔模型用于演示这一过程,展示出精馏塔系统在闭环时,可能出现多态和极限环。 相似文献