全文获取类型
收费全文 | 19481篇 |
免费 | 2641篇 |
国内免费 | 546篇 |
专业分类
化学 | 753篇 |
晶体学 | 14篇 |
力学 | 1037篇 |
综合类 | 325篇 |
数学 | 5496篇 |
物理学 | 2845篇 |
无线电 | 12198篇 |
出版年
2024年 | 74篇 |
2023年 | 253篇 |
2022年 | 443篇 |
2021年 | 522篇 |
2020年 | 517篇 |
2019年 | 447篇 |
2018年 | 460篇 |
2017年 | 658篇 |
2016年 | 872篇 |
2015年 | 888篇 |
2014年 | 1427篇 |
2013年 | 1334篇 |
2012年 | 1366篇 |
2011年 | 1495篇 |
2010年 | 1038篇 |
2009年 | 1177篇 |
2008年 | 1310篇 |
2007年 | 1368篇 |
2006年 | 1146篇 |
2005年 | 951篇 |
2004年 | 801篇 |
2003年 | 702篇 |
2002年 | 609篇 |
2001年 | 476篇 |
2000年 | 425篇 |
1999年 | 313篇 |
1998年 | 297篇 |
1997年 | 249篇 |
1996年 | 221篇 |
1995年 | 152篇 |
1994年 | 109篇 |
1993年 | 115篇 |
1992年 | 99篇 |
1991年 | 44篇 |
1990年 | 56篇 |
1989年 | 34篇 |
1988年 | 39篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 10篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Miele A. Wang T. Chao C. S. Dabney J. B. 《Journal of Optimization Theory and Applications》1999,103(3):495-519
We consider a ship subject to kinematic, dynamic, and moment equations and steered via rudder under the assumptions that the rudder angle and rudder angle time rate are subject to upper and lower bounds. We formulate and solve four Chebyshev problems of optimal control, the optimization criterion being the maximization with respect to the state and control history of the minimum value with respect to time of the distance between two identical ships, one maneuvering and one moving in a predetermined way.Problems P1 and P2 deal with collision avoidance maneuvers without cooperation, while Problems P3 and P4 deal with collision avoidance maneuvers with cooperation. In Problems P1 and P3, the maneuvering ship must reach the final point with a given lateral distance, zero yaw angle, and zero yaw angle time rate. In Problems P2 and P4, the additional requirement of quasi-steady state is imposed at the final point.The above Chebyshev problems, transformed into Bolza problems via suitable transformations, are solved via the sequential gradient-restoration algorithm in conjunction with a new singularity avoiding transformation which accounts automatically for the bounds on rudder angle and rudder angle time rate.The optimal control histories involve multiple subarcs along which either the rudder angle is kept at one of the extreme positions or the rudder angle time rate is held at one of the extreme values. In problems where quasi-steady state is imposed at the final point, there is a higher number of subarcs than in problems where quasi-steady state is not imposed; the higher number of subarcs is due to the additional requirement that the lateral velocity and rudder angle vanish at the final point. 相似文献
992.
Gianni Di Pillo Stefano Lucidi Laura Palagi 《Computational Optimization and Applications》1999,12(1-3):157-188
In this paper we describe a Newton-type algorithm model for solving smooth constrained optimization problems with nonlinear objective function, general linear constraints and bounded variables. The algorithm model is based on the definition of a continuously differentiable exact merit function that follows an exact penalty approach for the box constraints and an exact augmented Lagrangian approach for the general linear constraints. Under very mild assumptions and without requiring the strict complementarity assumption, the algorithm model produces a sequence of pairs
converging quadratically to a pair
where
satisfies the first order necessary conditions and
is a KKT multipliers vector associated to the linear constraints. As regards the behaviour of the sequence x
k alone, it is guaranteed that it converges at least superlinearly. At each iteration, the algorithm requires only the solution of a linear system that can be performed by means of conjugate gradient methods. Numerical experiments and comparison are reported. 相似文献
993.
A Dehn twist automorphism of a group G is an automorphism which can be given (as specified below) in terms of a graph-of-groups decomposition of G with infinite cyclic edge groups. The classic example is that of an automorphism of the fundamental group of a surface which
is induced by a Dehn twist homeomorphism of the surface. For , a non-abelian free group of finite rank n, a normal form for Dehn twist is developed, and it is shown that this can be used to solve the conjugacy problem for Dehn
twist automorphisms of .
Received: February 12, 1996. 相似文献
994.
In this paper the optimization of additively decomposed discrete functions is investigated. For these functions genetic algorithms have exhibited a poor performance. First the schema theory of genetic algorithms is reformulated in probability theory terms. A schema defines the structure of a marginal distribution. Then the conceptual algorithm BEDA is introduced. BEDA uses a Boltzmann distribution to generate search points. From BEDA a new algorithm, FDA, is derived. FDA uses a factorization of the distribution. The factorization captures the structure of the given function. The factorization problem is closely connected to the theory of conditional independence graphs. For the test functions considered, the performance of FDA—in number of generations till convergence—is similar to that of a genetic algorithm for the OneMax function. This result is theoretically explained. 相似文献
995.
Martin Schader 《Mathematical Social Sciences》1982,2(2):189-197
Transfer algorithms are usually used to optimize an objective function that is defined on the set of partitions of a finite set X. In this paper we define an equivalence relation ? on the set of fuzzy equivalence relations on X and establish a bijection from the set of hierarchies on X to the set of equivalence classes with respect to ?. Thus, hierarchies can be identified with fuzzy equivalence relations and the transfer algorithm can be modified in order to optimize an objective function that is defined on the set of hierarchies on X. 相似文献
996.
The complexity of linear programming is discussed in the “integer” and “real number” models of computation. Even though the integer model is widely used in theoretical computer science, the real number model is more useful for estimating an algorithm's running time in actual computation.Although the ellipsoid algorithm is a polynomial-time algorithm in the integer model, we prove that it has unbounded complexity in the real number model. We conjecture that there exists no polynomial-time algorithm for the linear inequalities problem in the real number model. We also conjecture that linear inequalities are strictly harder than linear equalities in all “reasonable” models of computation. 相似文献
997.
指针的安全性是C语言程序中的常见问题,它严重影响到系统的安全性.针对指针静态分析中的精度问题,比较分析了目前常见的5种指针分析算法的优缺点,提出了一种基于流不敏感的改进指针静态分析算法.该算法是在Steensgaard算法的基础上,对程序的控制流图进行改进,通过该算法可以得到比常见的数据流不敏感算法更为精确的指针分析结果.在实验室开发的国内首款商用编译器中实现了该算法,实验结果表明该算法可以提高指针分析的精度. 相似文献
998.
随着片上网络(Network-on-Chip)集成度的提高,功耗逐渐成为设计的焦点.本文提出了一种在延时约束条件下,基于遗传算法的片上网络通信链路的低功耗映射算法.该算法使用数组方式编码染色体,并采用非常规码的交叉和变异运算因子.它充分利用遗传算法的群体优势,能快速有效地对通信功耗作优化.实验表明,该算法能平均减少50%左右的通信功耗. 相似文献
999.
Guo-Jin Wang & T. W. Sederberg 《计算数学(英文版)》1999,17(1):33-40
This is a continuation of short communication$^{[1]}$. In [1] a verification of the
implicitization equation for degree two rational Bézier curves is presented which
does not require the use of resultants. This paper presents these verifications in the general cases, i.e., for degree $n$ rational Bézier curves. Thus some interesting interplay between the structure of the $n×n$ implicitization matrix and the de Casteljau algorithm is revealed. 相似文献
1000.
Chuan-jn Xu 《计算数学(英文版)》1999,(4)
1.IntroductionDomaindecompositionmethodsareusefulapproximationtechniquestofacecomputationalfluiddynamicsproblems,especiallyincomplexphysicaldomainsandusingparallelcomputationalenvironments.Theyhavebeenfirstemployedinfinitedifferenceandfiniteelementme... 相似文献