全文获取类型
收费全文 | 9704篇 |
免费 | 962篇 |
国内免费 | 787篇 |
专业分类
化学 | 1108篇 |
晶体学 | 25篇 |
力学 | 994篇 |
综合类 | 248篇 |
数学 | 6909篇 |
物理学 | 2169篇 |
出版年
2024年 | 16篇 |
2023年 | 110篇 |
2022年 | 247篇 |
2021年 | 261篇 |
2020年 | 280篇 |
2019年 | 265篇 |
2018年 | 246篇 |
2017年 | 352篇 |
2016年 | 382篇 |
2015年 | 251篇 |
2014年 | 510篇 |
2013年 | 685篇 |
2012年 | 472篇 |
2011年 | 563篇 |
2010年 | 501篇 |
2009年 | 708篇 |
2008年 | 649篇 |
2007年 | 623篇 |
2006年 | 564篇 |
2005年 | 526篇 |
2004年 | 394篇 |
2003年 | 396篇 |
2002年 | 347篇 |
2001年 | 259篇 |
2000年 | 279篇 |
1999年 | 240篇 |
1998年 | 267篇 |
1997年 | 181篇 |
1996年 | 153篇 |
1995年 | 87篇 |
1994年 | 85篇 |
1993年 | 70篇 |
1992年 | 72篇 |
1991年 | 61篇 |
1990年 | 35篇 |
1989年 | 36篇 |
1988年 | 38篇 |
1987年 | 22篇 |
1986年 | 27篇 |
1985年 | 42篇 |
1984年 | 29篇 |
1983年 | 16篇 |
1982年 | 25篇 |
1981年 | 19篇 |
1980年 | 17篇 |
1979年 | 13篇 |
1978年 | 11篇 |
1974年 | 3篇 |
1973年 | 2篇 |
1972年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
111.
动态模糊随机信息处理的数学方法 总被引:1,自引:1,他引:0
本文系统地概述了我们近年来提出的动态模糊随机信息处理的数学方法,内容包括模糊随机变量、模糊随机过程和模糊随机微分方程的基本解法等方面的基本概念、基本定义和某些重要的定理,以及动态系统的模糊随机响应与可靠性分析的方法等。这些方法是为我们研究工程实际问题的需要逐步发展起来的,对于处理某些类型的问题简便实用。 相似文献
112.
113.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
114.
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies. 相似文献
115.
研究无原子布氏代数的计算复杂性 .得到了下面的新定理 :定理 1 无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 .定理 2 无原子布氏代数的初等型Γ (x1,… ,xn)是由型内的不含量词的全体开式子所唯一决定 .定理 3 无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 . 相似文献
116.
The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model. 相似文献
117.
The symplectic, optical, and photon-number tomographic symbols of binomial states of the radiation field are studied. Explicit relations for all tomograms of the binomial states are obtained. Two measures for nonclassical properties of these states are discussed. 相似文献
118.
Heinz H. Bauschke Patrick L. Combettes 《Proceedings of the American Mathematical Society》2003,131(12):3757-3766
An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.
119.
The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature. 相似文献
120.
Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize/minimize his/her own expected utility and each is assumed to know the extensive game in full. At present, it cannot be claimed that the first assumption has been shown to be true in a wide variety of situations involving complex problems in economics, engineering, social and political sciences due to the difficulty inherent in defining an adequate utility function for each player in these types of problems. On the other hand, in many of such complex problems, each player has a heuristic knowledge of the desires of the other players and a heuristic knowledge of the control choices that they will make in order to meet their ends.In this paper, we utilize fuzzy set theory in order to incorporate the players' heuristic knowledge of decision making into the framework of conventional game theory or ordinal game theory. We define a new approach to N-person static fuzzy noncooperative games and develop a solution concept such as Nash for these types of games. We show that this general formulation of fuzzy noncooperative games can be applied to solve multidecision-making problems where no objective function is specified. The computational procedure is illustrated via application to a multiagent optimization problem dealing with the design and operation of future military operations. 相似文献