全文获取类型
收费全文 | 718篇 |
免费 | 18篇 |
国内免费 | 39篇 |
专业分类
化学 | 77篇 |
力学 | 16篇 |
综合类 | 2篇 |
数学 | 614篇 |
物理学 | 66篇 |
出版年
2023年 | 7篇 |
2022年 | 8篇 |
2021年 | 13篇 |
2020年 | 11篇 |
2019年 | 9篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 23篇 |
2013年 | 59篇 |
2012年 | 27篇 |
2011年 | 40篇 |
2010年 | 46篇 |
2009年 | 55篇 |
2008年 | 73篇 |
2007年 | 57篇 |
2006年 | 50篇 |
2005年 | 34篇 |
2004年 | 25篇 |
2003年 | 27篇 |
2002年 | 14篇 |
2001年 | 12篇 |
2000年 | 13篇 |
1999年 | 18篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 13篇 |
1994年 | 13篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1976年 | 5篇 |
1974年 | 1篇 |
排序方式: 共有775条查询结果,搜索用时 146 毫秒
71.
XinguoLiu ZhengjianBai 《计算数学(英文版)》2003,21(2):201-206
In this note,we consider the backward errors for more general inverse eigenvalus prob-lems by extending Sun‘‘‘‘s approach.The optimal backward errors defined for diagonal-ization matrix inverse eigenvalue problem with respect to an approximate solution,and the upper and lower bounds are derived for the optimal backward errors.The results may be useful for testing the stability of practical algorithms. 相似文献
72.
可加的广义代数格范畴与 T0 拓扑空间范畴相等价, 从这个观点出发, 作者把可加广义代数格作为一个闭集格, 在其上建立 Urysohn 引理和 Tietze 扩张定理. 这是拓扑理论在格上的一种新推广, 有助于格上拓扑理论的研究和广义连续格理论的应用. 相似文献
73.
A new kind of the thermo-sensitive and fluorescent complex of poly(N-isopropylacrylamide) (PNIPAM) and Tb(III) was synthesized by free radical polymerization, in which PNIPAM was used as a polymer ligand. The complex was characterized by using X-ray photoelectron spectroscopy (XPS), ultraviolet-visual (UV), Fourier transform infrared (FT-IR) and fluorescence spectroscopy. The results from the experiments indicated that there is a strong interaction between PNIPAM and Tb(III), leading to a decrease in the electron density of nitrogen and oxygen atoms and an increase in the electron density of Tb(III) in the PNIPAM containing Tb(III) by contrast with PNIPAM and Tb(III), respectively, meanwhile, exhibiting that the Tb(III) is mainly bonded to oxygen atoms in the polymer chain of PNIPAM and formed the complex of PNIPAM-Tb(III). After forming the PNIPAM-Tb(III) complex, the emission fluorescence intensity of Tb(III) in the PNIPAM-Tb(III) complex is significantly enhanced because the effective intramolecular energy transfer from PNIPAM to Tb(III). Especially, the emission intensity of the fluorescence peak at 547 nm can be increased as high as 145 times comparing with that of the pure Tb(III). The intramolecular energy transfer efficiency for fluorescence peak at 547 nm can reach as high as 68%. The fluorescence intensity is related the weight ratio of Tb(III) and PNIPAM in the PNIPAM-Tb(III) complex. When the weight ratio is 1.4%, the maximum fluorescence enhancement can be obtained. Nevertheless, the lower critical solution temperature of PNIPAM containing a low content of Tb(III) has not obviously changed after the formation of the complex of PNIPAM-Tb(III) by the interaction between PNIPAM and Tb(III). This novel thermosensitive and fluorescence characterization of the PNIPAM-Tb(III) complex may be useful in the fluorescence systems and the biomedical field. 相似文献
74.
Bounded knapsack sharing 总被引:1,自引:0,他引:1
J. Randall Brown 《Mathematical Programming》1994,67(1-3):343-382
A bounded knapsack sharing problem is a maximin or minimax mathematical programming problem with one or more linear inequality constraints, an objective function composed of single variable continuous functions called tradeoff functions, and lower and upper bounds on the variables. A single constraint problem which can have negative or positive constraint coefficients and any type of continuous tradeoff functions (including multi-modal, multiple-valued and staircase functions) is considered first. Limiting conditions where the optimal value of a variable may be plus or minus infinity are explicitly considered. A preprocessor procedure to transform any single constraint problem to a finite form problem (an optimal feasible solution exists with finite variable values) is developed. Optimality conditions and three algorithms are then developed for the finite form problem. For piecewise linear tradeoff functions, the preprocessor and algorithms are polynomially bounded. The preprocessor is then modified to handle bounded knapsack sharing problems with multiple constraints. An optimality condition and algorithm is developed for the multiple constraint finite form problem. For multiple constraints, the time needed for the multiple constraint finite form algorithm is the time needed to solve a single constraint finite form problem multiplied by the number of constraints. Some multiple constraint problems cannot be transformed to multiple constraint finite form problems. 相似文献
75.
N. S. Papageorgiou 《Journal of Optimization Theory and Applications》1990,64(1):207-215
In this paper, we prove the existence of solutions for an integral inclusion of Urysohn type with nonconvex orientor field and with delay. We make standard boundedness and continuity assumptions on the data, and we assume that the orientor field is l.s.c. in the state variable. Using a selection theorem of Fryszkowski, we are able to prove the existence of solutions, extending an earlier result of Angell.This research was supported by NSF Grant No. DMS-86-02313. 相似文献
76.
Prof. Dr. U. Rieder 《Mathematical Methods of Operations Research》1991,35(6):473-490
A general partially observed control model with discrete time parameter is investigated. Our main interest concerns monotonicity results and bounds for the value functions and for optimal policies. In particular, we show how the value functions depend on the observation kernels and we present conditions for a lower bound of an optimal policy. Our approach is based on two multivariate stochastic orderings: theTP
2 ordering and the Blackwell ordering.Dedicated to Prof. Dr. K. Hinderer on the occassion of his 60th birthday 相似文献
77.
In this paper we study tight lower bounds on the size of a maximum matching in a regular graph. For k ≥3, let G be a connected k-regular graph of order n and let α′(G) be the size of a maximum matching in G. We show that if k is even, then
, while if k is odd, then
. We show that both bounds are tight.
Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal. 相似文献
78.
79.
The conductivity or bulk modulus of an isotropic composite consisting of two well-ordered isotropic phases is situated between the lower and upper bounds of Hashin and Shtrikman. This work is concerned with the construction of two new microstructures capable of realizing every conductivity or bulk modulus comprised between these bounds. The two microstructures obtained, appearing to be simpler than those presented in the literature to achieve the same purpose, have the property that the variation of the corresponding conductivity or bulk modulus is strictly monotone with respect to the geometric parameter characterizing them. To cite this article: Q.-C. He, H.L. Quang, C. R. Mecanique 333 (2005). 相似文献
80.
由地质作用影响形成的易出险堤段称为地质险段 ,主要包括活断层作用影响形成的堤基易渗漏段、强地震高发区段和地基稳定性差段等。构造节点是识别地质险段的重要的河流地貌标志之一。根据成因 ,本文将黄河下游的地质险段分为三类 ,即新构造险段、沉降险段、断裂复活险段。针对黄河下游堤防地质特征 ,圈定出东坝头、大刘屯—董口黄河南岸和路那里—十里堡黄河南岸地质险段 ,提出了治理的有关措施 相似文献