全文获取类型
收费全文 | 26588篇 |
免费 | 991篇 |
国内免费 | 745篇 |
专业分类
化学 | 7206篇 |
晶体学 | 326篇 |
力学 | 661篇 |
综合类 | 55篇 |
数学 | 11478篇 |
物理学 | 8598篇 |
出版年
2023年 | 113篇 |
2022年 | 199篇 |
2021年 | 157篇 |
2020年 | 212篇 |
2019年 | 567篇 |
2018年 | 389篇 |
2017年 | 353篇 |
2016年 | 238篇 |
2015年 | 227篇 |
2014年 | 306篇 |
2013年 | 1247篇 |
2012年 | 633篇 |
2011年 | 1248篇 |
2010年 | 772篇 |
2009年 | 1069篇 |
2008年 | 1239篇 |
2007年 | 1253篇 |
2006年 | 1163篇 |
2005年 | 784篇 |
2004年 | 1151篇 |
2003年 | 1285篇 |
2002年 | 1823篇 |
2001年 | 1845篇 |
2000年 | 1690篇 |
1999年 | 1827篇 |
1998年 | 1580篇 |
1997年 | 968篇 |
1996年 | 499篇 |
1995年 | 307篇 |
1994年 | 260篇 |
1993年 | 136篇 |
1992年 | 130篇 |
1991年 | 107篇 |
1990年 | 185篇 |
1989年 | 172篇 |
1988年 | 109篇 |
1987年 | 93篇 |
1986年 | 137篇 |
1985年 | 202篇 |
1984年 | 189篇 |
1983年 | 86篇 |
1982年 | 152篇 |
1981年 | 244篇 |
1980年 | 240篇 |
1979年 | 114篇 |
1978年 | 176篇 |
1977年 | 105篇 |
1976年 | 79篇 |
1975年 | 82篇 |
1974年 | 76篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
981.
Glucose utilization by lysine-producing fluoroacetate-sensitive mutants ofCorynebacterium glutamicum
A fluoroacetate-sensitive mutant was isolated fromCorynebacterium glutamicum, ATCC 21513, following mutagenesis with NTG. Batch fermentations show that in terms of growth kinetics, glucose utilization,
and lysine formation, there are significant differences between the mutant and the parent. The mutant’s specific growth rate
(0.22/h) is lower than that for the parent (0.34/h). Also, the yield expressed as lysine/glucose consumed does not alter as
a function of the glucose concentration for the mutant, and is about 0.22, whereas for the parent, this coefficient decreases
with increasing glucose concentration. The maximum specific rate of lysine production for the mutant is 1.3 g/L/h that is
about two-fold higher than that for the parent. 相似文献
982.
William Kerby 《Aequationes Mathematicae》1991,41(1):187-191
Summary Nearfields of rank 2 over their kernel which are not Dickson nearfields have recently been constructed by H. Zassenhaus. Here it is shown that KT-nearfields of rank 2 over their kernels and of characteristic 2 are necessarily Dickson nearfields which are coupled to quadratic field extensions and their Dickson group is isomorphic to 2. Using results of Gröger one obtains all KT-nearfields of rank 2 over the field of rational numbers. 相似文献
983.
Summary This paper is devoted to the numerical analysis of a bidimensional two-phase Stefan problem. We approximate the enthalpy formulation byC
0 piecewise linear finite elements in space combined with a semi-implicit scheme in time. Under some restrictions related to the finite element mesh and to the timestep, we prove positivity, stability and convergence results. Various numerial tests are presented and discussed in order to show the accuracy of our scheme.This work is supported by the Fonds National Suisse pour la Recherche Scientifique. 相似文献
984.
Irena Lasiecka 《Numerische Mathematik》1992,63(1):357-390
Summary Approximations schemes for the solutions of the Algebraic Riccati Equations will be considered. We shall concentrate on the case when the input operator is unbounded and the dynamics of the system is described by an analytic semigroup. The main goal of the paper is to establish the optimal rates of convergence of the underlying approximations. By optimal, we mean such approximations which would reconstruct the optimal regularity of the original solutions as well as the best approximation properties of the finite-dimensional subspaces. It turns out that, if one aims to obtain the optimal rates in the case of unbounded input operators, the choice of the approximations to the generator, as well as to the control operator, is very critical. While the convergence results hold with any consistent approximations, the optimal rates require a careful selection of the approximating schemes. Our theoretical results will be illustrated by several examples of boundary/point control problems where the optimal rates of convergence are achieved with the appropriate numerical algorithms.Research partially supported by the NSF Grant DMS-8301668 and by the AFOSR Grant AFOSR 89-0511 相似文献
985.
Roy Mathias 《Numerische Mathematik》1992,63(1):213-226
LetM
n
denote the space ofn×n matrices. GivenX, ZM
n
define
相似文献
986.
We consider a class of multitype particle systems in
d
undergoing spatial diffusion and critical stable multitype branching, and their limits known as critical stable multitype Dawson-Watanabe processes, or superprocesses. We show that for large classes of initial states, the particle process and the superprocess converge in distribution towards known equilibrium states as time tends to infinity. As an application we obtain the asymptotic behavior of a system of nonlinear partial differential equations whose solution is related to the distribution of both the particle process and the superprocess.Research partially supported by CONACyT (Mexico), CNRS (France) and BMfWuF (Austria). 相似文献
987.
V. I. Levenshtein 《Acta Appl Math》1992,29(1-2):1-82
Finite and infinite metric spaces % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] that are polynomial with respect to a monotone substitution of variable t(d) are considered. A finite subset (code) W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] is characterized by the minimal distance d(W) between its distinct elements, by the number l(W) of distances between its distinct elements and by the maximal strength (W) of the design generated by the code W. A code W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] is called a maximum one if it has the greatest cardinality among subsets of % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] with minimal distance at least d(W), and diametrical if the diameter of W is equal to the diameter of the whole space % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\]. Delsarte codes are codes W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] with (W)2l(W)–1 or (W)=2l(W)–2>0 and W is a diametrical code. It is shown that all parameters of Delsarte codes W) % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] are uniquely determined by their cardinality |W| or minimal distance d(W) and that the minimal polynomials of the Delsarte codes W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \] % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] are expansible with positive coefficients in an orthogonal system of polynomials {Q
i(t)} corresponding to % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\]. The main results of the present paper consist in a proof of maximality of all Delsarte codes provided that the system {Q
i)} satisfies some condition and of a new proof confirming in this case the validity of all the results on the upper bounds for the maximum cardinality of codes W % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaeyOHI0maaa!36D8!\[ \subseteq \]% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xa8nbaa!427C!\[\mathfrak{M}\] with a given minimal distance, announced by the author in 1978. Moreover, it appeared that this condition is satisfied for all infinite polynomial metric spaces as well as for distance-regular graphs, decomposable in a sense defined below. It is also proved that with one exception all classical distance-regular graphs are decomposable. In addition for decomposable distance-regular graphs an improvement of the absolute Delsarte bound for diametrical codes is obtained. For the Hamming and Johnson spaces, Euclidean sphere, real and complex projective spaces, tables containing parameters of known Delsarte codes are presented. Moreover, for each of the above-mentioned infinite spaces infinite sequences (of maximum) Delsarte codes not belonging to tight designs are indicated. 相似文献
988.
We study topological conditions that must be satisfied by a compactC ∞ Levi-flat hypersurface in a two-dimensional complex manifold, as well as related questions about the holonomy of Levi-flat hypersurfaces. As a consequence of our work, we show that no two-dimensional complex manifold admits a subdomain Ω with compact nonemptyC ∞ boundary such that Ω ? ?2. 相似文献
989.
C60和C70等碳笼烯的发现及其在新物质、新材料等研究领域中的重要性,激励人们去探索合成更多新型多面体碳簇化合物与碳元素类似物[1,2].最近,两类新型多面体碳管笼烯的设想提出来了[3,4]应用HMO和MNDO方法对其稳定性变化规律、结构和成键特征进行了讨论.关于多苯的vanderWaals簇实验上已有广泛的调查[5,6],理论上对其二聚物(C6H6)。的不同几何构型与稳定性进行了深入的研究[7].本文采用abinitio计算有效势(effectivecorePotential)方法,对C12碳管元素簇和C12H12,碳管烷的平衡结构、稳定性和价键特征进行了理论预测.1… 相似文献
990.
《Arabian Journal of Chemistry》2022,15(4):103707
Alsophila spinulosa is a tree-like fern, and many evidences suggested that plant polyphenols had the potential therapeutic for Alzheimer s disease (AD). Herein, polyphenols (ASP) was isolated from A. spinulosa leaves and its major constituent were isoorientin and vitexin. ASP displayed excellent antioxidant activity and obvious anti-lipid peroxidation capacity in vitro. ASP improved the survival rate of C. elegans under high temperature by enhancing the antioxidant enzymes activities and decreasing the lipid peroxidation level. Moreover, ASP alleviated β-amyloid (Aβ) induced paralysis and reduced Aβ deposition, decreased reactive oxygen species (ROS) accumulation and improved the level of skn-1 mRNA. In addition, ASP decreased the levels of pdk-1 and akt-1 mRNA in P13K/AKT signaling pathway. In conclusion, ASP may be a potential ingredient for the alleviation of AD. 相似文献
|