首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1716篇
  免费   60篇
  国内免费   26篇
化学   1077篇
晶体学   7篇
力学   61篇
数学   257篇
物理学   400篇
  2023年   14篇
  2022年   26篇
  2021年   25篇
  2020年   45篇
  2019年   30篇
  2018年   22篇
  2017年   15篇
  2016年   36篇
  2015年   29篇
  2014年   47篇
  2013年   72篇
  2012年   115篇
  2011年   118篇
  2010年   69篇
  2009年   59篇
  2008年   118篇
  2007年   78篇
  2006年   91篇
  2005年   96篇
  2004年   71篇
  2003年   60篇
  2002年   60篇
  2001年   43篇
  2000年   41篇
  1999年   20篇
  1998年   17篇
  1997年   9篇
  1996年   24篇
  1995年   14篇
  1994年   24篇
  1993年   26篇
  1992年   19篇
  1991年   23篇
  1990年   19篇
  1989年   16篇
  1988年   9篇
  1987年   10篇
  1986年   17篇
  1985年   13篇
  1984年   26篇
  1983年   12篇
  1982年   14篇
  1981年   8篇
  1980年   10篇
  1979年   11篇
  1978年   8篇
  1977年   19篇
  1976年   12篇
  1974年   12篇
  1973年   10篇
排序方式: 共有1802条查询结果,搜索用时 20 毫秒
971.
In this paper, the problem of estimating the scale matrix and their eigenvalues in a Wishart distribution and in a multivariate F distribution (which arise naturally from a two-sample setting) are considered. A new class of estimators which shrink the eigenvalues towards their arithmetic mean are proposed. It is shown that the new estimator which dominates the usual unbiased estimator under the squared error loss function. A simulation study was carried out to study the performance of these estimators.  相似文献   
972.
A set S of vertices of the graph G is called k-reducible if the following is true: G is k-choosable if and only if G-S is k-choosable. A k-reduced subgraphH of G is a subgraph of G such that H contains no k-reducible set of some specific forms. In this paper, we show that a 3-reduced subgraph of a non-3-choosable plane graph G contains either adjacent 5-faces, or an adjacent 4-face and k-face, where k?6. Using this result, we obtain some sufficient conditions for a plane graph to be 3-choosable. In particular, if G is of girth 4 and contains no 5- and 6-cycles, then G is 3-choosable.  相似文献   
973.
974.
This paper investigates the synchronization of chaotic systems using an output feedback polynomial controller. As only output system states are considered, it makes the controller design and system analysis more challenging compared to the full-state feedback control schemes. To study the system stability and synthesize the output feedback polynomial controller, Lyapunov stability theory is employed. Sufficient stability conditions are derived in terms of sum of squares (SOS) conditions to guarantee the system stability and aid the controller synthesis. A genetic algorithm-based SOS technique is proposed to find the solution to the SOS conditions and the parameter values of the output feedback polynomial controller. A simulation example is employed to illustrate the effectiveness of the proposed approach.  相似文献   
975.
This paper deals with the problem of guaranteed cost control for uncertain neutral stochastic systems. The parameter uncertainties are assumed to be time-varying but norm-bounded. Dynamic output feedback controllers are designed such that, for all admissible uncertainties, the resulting closed-loop system is mean-square asymptotically stable and an upper bound on the closed-loop value of the cost function is guaranteed. By employing a linear matrix inequality (LMI) approach, a sufficient condition for the solvability of the underlying problem is obtained. A numerical example is provided to demonstrate the potential of the proposed techniques.  相似文献   
976.
Experiments and theory in strain gradient elasticity   总被引:2,自引:0,他引:2  
Conventional strain-based mechanics theory does not account for contributions from strain gradients. Failure to include strain gradient contributions can lead to underestimates of stresses and size-dependent behaviors in small-scale structures. In this paper, a new set of higher-order metrics is developed to characterize strain gradient behaviors. This set enables the application of the higher-order equilibrium conditions to strain gradient elasticity theory and reduces the number of independent elastic length scale parameters from five to three. On the basis of this new strain gradient theory, a strain gradient elastic bending theory for plane-strain beams is developed. Solutions for cantilever bending with a moment and line force applied at the free end are constructed based on the new higher-order bending theory. In classical bending theory, the normalized bending rigidity is independent of the length and thickness of the beam. In the solutions developed from the higher-order bending theory, the normalized higher-order bending rigidity has a new dependence on the thickness of the beam and on a higher-order bending parameter, bh. To determine the significance of the size dependence, we fabricated micron-sized beams and conducted bending tests using a nanoindenter. We found that the normalized beam rigidity exhibited an inverse squared dependence on the beam's thickness as predicted by the strain gradient elastic bending theory, and that the higher-order bending parameter, bh, is on the micron-scale. Potential errors from the experiments, model and fabrication were estimated and determined to be small relative to the observed increase in beam's bending rigidity. The present results indicate that the elastic strain gradient effect is significant in elastic deformation of small-scale structures.  相似文献   
977.
In this paper, a contextual approach to teaching Mathematics at the pre-university level is recommended, and an example is illustrated. A context in the form of a real common mathematical problem is presented to the students. Different approaches to tackle the problem (from topics within and outside the syllabus) can be elicited from students. The insight obtained from the various methods of solving the problem can be used to deepen students’ learnt concepts and to enhance concepts to be learnt later in the curriculum.  相似文献   
978.
We study the problem of scheduling n non-preemptive jobs on m unrelated parallel machines. Each machine can process a specified subset of the jobs. If a job is assigned to a machine, then it occupies a specified time interval on the machine. Each assignment of a job to a machine yields a value. The objective is to find a subset of the jobs and their feasible assignments to the machines such that the total value is maximized. The problem is NP-hard in the strong sense. We reduce the problem to finding a maximum weight clique in a graph and survey available solution methods. Furthermore, based on the peculiar properties of graphs, we propose an exact solution algorithm and five heuristics. We conduct computer experiments to assess the performance of our and other existing heuristics. The computational results show that our heuristics outperform the existing heuristics.  相似文献   
979.
A (v, k, λ, μ)-perfect addition set is a subset A of ZυZ with k elements such that the expression ai + aj, for aiaj in A, represents 0 exactly μ times and each nonzero element exactly λ times. Several infinite classes of such sets using quadratic residues of primes, a few isolated examples using cubic residues, and a construction in certain cases when υ is twice an odd integer, are give. There is an efficient method, based on the Chinese remainder theorem, which decides the existence or nonexistence of a perfect addition set. Some further results on nonexistence are given. In particular, two previously unsolved cases of Isbell (Discrete Math. 24 (1978), 13–18) are settled. The article ends with a list of nontrivial perfect addition sets with k ? 20.  相似文献   
980.
The purpose of this paper is threefold. First, we prove sharp singular affine Moser–Trudinger inequalities on both bounded and unbounded domains in \({\mathbb {R}}^{n}\). In particular, we will prove the following much sharper affine Moser–Trudinger inequality in the spirit of Lions (Rev Mat Iberoamericana 1(2):45–121, 1985) (see our Theorem 1.4): Let \(\alpha _{n}=n\left( \frac{n\pi ^{\frac{n}{2}}}{\Gamma (\frac{n}{2}+1)}\right) ^{\frac{1}{n-1}}\), \(0\le \beta <n\) and \(\tau >0\). Then there exists a constant \(C=C\left( n,\beta \right) >0\) such that for all \(0\le \alpha \le \left( 1-\frac{\beta }{n}\right) \alpha _{n}\) and \(u\in C_{0}^{\infty }\left( {\mathbb {R}}^{n}\right) \setminus \left\{ 0\right\} \) with the affine energy \(~{\mathcal {E}}_{n}\left( u\right) <1\), we have
$$\begin{aligned} {\displaystyle \int \nolimits _{{\mathbb {R}}^{n}}} \frac{\phi _{n,1}\left( \frac{2^{\frac{1}{n-1}}\alpha }{\left( 1+{\mathcal {E}}_{n}\left( u\right) ^{n}\right) ^{\frac{1}{n-1}}}\left| u\right| ^{\frac{n}{n-1}}\right) }{\left| x\right| ^{\beta }}dx\le C\left( n,\beta \right) \frac{\left\| u\right\| _{n}^{n-\beta }}{\left| 1-{\mathcal {E}}_{n}\left( u\right) ^{n}\right| ^{1-\frac{\beta }{n}}}. \end{aligned}$$
Moreover, the constant \(\left( 1-\frac{\beta }{n}\right) \alpha _{n}\) is the best possible in the sense that there is no uniform constant \(C(n, \beta )\) independent of u in the above inequality when \(\alpha >\left( 1-\frac{\beta }{n}\right) \alpha _{n}\). Second, we establish the following improved Adams type inequality in the spirit of Lions (Theorem 1.8): Let \(0\le \beta <2m\) and \(\tau >0\). Then there exists a constant \(C=C\left( m,\beta ,\tau \right) >0\) such that
$$\begin{aligned} \underset{u\in W^{2,m}\left( {\mathbb {R}}^{2m}\right) , \int _{ {\mathbb {R}}^{2m}}\left| \Delta u\right| ^{m}+\tau \left| u\right| ^{m} \le 1}{\sup } {\displaystyle \int \nolimits _{{\mathbb {R}}^{2m}}} \frac{\phi _{2m,2}\left( \frac{2^{\frac{1}{m-1}}\alpha }{\left( 1+\left\| \Delta u\right\| _{m}^{m}\right) ^{\frac{1}{m-1}}}\left| u\right| ^{\frac{m}{m-1}}\right) }{\left| x\right| ^{\beta }}dx\le C\left( m,\beta ,\tau \right) , \end{aligned}$$
for all \(0\le \alpha \le \left( 1-\frac{\beta }{2m}\right) \beta (2m,2)\). When \(\alpha >\left( 1-\frac{\beta }{2m}\right) \beta (2m,2)\), the supremum is infinite. In the above, we use
$$\begin{aligned} \phi _{p,q}(t)=e^{t}- {\displaystyle \sum \limits _{j=0}^{j_{\frac{p}{q}}-2}} \frac{t^{j}}{j!},\,\,\,j_{\frac{p}{q}}=\min \left\{ j\in {\mathbb {N}} :j\ge \frac{p}{q}\right\} \ge \frac{p}{q}. \end{aligned}$$
The main difficulties of proving the above results are that the symmetrization method does not work. Therefore, our main ideas are to develop a rearrangement-free argument in the spirit of Lam and Lu (J Differ Equ 255(3):298–325, 2013; Adv Math 231(6): 3259–3287, 2012), Lam et al. (Nonlinear Anal 95: 77–92, 2014) to establish such theorems. Third, as an application, we will study the existence of weak solutions to the biharmonic equation
$$\begin{aligned} \left\{ \begin{array}{l} \Delta ^{2}u+V(x)u=f(x,u)\text { in }{\mathbb {R}}^{4}\\ u\in H^{2}\left( {\mathbb {R}}^{4}\right) ,~u\ge 0 \end{array} \right. , \end{aligned}$$
where the nonlinearity f has the critical exponential growth.
  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号