全文获取类型
收费全文 | 5843篇 |
免费 | 577篇 |
国内免费 | 531篇 |
专业分类
化学 | 425篇 |
晶体学 | 5篇 |
力学 | 408篇 |
综合类 | 105篇 |
数学 | 4263篇 |
物理学 | 1745篇 |
出版年
2024年 | 4篇 |
2023年 | 47篇 |
2022年 | 72篇 |
2021年 | 71篇 |
2020年 | 109篇 |
2019年 | 117篇 |
2018年 | 105篇 |
2017年 | 129篇 |
2016年 | 158篇 |
2015年 | 129篇 |
2014年 | 217篇 |
2013年 | 479篇 |
2012年 | 279篇 |
2011年 | 338篇 |
2010年 | 285篇 |
2009年 | 380篇 |
2008年 | 411篇 |
2007年 | 397篇 |
2006年 | 403篇 |
2005年 | 311篇 |
2004年 | 277篇 |
2003年 | 261篇 |
2002年 | 251篇 |
2001年 | 224篇 |
2000年 | 201篇 |
1999年 | 204篇 |
1998年 | 169篇 |
1997年 | 123篇 |
1996年 | 133篇 |
1995年 | 72篇 |
1994年 | 77篇 |
1993年 | 63篇 |
1992年 | 44篇 |
1991年 | 40篇 |
1990年 | 42篇 |
1989年 | 24篇 |
1988年 | 41篇 |
1987年 | 25篇 |
1986年 | 21篇 |
1985年 | 33篇 |
1984年 | 34篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 17篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 8篇 |
1974年 | 7篇 |
排序方式: 共有6951条查询结果,搜索用时 15 毫秒
991.
We study an assembly-like queueing system one of whose queues has items with generally distributed time-constraints, where this system has a single server providing services using each item individually. It is well-known that analysis of a queueing system which has items with time-constraint (i.e., impatient items) is difficult since the analytical model must involve all the departure times of these impatient items. We therefore propose to employ the techniques of Whitt’s approximation and show the method for obtaining the stationary distribution of the model. Through some simulation experiments, we discuss the validation of our approximation model, and show that the approximation is accurate in various kinds of situations (e.g., service time distribution and the number of queues). 相似文献
992.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
993.
《Mathematical Methods in the Applied Sciences》2018,41(14):5691-5710
We consider a 2 time scale nonlinear system of ordinary differential equations. The small parameter of the system is the ratio ϵ of the time scales. We search for an approximation involving only the slow time unknowns and valid uniformly for all times at order O(ϵ2). A classical approach to study these problems is Tikhonov's singular perturbation theorem. We develop an approach leading to a higher order approximation using the renormalization group (RG) method. We apply it in 2 steps. In the first step, we show that the RG method allows for approximation of the fast time variables by their RG expansion taken at the slow time unknowns. Next, we study the slow time equations, where the fast time unknowns are replaced by their RG expansion. This allows to rigorously show the second order uniform error estimate. Our result is a higher order extension of Hoppensteadt's work on the Tikhonov singular perturbation theorem for infinite times. The proposed procedure is suitable for problems from applications, and it is computationally less demanding than the classical Vasil'eva‐O'Malley expansion. We apply the developed method to a mathematical model of stem cell dynamics. 相似文献
994.
A typical class of boundary conditions for squeeze flow problems in lubrication approximation is the one in which the squeezing rate and the width between the squeezing plates are constant. This hypothesis is justified by claiming that the plates moves so slowly that they can be considered static. In this short note we prove that this assumption leads to a contradiction and hence cannot be used. 相似文献
995.
996.
Even though approximated, strong coupling non-perturbative QCD amplitudes remain very difficult to obtain. In this article, in eikonal and quenched approximations at least, physical insights are presented that rely on the newly-discovered property of effective locality. The present article also provides a more rigorous mathematical basis for the crude approximations used in the previous derivation of the binding potential of quarks and nucleons. Furthermore, the techniques of Random Matrix calculus along with Meijer G-functions are applied to analyze the generic structure of fermionic amplitudes in QCD. 相似文献
997.
We consider the following problem. Given a finite set of pointsy
j in
we want to determine a hyperplane H such that the maximum Euclidean distance betweenH and the pointsy
j is minimized. This problem(CHOP) is a non-convex optimization problem with a special structure. Forexample, all local minima can be shown to be strongly unique. We present agenericity analysis of the problem. Two different global optimizationapproaches are considered for solving (CHOP). The first is a Lipschitzoptimization method; the other a cutting plane method for concaveoptimization. The local structure of the problem is elucidated by analysingthe relation between (CHOP) and certain associated linear optimizationproblems. We report on numerical experiments. 相似文献
998.
A numerical treatment for the Dirichlet boundary value problem on regular triangular grids for homogeneous Helmholtz equations is presented, which also applies to the convection-diffusion problems. The main characteristic of the method is that an accuracy estimate is provided in analytical form with a better evaluation than that obtained with the usual finite difference method. Besides, this classical method can be seen as a truncated series approximation to the proposed method. The method is developed from the analytical solutions for the Dirichlet problem on a ball together with an error evaluation of an integral on the corresponding circle, yielding accuracy. Some numerical examples are discussed and the results are compared with other methods, with a consistent advantage to the solution obtained here.
999.
Andrew V. Knyazev. 《Mathematics of Computation》1997,66(219):985-995
The following estimate for the Rayleigh-Ritz method is proved:
Here is a bounded self-adjoint operator in a real Hilbert/euclidian space, one of its eigenpairs, a trial subspace for the Rayleigh-Ritz method, and a Ritz pair. This inequality makes it possible to analyze the fine structure of the error of the Rayleigh-Ritz method, in particular, it shows that if an eigenvector is close to the trial subspace with accuracy and a Ritz vector is an approximation to another eigenvector, with a different eigenvalue. Generalizations of the estimate to the cases of eigenspaces and invariant subspaces are suggested, and estimates of approximation of eigenspaces and invariant subspaces are proved.
1000.
Fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in by trigonometric polynomials are presented. The algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only arithmetic operations as compared to operations needed for algorithms that ignore the structure of the problem. An algorithm which solves this problem with real-valued data and real-valued solution using only real arithmetic is given. Numerical examples are presented that show that the proposed algorithms produce consistently accurate results that are often better than those obtained by general QR decomposition methods for the least-squares problem.