全文获取类型
收费全文 | 6005篇 |
免费 | 136篇 |
国内免费 | 46篇 |
专业分类
化学 | 3741篇 |
晶体学 | 35篇 |
力学 | 209篇 |
数学 | 1274篇 |
物理学 | 928篇 |
出版年
2022年 | 54篇 |
2021年 | 58篇 |
2020年 | 65篇 |
2019年 | 67篇 |
2018年 | 58篇 |
2017年 | 49篇 |
2016年 | 97篇 |
2015年 | 116篇 |
2014年 | 135篇 |
2013年 | 310篇 |
2012年 | 295篇 |
2011年 | 328篇 |
2010年 | 222篇 |
2009年 | 208篇 |
2008年 | 306篇 |
2007年 | 320篇 |
2006年 | 305篇 |
2005年 | 278篇 |
2004年 | 267篇 |
2003年 | 218篇 |
2002年 | 209篇 |
2001年 | 99篇 |
2000年 | 92篇 |
1999年 | 99篇 |
1998年 | 73篇 |
1997年 | 66篇 |
1996年 | 91篇 |
1995年 | 67篇 |
1994年 | 74篇 |
1993年 | 82篇 |
1992年 | 65篇 |
1991年 | 44篇 |
1990年 | 75篇 |
1989年 | 59篇 |
1988年 | 48篇 |
1987年 | 55篇 |
1986年 | 47篇 |
1985年 | 68篇 |
1984年 | 81篇 |
1983年 | 53篇 |
1982年 | 78篇 |
1981年 | 80篇 |
1980年 | 95篇 |
1979年 | 75篇 |
1978年 | 80篇 |
1977年 | 76篇 |
1976年 | 72篇 |
1975年 | 52篇 |
1974年 | 38篇 |
1973年 | 58篇 |
排序方式: 共有6187条查询结果,搜索用时 15 毫秒
91.
Fix a partial order P=(X, <). We first show that bipartite orders are sufficient to study structural properties of the lattice of maximal antichains. We show that all orders having the same lattice of maximal antichains can be reduced to one representative order (called the poset of irreducibles by Markowsky [14]). We then define the strong simplicial elimination scheme to characterize orders which have distributive lattice of maximal antichains. The notion of simplicial elimination corresponds to the decomposition process described in [14] for extremal lattices. This notion leads to simple greedy algorithms for distributivity checking, lattice recognition and jump number computation. In the last section, we give several algorithms for lattices and orders. 相似文献
92.
Ilfat Ghamlouche Teodor Gabriel Crainic Michel Gendreau 《Annals of Operations Research》2004,131(1-4):109-133
In this paper, we propose a path relinking procedure for the fixed-charge capacitated multicommodity network design problem. Cycle-based neighbourhoods are used both to move along paths between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive computational experiments indicate that the path relinking procedure offers excellent results. It systematically outperforms the cycle-based tabu search method in both solution quality and computational effort and offers the best current meta-heuristic for this difficult class of problems. 相似文献
93.
Michel Balazard 《Advances in Mathematics》2004,188(1):69-86
Opération fondamentale de l'arithmétique, familière depuis des millénaires, la division euclidienne n'a pas livré tous ses secrets. Ainsi, notons pour k et a entiers positifs, le reste de la division euclidienne de k par a, et imaginons un instant que, par un choix convenable d'un entier n et de réels c2,…,cn, nous sachions rendre arbitrairement petite la quantité
94.
In this work, we compare conditional distributions derived from bivariate archimedean copulas in terms of their respective variabilities using the dispersive stochastic order. Specifically, we fix the underlying copula and we consider the effect of increasing the second component on the variability of the conditional distribution of the first component. Characterizations are provided in terms of the generator and of the marginal distributions. Several examples involving standard parametric copulas such as Clayton and Frank ones are discussed. 相似文献
95.
Glasses in the binary system xAg2P2O6 − (1 − x)Ag2Te2O5 have been prepared for 0 x 1. For each composition only one glass transition temperature is observed in the temperature range of 180–220 °C. All glasses appear homogeneous considering their optical and electrical properties. Nevertheless, in SEM observations, some glass compositions appear to be heterogeneous after decoration following short nitric acid etching. For each composition, conductivity data obtained in the temperature range of 25–200 °C using impedance techniques obey an Arrhenius relationship with a composition independent pre-exponential term. Variation of the conductivity activation energy with x induces correlative variations of isothermal conductivity curves leading to an increase of the ionic conductivity of about one order of magnitude compared with linearity at 25 °C. This behaviour is discussed with respect to the thermodynamic properties of the glassy solutions. 相似文献
96.
We analyze some cases for which the Pollak–Grabert–Hänggi theory on the activated rate processes for generalized Langevin dynamics exhibits unexplained disagreements with numerical results. First we analyze carefully the PGH theory and we show that a kind of Markovian hypothesis implicitly made in the reasoning is sometimes violated. Then we propose modifications of the original theory in order to take into account the possible effects caused by this violation, and we compare the corrected results with simulations. 相似文献
97.
In this paper, we study the weak invariance of the multidimensional rank statistic when the underlying random variables are nonstationary absolutely regular. 相似文献
98.
Michel Nicolas 《原子核物理评论》2020,37(3):586-594
利用耦合道Gamow壳模型计算了17O和17F的低激发能谱以及16O(p,p)反应的低能弹性散射截面。结果表明,17O和17F中非束缚共振态能级的核子发射宽度的计算需要合理地考虑连续态耦合效应。计算得到的17O和17F的低激发能谱以及16O(p,p)反应的低能弹性散射激发函数都与实验数据吻合较好。这说明基于现实核力的计算可更好地描述16O(p,p)反应的低能弹性散射截面。 相似文献
99.
A tabu search procedure for multicommodity location/allocation with balancing requirements 总被引:2,自引:0,他引:2
Teodor G. Crainic Michel Gendreau Patrick Soriano Michel Toulouse 《Annals of Operations Research》1993,41(4):359-383
We propose a tabu search heuristic for the location/allocation problem with balancing requirements. This problem typically arises in the context of the medium term management of a fleet of containers of multiple types, where container depots have to be selected, the assignment of customers to depots has to be established for each type of container, and the interdepot container traffic has to be planned to account for differences in supplies and demands in various zones of the geographical territory served by a container shipping company. It is modeled as a mixed integer program, which combines zero-one location variables and a multicommodity network flow structure. Extensive computational results on a set of benchmark problems and comparisons with an efficient dual ascent procedure are reported. These show that tabu search is a competitive approach for this class of problems. 相似文献
100.
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite subgraphs) of the complete graph onn nodes. A well known class of facets ofP n arises from the triangle inequalities:x ij +x ik +x jk ≤ 2 andx ij -x ik -x jk ≤ 0 for 1 ≤i,j, k ≤n. Hence, the metric polytope Mn, defined as the solution set of the triangle inequalities, is a relaxation ofP n . We consider several properties of geometric type for Pn, in particular, concerning its position withinM n . Strengthening the known fact ([3]) thatP n has diameter 1, we show that any set ofk cuts,k ≤ log2 n, satisfying some additional assumption, determines a simplicial face ofM n and thus, also, ofP n . In particular, the collection of low dimension faces ofP n is contained in that ofM n . Among a large subclass of the facets ofP n , the triangle facets are the closest ones to the barycentrum of Pn and we conjecture that this result holds in general. The lattice generated by all even cuts (corresponding to bipartitions of the nodes into sets of even cardinality) is characterized and some additional questions on the links between general facets ofP n and its triangle facets are mentioned. 相似文献