全文获取类型
收费全文 | 4307篇 |
免费 | 393篇 |
国内免费 | 173篇 |
专业分类
化学 | 330篇 |
晶体学 | 1篇 |
力学 | 113篇 |
综合类 | 72篇 |
数学 | 3463篇 |
物理学 | 894篇 |
出版年
2024年 | 18篇 |
2023年 | 76篇 |
2022年 | 118篇 |
2021年 | 77篇 |
2020年 | 149篇 |
2019年 | 152篇 |
2018年 | 141篇 |
2017年 | 162篇 |
2016年 | 122篇 |
2015年 | 94篇 |
2014年 | 178篇 |
2013年 | 332篇 |
2012年 | 158篇 |
2011年 | 220篇 |
2010年 | 216篇 |
2009年 | 335篇 |
2008年 | 310篇 |
2007年 | 249篇 |
2006年 | 269篇 |
2005年 | 186篇 |
2004年 | 168篇 |
2003年 | 164篇 |
2002年 | 144篇 |
2001年 | 114篇 |
2000年 | 113篇 |
1999年 | 95篇 |
1998年 | 74篇 |
1997年 | 79篇 |
1996年 | 48篇 |
1995年 | 35篇 |
1994年 | 33篇 |
1993年 | 27篇 |
1992年 | 27篇 |
1991年 | 21篇 |
1990年 | 23篇 |
1989年 | 27篇 |
1988年 | 17篇 |
1987年 | 10篇 |
1986年 | 16篇 |
1985年 | 21篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有4873条查询结果,搜索用时 15 毫秒
51.
针对一般的非线性规划问题,利用某些Lagrange型函数给出了一类Lagrangian对偶问题的一般模型,并证明它与原问题之间存在零对偶间隙.针对具体的一类增广La- grangian对偶问题以及几类由非线性卷积函数构成的Lagrangian对偶问题,详细讨论了零对偶间隙的存在性.进一步,讨论了在最优路径存在的前提下,最优路径的收敛性质. 相似文献
52.
Tetsushi Nishida Kokichi Sugihara Masato Kimura 《Journal of Computational and Applied Mathematics》2007
The Voronoi diagram in a flow field is a tessellation of water surface into regions according to the nearest island in the sense of a “boat-sail distance”, which is a mathematical model of the shortest time for a boat to move from one point to another against the flow of water. The computation of the diagram is not easy, because the equi-distance curves have singularities. To overcome the difficulty, this paper derives a new system of equations that describes the motion of a particle along the shortest path starting at a given point on the boundary of an island, and thus gives a new variant of the marker-particle method. In the proposed method, each particle can be traced independently, and hence the computation can be done stably even though the equi-distance curves have singular points. 相似文献
53.
54.
Alistair Savage 《Algebras and Representation Theory》2006,9(2):161-199
For irreducible integrable highest weight modules of the finite and affine Lie algebras of type A and D, we define an isomorphism between the geometric realization of the crystal graphs in terms of irreducible components of Nakajima
quiver varieties and the combinatorial realizations in terms of Young tableaux and Young walls. For type An(1), we extend the Young wall construction to arbitrary level, describing a combinatorial realization of the crystals in terms
of new objects which we call Young pyramids.
Presented by P. Littleman
Mathematics Subject Classifications (2000) Primary 16G10, 17B37.
Alistair Savage: This research was supported in part by the Natural Sciences and Engineering Research Council (NSERC) of Canada
and was partially conducted by the author for the Clay Mathematics Institute. 相似文献
55.
Mitre C. Dourado Fábio Protti Jayme L. Szwarcfiter 《Discrete Applied Mathematics》2007,155(18):2435-2443
Let p?1 and q?0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F′⊆F formed by p or less members has total intersection of cardinality at least q. A family of sets F is (p,q)-Helly when every (p,q)-intersecting subfamily F′⊆F has total intersection of cardinality at least q. A graph G is a (p,q)-clique-Helly graph when its family of (maximal) cliques is (p,q)-Helly. According to this terminology, the usual Helly property and the clique-Helly graphs correspond to the case p=2,q=1. In this work we present a characterization for (p,q)-clique-Helly graphs. For fixed p,q, this characterization leads to a polynomial-time recognition algorithm. When p or q is not fixed, it is shown that the recognition of (p,q)-clique-Helly graphs is NP-hard. 相似文献
56.
The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the
signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also
prove that every non-empty set of integers is the signed degree set of some connected signed graph. 相似文献
57.
对于线性型多目标半定规划问题,引进加权中心路径的概念,并利用单目标半定规划的中心路径法,提出了求解多目标半定规划问题的加权中心路径法,先得型对一个叔向量的有效解,然后在此基础上,提出了通过一次迭代得到对应一定范围内其他任意权向量的有效解的一步修正方法. 相似文献
58.
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log2n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other. 相似文献
59.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献
60.
红外目标模拟器由红外目标图像发生器和投影光学系统组成。该红外光学系统是一个要求与2个导引光学系统的光学技术参数相匹配的长焦距、大视场和具有像方远心光路的中红外光学系统。叙述用于红外目标模拟器的红外耦合光学系统的设计原理,提出它与导引光学系统一起可组成放大倍率M=4.5×的红外投影光学系统,并指出IR CRT产生的图像通过红外投影光学系统可成像在导引接收器上。针对给出的红外耦合光学系统的设计特点和技术要求,光学材料选取硅(Si) 锗(Ge) 硅(Si),采用简单的柯克三片式结构完成光学系统设计。设计评价结果表明,该系统的光学性能和成像质量均满足设计指标要求。 相似文献