首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6264篇
  国内免费   341篇
  完全免费   140篇
  数学   6745篇
  2019年   102篇
  2018年   314篇
  2017年   112篇
  2016年   86篇
  2015年   200篇
  2014年   454篇
  2013年   371篇
  2012年   416篇
  2011年   842篇
  2010年   703篇
  2009年   750篇
  2008年   553篇
  2007年   304篇
  2006年   256篇
  2005年   208篇
  2004年   152篇
  2003年   116篇
  2002年   147篇
  2001年   75篇
  2000年   61篇
  1999年   72篇
  1998年   66篇
  1997年   48篇
  1996年   53篇
  1995年   47篇
  1994年   34篇
  1993年   18篇
  1992年   17篇
  1991年   13篇
  1990年   12篇
  1989年   24篇
  1988年   10篇
  1987年   8篇
  1986年   9篇
  1985年   4篇
  1984年   3篇
  1983年   1篇
  1982年   14篇
  1981年   10篇
  1980年   2篇
  1979年   1篇
  1978年   5篇
  1977年   2篇
  1976年   3篇
  1975年   2篇
  1974年   1篇
  1973年   6篇
  1972年   4篇
  1971年   5篇
  1970年   2篇
  1969年   5篇
  1968年   3篇
  1967年   2篇
  1966年   2篇
  1965年   3篇
  1964年   2篇
  1963年   2篇
  1959年   3篇
  1957年   2篇
  1956年   1篇
  1951年   1篇
  1939年   1篇
排序方式: 共有6745条查询结果,搜索用时 156 毫秒
1.
Smoothing methods for convex inequalities and linear complementarity problems   总被引:22,自引:0,他引:22  
A smooth approximationp (x, ) to the plus function max{x, 0} is obtained by integrating the sigmoid function 1/(1 + ex ), commonly used in neural networks. By means of this approximation, linear and convex inequalities are converted into smooth, convex unconstrained minimization problems, the solution of which approximates the solution of the original problem to a high degree of accuracy for sufficiently large. In the special case when a Slater constraint qualification is satisfied, an exact solution can be obtained for finite. Speedup over MINOS 5.4 was as high as 1142 times for linear inequalities of size 2000 × 1000, and 580 times for convex inequalities with 400 variables. Linear complementarity problems are converted into a system of smooth nonlinear equations and are solved by a quadratically convergent Newton method. For monotone LCPs with as many as 10 000 variables, the proposed approach was as much as 63 times faster than Lemke's method.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grants CCR-9101801 and CCR-9322479.  相似文献
2.
The Mortar finite element method with Lagrange multipliers   总被引:19,自引:0,他引:19  
Summary. The present paper deals with a variant of a non conforming domain decomposition technique: the mortar finite element method. In the opposition to the original method this variant is never conforming because of the relaxation of the matching constraints at the vertices (and the edges in 3D) of subdomains. It is shown that, written under primal hybrid formulation, the approximation problem, issued from a discretization of a second order elliptic equation in 2D, is nonetheless well posed and provides a discrete solution that satisfies optimal error estimates with respect to natural norms. Finally the parallelization advantages consequence of this variant are also addressed. Received December 1, 1996 / Revised version received November 23, 1998 / Published online September 24, 1999  相似文献
3.
The aim of this paper is to investigate the properties of the maximum of partial sums for a class of weakly dependent random variables which includes the instantaneous filters of a Gaussian sequence having a positive continuous spectral density. The results are used to obtain an invariance principle for strongly mixing sequences of random variables in the absence of stationarity or strong mixing rates. An additional condition is imposed to the coefficients of interlaced mixing. The results are applied to linear processes of strongly mixing sequences.  相似文献
4.
Everywhere discontinuous harmonic maps into spheres   总被引:12,自引:0,他引:12  
5.
Financing newsvendor inventory   总被引:11,自引:0,他引:11  
If the cost of borrowing is not too high, the capital-constrained newsvendor borrows funds to procure an amount that is less than would be ideal. The lender charges an interest rate that decreases in the newsvendor’s equity. Furthermore, we derived a non-linear loan schedule that coordinates the channel.  相似文献
6.
Complex Wavelets for Shift Invariant Analysis and Filtering of Signals   总被引:9,自引:0,他引:9  
This paper describes a form of discrete wavelet transform, which generates complex coefficients by using a dual tree of wavelet filters to obtain their real and imaginary parts. This introduces limited redundancy (2m:1 for m-dimensional signals) and allows the transform to provide approximate shift invariance and directionally selective filters (properties lacking in the traditional wavelet transform) while preserving the usual properties of perfect reconstruction and computational efficiency with good well-balanced frequency responses. Here we analyze why the new transform can be designed to be shift invariant and describe how to estimate the accuracy of this approximation and design suitable filters to achieve this. We discuss two different variants of the new transform, based on odd/even and quarter-sample shift (Q-shift) filters, respectively. We then describe briefly how the dual tree may be extended for images and other multi-dimensional signals, and finally summarize a range of applications of the transform that take advantage of its unique properties.  相似文献
7.
Complex symplectic spaces, and their Lagrangian subspaces, are defined in accord with motivations from Lagrangian classical dynamics and from linear ordinary differential operators; and then their basic algebraic properties are established. After these purely algebraic developments, an Appendix presents a related new result on the theory of self-adjoint operators in Hilbert spaces, and this provides an important application of the principal theorems.

  相似文献

8.
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of annihilator immunity. This construction provides functions with the maximum possible annihilator immunity and the weight, nonlinearity and algebraic degree of the functions can be properly calculated under certain cases. The basic construction is that of symmetric Boolean functions and applying linear transformation on the input variables of these functions, one can get a large class of non-symmetric functions too. Moreover, we also study several other modifications on the basic symmetric functions to identify interesting non-symmetric functions with maximum annihilator immunity. In the process we also present an algorithm to compute the Walsh spectra of a symmetric Boolean function with O(n2) time and O(n) space complexity. We use the term “Annihilator Immunity” instead of “Algebraic Immunity” referred in the recent papers [3–5, 9, 18, 19]. Please see Remark 1 for the details of this notational change  相似文献
9.
An interval algorithm for constrained global optimization   总被引:7,自引:0,他引:7  
An interval algorithm for bounding the solutions of a constrained global optimization problem is described. The problem functions are assumed only to be continuous. It is shown how the computational cost of bounding a set which satisfies equality constraints can often be reduced if the equality constraint functions are assumed to be continuously differentiable. Numerical results are presented.  相似文献
10.
Proximal Methods for Mixed Quasivariational Inequalities   总被引:7,自引:0,他引:7  
A proximal method for solving mixed quasivariational inequalities is suggested and analyzed by using the auxiliary principle technique. We show that the convergence of the proposed method requires only the pseudomonotonicity, which is a weaker condition than monotonicity. Since mixed quasivariational inequalities include variational and complementarity problems as special cases, the result proved in this paper continues to hold for these problems.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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