全文获取类型
收费全文 | 4053篇 |
免费 | 403篇 |
国内免费 | 159篇 |
专业分类
化学 | 131篇 |
晶体学 | 3篇 |
力学 | 414篇 |
综合类 | 57篇 |
数学 | 3488篇 |
物理学 | 522篇 |
出版年
2024年 | 4篇 |
2023年 | 39篇 |
2022年 | 53篇 |
2021年 | 82篇 |
2020年 | 106篇 |
2019年 | 102篇 |
2018年 | 105篇 |
2017年 | 133篇 |
2016年 | 164篇 |
2015年 | 101篇 |
2014年 | 157篇 |
2013年 | 279篇 |
2012年 | 205篇 |
2011年 | 173篇 |
2010年 | 142篇 |
2009年 | 208篇 |
2008年 | 215篇 |
2007年 | 202篇 |
2006年 | 215篇 |
2005年 | 204篇 |
2004年 | 144篇 |
2003年 | 151篇 |
2002年 | 158篇 |
2001年 | 141篇 |
2000年 | 142篇 |
1999年 | 118篇 |
1998年 | 92篇 |
1997年 | 75篇 |
1996年 | 60篇 |
1995年 | 83篇 |
1994年 | 44篇 |
1993年 | 37篇 |
1992年 | 41篇 |
1991年 | 47篇 |
1990年 | 33篇 |
1989年 | 26篇 |
1988年 | 39篇 |
1987年 | 34篇 |
1986年 | 26篇 |
1985年 | 31篇 |
1984年 | 28篇 |
1983年 | 15篇 |
1982年 | 31篇 |
1981年 | 14篇 |
1980年 | 32篇 |
1979年 | 20篇 |
1978年 | 11篇 |
1977年 | 24篇 |
1976年 | 18篇 |
1975年 | 5篇 |
排序方式: 共有4615条查询结果,搜索用时 15 毫秒
71.
Zhang Zhongzhi Liu ChangrongSchool of Math. Science Central South Univ. Changsha China Dept. of Math. Hunan City Univ. Yiyang China. Faculty of Mathematics Econometrics Hunan Univ. Changsha China. 《高校应用数学学报(英文版)》2004,(3)
§1 IntroductionWe considerthe following inverse eigenvalue problem offinding an n-by-n matrix A∈S such thatAxi =λixi,i =1,2 ,...,m,where S is a given set of n-by-n matrices,x1 ,...,xm(m≤n) are given n-vectors andλ1 ,...,λmare given constants.Let X=(x1 ,...,xm) ,Λ=(λ1 ,λ2 ,...,λm) ,then the above inverse eigenvalue problemcan be written as followsProblem Given X∈Cn×m,Λ=(λ1 ,...,λm) ,find A∈S such thatAX =XΛ,where S is a given matrix set.We also discuss the so-called opti… 相似文献
72.
In this paper,we research general Defective Cion Problem under the model S,i.e,the number d of Defective cions is not fixed. For d=O,1,or 2. we get some good results. 相似文献
73.
在有限执行假设下对最优契约的扩展模型研究 总被引:1,自引:0,他引:1
本文运用违约保证金条款改进了代理人事前报酬契约;在契约有限执行的假设下,扩展了代理人的逆向选择模型,并运用扩展逆向选择模型分析了改进后的最优报酬契约。文章指出,改进后的最优报酬契约严格优于委托人为防范代理人违约而被迫采用的非负参与性约束条件下的最优报酬契约。 相似文献
74.
本文利用不连续罚函数方法将带有不等式约束的全局优化问题的求解转化为 讨论一非线性方程的求根问题,从而得到若干个全局最优性条件. 相似文献
75.
We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices. 相似文献
76.
本利用矩阵对的标准相关分解,得到了矩阵方程(A^TXB,B^TXB)=(C,D)反对称解存在的充分必要条件及通解表达式,同时给出了解关于已知矩阵的最佳逼近. 相似文献
77.
Shaping command input or preshaping is used for reducing system oscillation in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual oscillation. This technique, developed by N.C. Singer and W.P. Seering, is used for example in the aerospace field, in particular in flexible structure control. This paper presents the study of ZV shaper for explicit fractional derivative systems (generalized derivative systems). A robustness study of ZV shaper is then presented and applied to improve second generation CRONE control response time. Results from simulation and from a DC motor bench are also given. 相似文献
78.
Quantization consists in studying the L
r
-error induced by the approximation of a random vector X by a vector (quantized version) taking a finite number n of values. We investigate this problem for Gaussian random vectors in an infinite dimensional Banach space and in particular, for Gaussian processes. A precise link proved by Fehringer(4) and Dereich et al.
(3) relates lower and upper bounds for small ball probabilities with upper and lower bounds for the quantization error, respectively. We establish a complete relationship by showing that the same holds for the direction from the quantization error to small ball probabilities. This allows us to compute the exact rate of convergence to zero of the minimal L
r
-quantization error from logarithmic small ball asymptotics and vice versa. 相似文献
79.
In this paper we consider an obstacle control problem where the state satisfies a quasilinear elliptic variational inequality and the control function is the obstacle. The state is chosen to be close to the desire profile while the H2 norms of the obstacle is not too large. Existence and necessary conditions for the optimal control are established. 相似文献
80.
L. Fatone M. C. Recchioni F. Zirilli 《Journal of Optimization Theory and Applications》2004,121(2):223-257
In this paper, we consider furtivity and masking problems in time-dependent three-dimensional electromagnetic obstacle scattering. That is, we propose a criterion based on a merit function to minimize or to mask the electromagnetic field scattered by a bounded obstacle when hit by an incoming electromagnetic field and, with respect to this criterion, we drive the optimal strategy. These problems are natural generalizations to the context of electromagnetic scattering of the furtivity problem in time-dependent acoustic obstacle scattering presented in Ref. 1. We propose mathematical models of the furtivity and masking time-dependent three-dimensional electromagnetic scattering problems that consist in optimal control problems for systems of partial differential equations derived from the Maxwell equations. These control problems are approached using the Pontryagin maximum principle. We formulate the first-order optimality conditions for the control problems considered as exterior problems defined outside the obstacle for systems of partial differential equations. Moreover, the first-order optimality conditions derived are solved numerically with a highly parallelizable numerical method based on a perturbative series of the type considered in Refs. 2–3. Finally, we assess and validate the mathematical models and the numerical method proposed analyzing the numerical results obtained with a parallel implementation of the numerical method in several experiments on test problems. Impressive speedup factors are obtained executing the algorithms on a parallel machine when the number of processors used in the computation ranges between 1 and 100. Some virtual reality applications and some animations relative to the numerical experiments can be found in the website http://www.econ.unian.it/recchioni/w10/. 相似文献