全文获取类型
收费全文 | 3038篇 |
免费 | 96篇 |
国内免费 | 21篇 |
专业分类
化学 | 2044篇 |
晶体学 | 20篇 |
力学 | 118篇 |
数学 | 525篇 |
物理学 | 448篇 |
出版年
2023年 | 27篇 |
2022年 | 49篇 |
2021年 | 45篇 |
2020年 | 50篇 |
2019年 | 77篇 |
2018年 | 45篇 |
2017年 | 28篇 |
2016年 | 85篇 |
2015年 | 95篇 |
2014年 | 111篇 |
2013年 | 156篇 |
2012年 | 215篇 |
2011年 | 247篇 |
2010年 | 157篇 |
2009年 | 135篇 |
2008年 | 172篇 |
2007年 | 186篇 |
2006年 | 191篇 |
2005年 | 187篇 |
2004年 | 176篇 |
2003年 | 112篇 |
2002年 | 116篇 |
2001年 | 44篇 |
2000年 | 41篇 |
1999年 | 24篇 |
1998年 | 31篇 |
1997年 | 28篇 |
1996年 | 24篇 |
1995年 | 25篇 |
1994年 | 10篇 |
1993年 | 23篇 |
1992年 | 11篇 |
1991年 | 8篇 |
1990年 | 4篇 |
1989年 | 11篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 20篇 |
1983年 | 13篇 |
1982年 | 19篇 |
1981年 | 13篇 |
1980年 | 22篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 9篇 |
1973年 | 10篇 |
排序方式: 共有3155条查询结果,搜索用时 0 毫秒
91.
Florence Drui Emmanuel Franck Philippe Helluy Laurent Navoret 《Comptes Rendus Mecanique》2019,347(3):259-269
The over-relaxation approach is an alternative to the Jin–Xin relaxation method in order to apply the equilibrium source term in a more precise way. This is also a key ingredient of the lattice Boltzmann method for achieving second-order accuracy. In this work, we provide an analysis of the over-relaxation kinetic scheme. We compute its equivalent equation, which is particularly useful for devising stable boundary conditions for the hidden kinetic variables. 相似文献
92.
93.
94.
Liang Chen Yu Fan Jieru Qiu Dr. Régis Laurent Jin Li Prof. Dr. Jérôme Bignon Prof. Dr. Serge Mignani Prof. Dr. Anne-Marie Caminade Prof. Dr. Xiangyang Shi Prof. Dr. Jean-Pierre Majoral 《Chemistry (Weinheim an der Bergstrasse, Germany)》2020,26(26):5903-5910
First-in-class CuII and AuIII metaled phosphorus dendrons were synthesized and showed significant antiproliferative activity against several aggressive breast cancer cell lines. The data suggest that the cytotoxicity increases with reducing length of the alkyl chains, whereas the replacement of CuII with AuIII considerably increases the antiproliferative activity of metaled phosphorus dendrons. Very interestingly, we found that the cell death pathway is related to the nature of the metal complexed by the plain dendrons. CuII metaled dendrons showed a potent caspase-independent cell death pathway, whereas AuIII metaled dendrons displayed a caspase-dependent apoptotic pathway. The complexation of plain dendrons with AuIII increased the cellular lethality versus dendrons with CuII and promoted the translocation of Bax into the mitochondria and the release of Cytochrome C (Cyto C). 相似文献
95.
Monique Laurent 《Mathematical Programming》2007,109(2-3):239-261
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras.
The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located
between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with
O(n
7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n
3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s
bound with the same computational complexity.
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203. 相似文献
96.
We propose here a well-balanced numerical scheme for the one-dimensional Goldstein–Taylor system which is endowed with all the stability properties inherent to the continuous problem and works in both rarefied and diffusive regimes. To cite this article: L. Gosse, G. Toscani, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 337–342. 相似文献
97.
In this Note, we propose a finite element method with Lagrange multipliers in order to approximate contact problems with friction. The discretized normal and tangential constraints at the candidate contact interface are expressed by using continuous piecewise linear Lagrange multipliers in the saddle-point formulation. An optimal error estimate is established and several numerical studies corresponding to this choice of the discretized normal and tangential constraints are achieved. To cite this article: L. Baillet, T. Sassi, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 917–922. 相似文献
98.
If the Riemann–Christoffel tensor associated with a field of class of positive definite symmetric matrices of order three vanishes in a connected and simply connected open subset , then this field is the metric tensor field associated with a deformation of class of the set , uniquely determined up to isometries of . We establish here that the mapping defined in this fashion is continuous, for ad hoc metrizable topologies. To cite this article: P.G. Ciarlet, F. Laurent, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 489–493. 相似文献
99.
Pioger P Couderc V Lefort L Barthelemy A Baronio F De Angelis C Min Y Quiring V Sohler W 《Optics letters》2002,27(24):2182-2184
We show numerically and experimentally that spatial trapping can be induced in quadratic media even if the pump pulse's duration is shorter than the group-delay mismatch between fundamental wave and second-harmonic components. The influence of phase mismatch and pulse power on the trapping effect is discussed. Spatial, temporal, and spectral behaviors that accompany self-trapped propagation are highlighted. 相似文献
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. 相似文献