首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2145篇
  免费   129篇
  国内免费   201篇
化学   81篇
力学   115篇
综合类   41篇
数学   2064篇
物理学   174篇
  2023年   21篇
  2022年   18篇
  2021年   24篇
  2020年   51篇
  2019年   57篇
  2018年   44篇
  2017年   57篇
  2016年   73篇
  2015年   29篇
  2014年   89篇
  2013年   151篇
  2012年   93篇
  2011年   103篇
  2010年   97篇
  2009年   131篇
  2008年   147篇
  2007年   158篇
  2006年   145篇
  2005年   114篇
  2004年   83篇
  2003年   100篇
  2002年   88篇
  2001年   68篇
  2000年   80篇
  1999年   60篇
  1998年   51篇
  1997年   58篇
  1996年   47篇
  1995年   30篇
  1994年   31篇
  1993年   15篇
  1992年   12篇
  1991年   13篇
  1990年   12篇
  1989年   10篇
  1988年   7篇
  1987年   10篇
  1986年   5篇
  1985年   20篇
  1984年   10篇
  1983年   5篇
  1982年   9篇
  1981年   8篇
  1980年   9篇
  1979年   9篇
  1978年   4篇
  1977年   4篇
  1976年   6篇
  1975年   2篇
  1971年   2篇
排序方式: 共有2475条查询结果,搜索用时 15 毫秒
1.
We consider the problem faced by an online service platform that matches suppliers with consumers. Unlike traditional matching models, which treat them as passive participants, we allow both sides of the market to exercise their choices. To model this setting, we introduce a two-sided assortment optimization model wherein each participant's choice is modeled using a multinomial logit choice function, and the platform's objective is to maximize its expected revenue. We first show that the problem is NP-hard even when the number of suppliers is limited to two and provide a mixed-integer linear programming formulation. Next, we discuss two simple greedy heuristics and argue that these can lead to arbitrarily bad solutions. We then develop relaxations that provide upper and lower bounds and investigate the tightness of these relaxations by obtaining parametric approximation guarantees. Finally, we present numerical results on synthetic data demonstrating the practical utility of these relaxations.  相似文献   
2.
We consider two-stage recourse models with integer restrictions in the second stage. These models are typically non-convex and hence, hard to solve. There exist convex approximations of these models with accompanying error bounds. However, it is unclear how these error bounds depend on the distributions of the second-stage cost vector q. In this paper, we derive parametric error bounds whose dependence on the distribution of q is explicit: they scale linearly in the expected value of the ?1-norm of q.  相似文献   
3.
4.
Meta-learning, or “learning to learn”, refers to techniques that infer an inductive bias from data corresponding to multiple related tasks with the goal of improving the sample efficiency for new, previously unobserved, tasks. A key performance measure for meta-learning is the meta-generalization gap, that is, the difference between the average loss measured on the meta-training data and on a new, randomly selected task. This paper presents novel information-theoretic upper bounds on the meta-generalization gap. Two broad classes of meta-learning algorithms are considered that use either separate within-task training and test sets, like model agnostic meta-learning (MAML), or joint within-task training and test sets, like reptile. Extending the existing work for conventional learning, an upper bound on the meta-generalization gap is derived for the former class that depends on the mutual information (MI) between the output of the meta-learning algorithm and its input meta-training data. For the latter, the derived bound includes an additional MI between the output of the per-task learning procedure and corresponding data set to capture within-task uncertainty. Tighter bounds are then developed for the two classes via novel individual task MI (ITMI) bounds. Applications of the derived bounds are finally discussed, including a broad class of noisy iterative algorithms for meta-learning.  相似文献   
5.
For a general dyadic grid, we give a Calderón–Zygmund type decomposition, which is the principle fact about the multilinear maximal function on the upper half‐spaces. Using the decomposition, we study the boundedness of . We obtain a natural extension to the multilinear setting of Muckenhoupt's weak‐type characterization. We also partially obtain characterizations of Muckenhoupt's strong‐type inequalities with one weight. Assuming the reverse Hölder's condition, we get a multilinear analogue of Sawyer's two weight theorem. Moreover, we also get Hytönen–Pérez type weighted estimates.  相似文献   
6.
Linear and nonlinear elliptic complex partial differential equations of higher‐order are considered under Schwarz conditions in the upper‐half plane. Firstly, using the integral representations for the solutions of the inhomogeneous polyanalytic equation with Schwarz conditions, a class of integral operators is introduced together with some of their properties. Then, these operators are used to transform the problem for linear equations into singular integral equations. In the case of nonlinear equations such a transformation yields a system of integro‐differential equations. Existence of the solutions of the relevant boundary value problems for linear and nonlinear equations are discussed via Fredholm theory and fixed point theorems, respectively.  相似文献   
7.
In this paper, we consider the existence of traveling wave solutions in delayed higher dimensional lattice differential systems with partial monotonicity. By relaxing the monotonicity of the upper solutions and allowing it greater than positive equilibrium point, we establish the existence of traveling wave solutions by means of Schauder's fixed point theorem. And then, we apply our results to delayed competition‐cooperation systems on higher dimensional lattices.  相似文献   
8.
The objective of this paper is to construct and analyze a fitted operator finite difference method (FOFDM) for the family of time‐dependent singularly perturbed parabolic convection–diffusion problems. The solution to the problems we consider exhibits an interior layer due to the presence of a turning point. We first establish sharp bounds on the solution and its derivatives. Then, we discretize the time variable using the classical Euler method. This results in a system of singularly perturbed interior layer two‐point boundary value problems. We propose a FOFDM to solve the system above. Through a rigorous error analysis, we show that the scheme is uniformly convergent of order one with respect to both time and space variables. Moreover, we apply Richardson extrapolation to enhance the accuracy and the order of convergence of the proposed scheme. Numerical investigations are carried out to demonstrate the efficacy and robustness of the scheme.  相似文献   
9.
This work presents sufficient conditions for the existence of homoclinic solutions for second order coupled discontinuous systems of differential equations on the real line without the usual growth condition in the literature.The arguments apply the fixed point theory, Green's functions technique, L1-Carathéodory functions, lower and upper solutions and Schauder's fixed point theorem.  相似文献   
10.
We consider fully nonlinear uniformly elliptic equations with quadratic growth in the gradient, such as
?F(x,u,Du,D2u)=λc(x)u+M(x)Du,Du+h(x)
in a bounded domain with a Dirichlet boundary condition; here λR, c,hLp(Ω), p>n1, c?0 and the matrix M satisfies 0<μ1IMμ2I. Recently this problem was studied in the “coercive” case λc0, where uniqueness of solutions can be expected; and it was conjectured that the solution set is more complex for noncoercive equations. This conjecture was verified in 2015 by Arcoya, de Coster, Jeanjean and Tanaka for equations in divergence form, by exploiting the integral formulation of the problem. Here we show that similar phenomena occur for general, even fully nonlinear, equations in nondivergence form. We use different techniques based on the maximum principle.We develop a new method to obtain the crucial uniform a priori bounds, which permit to us to use degree theory. This method is based on basic regularity estimates such as half-Harnack inequalities, and on a Vázquez type strong maximum principle for our kind of equations.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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