全文获取类型
收费全文 | 9359篇 |
免费 | 487篇 |
国内免费 | 918篇 |
专业分类
化学 | 404篇 |
晶体学 | 4篇 |
力学 | 280篇 |
综合类 | 120篇 |
数学 | 4865篇 |
物理学 | 317篇 |
综合类 | 4774篇 |
出版年
2024年 | 11篇 |
2023年 | 83篇 |
2022年 | 113篇 |
2021年 | 127篇 |
2020年 | 137篇 |
2019年 | 162篇 |
2018年 | 174篇 |
2017年 | 176篇 |
2016年 | 194篇 |
2015年 | 198篇 |
2014年 | 374篇 |
2013年 | 480篇 |
2012年 | 434篇 |
2011年 | 524篇 |
2010年 | 443篇 |
2009年 | 606篇 |
2008年 | 585篇 |
2007年 | 660篇 |
2006年 | 641篇 |
2005年 | 505篇 |
2004年 | 480篇 |
2003年 | 472篇 |
2002年 | 429篇 |
2001年 | 379篇 |
2000年 | 323篇 |
1999年 | 301篇 |
1998年 | 274篇 |
1997年 | 263篇 |
1996年 | 209篇 |
1995年 | 144篇 |
1994年 | 154篇 |
1993年 | 123篇 |
1992年 | 97篇 |
1991年 | 95篇 |
1990年 | 79篇 |
1989年 | 63篇 |
1988年 | 58篇 |
1987年 | 35篇 |
1986年 | 23篇 |
1985年 | 26篇 |
1984年 | 21篇 |
1983年 | 12篇 |
1982年 | 21篇 |
1981年 | 16篇 |
1980年 | 18篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
961.
A system-theoretic approach to cooperation, interaction and allocation is presented that simplifies, unifies and extends the results on classical cooperative games and their generalizations. In particular, a general Weber theory of linear values is obtained and a new theory for local cooperation and general interaction indices is established. The model is dynamic and based on the notion of states of cooperation that change under actions of agents. Careful distinction between “local” states of cooperation and general “system” states leads to a notion of entropy for arbitrary non-negative and efficient allocations and thus to a new information-theoretic criterion for fairness of allocation mechanisms. Shapley allocations, for instance, are exhibited as arising from random walks with maximal entropy. For a large class of cooperation systems, a characterization of game symmetries in terms of λ-values is given. A concept for cores and Weber sets is proposed and it is shown that a Weber set of a game with selection structure always contains the core. 相似文献
962.
Yago DiezAuthor Vitae J. Antoni SellarèsAuthor Vitae 《Discrete Applied Mathematics》2011,159(6):433-449
We propose a process for determining approximated matches, in terms of the bottleneck distance, under color preserving rigid motions, between two colored point sets A,B∈R2, |A|≤|B|. We solve the matching problem by generating all representative motions that bring A close to a subset B′ of set B and then using a graph matching algorithm. We also present an approximate matching algorithm with improved computational time. In order to get better running times for both algorithms we present a lossless filtering preprocessing step. By using it, we determine some candidate zones which are regions that contain a subset S of B such that A may match one or more subsets B′ of S. Then, we solve the matching problem between A and every candidate zone. Experimental results using both synthetic and real data are reported to prove the effectiveness of the proposed approach. 相似文献
963.
Let G=(V,E) be a graph and S⊆V. The set S is a secure set if ∀X⊆S,|N[X]∩S|≥|N[X]−S|, and S is a global secure set if S is a secure set and a dominating set. The cardinality of a minimum global secure set of G is the global security number of G, denoted γs(G). The sets studied in this paper are different from secure dominating sets studied in Cockayne et al. (2003) [3], Grobler and Mynhardt (2009) [8], or Klostermeyer and Mynhardt (2008) [13], which are also denoted by γs.In this paper, we provide results on the global security numbers of paths, cycles and their Cartesian products. 相似文献
964.
965.
Andrea Medini 《Topology and its Applications》2011,158(18):2520-2527
Building on work of Terada, we prove that h-homogeneity is productive in the class of zero-dimensional spaces. Then, by generalizing a result of Motorov, we show that for every non-empty zero-dimensional space X there exists a non-empty zero-dimensional space Y such that X×Y is h-homogeneous. Also, we simultaneously generalize results of Motorov and Terada by showing that if X is a space such that the isolated points are dense then Xκ is h-homogeneous for every infinite cardinal κ. Finally, we show that a question of Terada (whether Xω is h-homogeneous for every zero-dimensional first-countable X) is equivalent to a question of Motorov (whether such an infinite power is always divisible by 2) and give some partial answers. 相似文献
966.
The aim of this paper is to propose a variational piecewise constant level set method for solving elliptic shape and topology optimization problems. The original model is approximated by a two-phase optimal shape design problem by the ersatz material approach. Under the piecewise constant level set framework, we first reformulate the two-phase design problem to be a new constrained optimization problem with respect to the piecewise constant level set function. Then we solve it by the projection Lagrangian method. A gradient-type iterative algorithm is presented. Comparisons between our numerical results and those obtained by level set approaches show the effectiveness, accuracy and efficiency of our algorithm. 相似文献
967.
本文研究了Cantor集和其并的自相似性.利用Cantor展式的方法,得到了关于Cantor集和迭代函数系的一个基本关系:T∪(T+α)为自相似的当且仅当存在一个非负整数n使得α=±(k2-k1)dn.进一步,若T∪(T+α)是自相似的,则它满足开集条件. 相似文献
968.
In this paper, we prove that strongly convex space and almost locally uniformly rotund space, very convex space and weakly almost locally uniformly rotund space are respectively equivalent. We also investigate a few properties of k-strongly convex space and k-very convex space, and discuss the applications of strongly convex space and very convex space in approximation theory. 相似文献
969.
Zhi Kong Lifu WangZhaoxia Wu 《Journal of Computational and Applied Mathematics》2011,236(6):1521-1530
There are many uncertain problems in practical production and life which need decisions made with soft sets and fuzzy soft sets. However, the basis of evaluation of the decision method is single and simple, the same decision problem can obtain different results from using a different evaluation basis. In this paper, in order to obtain the right result, we discuss fuzzy soft set decision problems. A new algorithm based on grey relational analysis is presented. The evaluation bases of the new algorithm are multiple. There is more information in a decision result based on multiple evaluation bases, which is more easily accepted and logical to one’s thinking. For the two cases examined, the results show that the new algorithm is efficient for solving decision problems. 相似文献
970.