首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1223篇
  免费   83篇
  国内免费   130篇
化学   146篇
晶体学   4篇
力学   74篇
综合类   26篇
数学   1017篇
物理学   169篇
  2024年   1篇
  2023年   13篇
  2022年   15篇
  2021年   20篇
  2020年   44篇
  2019年   42篇
  2018年   32篇
  2017年   32篇
  2016年   37篇
  2015年   35篇
  2014年   43篇
  2013年   134篇
  2012年   40篇
  2011年   57篇
  2010年   46篇
  2009年   80篇
  2008年   82篇
  2007年   74篇
  2006年   79篇
  2005年   68篇
  2004年   42篇
  2003年   57篇
  2002年   56篇
  2001年   39篇
  2000年   47篇
  1999年   42篇
  1998年   35篇
  1997年   36篇
  1996年   27篇
  1995年   19篇
  1994年   16篇
  1993年   8篇
  1992年   6篇
  1990年   4篇
  1989年   2篇
  1988年   3篇
  1987年   1篇
  1986年   4篇
  1985年   5篇
  1984年   3篇
  1983年   1篇
  1982年   1篇
  1980年   2篇
  1979年   1篇
  1978年   1篇
  1977年   1篇
  1974年   1篇
  1973年   1篇
  1959年   1篇
排序方式: 共有1436条查询结果,搜索用时 15 毫秒
1.
研究了带约束条件集值优化问题近似Henig有效解集的连通性.在实局部凸Hausdorff空间中,讨论了可行域为弧连通紧的,目标函数为C-弧连通的条件下,带约束条件集值优化问题近似Henig有效解集的存在性和连通性.并给出了带约束条件集值优化问题近似Henig有效解集的连通性定理.  相似文献   
2.
全连接网络作为深度学习中的一种典型结构,几乎在所有神经网络模型中均有出现。在近红外光谱定量分析中,光谱数据样本数量较少,但每个样本的维度高。导致了两个问题:将光谱直接输入网络,网络的参数量会十分庞大,训练模型需要更多的样本,否则模型容易进入过拟合状态;在输入网络前对光谱进行降维,虽解决了网络参数量过大的问题,但会丢失一部分信息,无法充分发挥网络的学习能力。针对近红外光谱的特性,提出了一种分组全连接的近红外光谱定量分析网络GFCN。该网络在传统的两层全连接网络的基础上,用若干个小的全连接层替代第一个全连接层,克服了直接输入光谱导致网络参数量过大的缺点。采用Tecator和IDRC2018数据集对该方法进行测试,同时与全连接网络FCN和偏最小二乘PLS两种方法进行对比。结果显示:在两个数据集上,GFCN预测效果均优于FCN和PLS。在只有少量样本参与建模的情况下,GFCN依然能够保持较高的预测效果。表明,GFCN可以用于近红外光谱的定量分析,并且适应样本较少的场景,具有重要的研究价值和广泛的应用场景。  相似文献   
3.
In the paper we prove that the Nevanlinna counting function and the Carleson function of analytic self‐maps of finitely connected domains with smooth boundary are equivalent. Using this result we obtain the characterization of compact composition operators on Hardy–Orlicz spaces.  相似文献   
4.
In this paper, the author studies the existence of the minimal nonnegative solutions of some elliptic variational inequalities in Orlicz-Sobolev spaces on bounded or unbounded domains. She gets some comparison results between different solutions as tools to pass to the limit in the problems and to show the existence of the minimal solutions of the variational inequalities on bounded domains or unbounded domains. In both cases,coercive and noncoercive operators are handled. The sufficient and necessary conditions for the existence of the minimal nonnegative solution of the noncoercive variational inequality on bounded domains are established.  相似文献   
5.
In bounded convex domains, the regularity of a vector field u with its divu, curlu in Lr space and the tangential component or the normal component of u over the boundary in Lr space, is established for 1<r<. As an application, we derive an Hr(curl,Ω) estimate for solutions to a Maxwell type system with an inhomogeneous boundary condition in convex domains. In contrast to the well-posed region of r in the space Hr(curl,Ω) for the Maxwell type system in Lipschitz domains given by Kar and Sini (2016) [16], we extend the well-posed region to be optimal.  相似文献   
6.
Both the hydrogen evolution reaction (HER) and the oxygen evolution reaction (OER) are crucial to water splitting, but require alternative active sites. Now, a general π‐electron‐assisted strategy to anchor single‐atom sites (M=Ir, Pt, Ru, Pd, Fe, Ni) on a heterogeneous support is reported. The M atoms can simultaneously anchor on two distinct domains of the hybrid support, four‐fold N/C atoms (M@NC), and centers of Co octahedra (M@Co), which are expected to serve as bifunctional electrocatalysts towards the HER and the OER. The Ir catalyst exhibits the best water‐splitting performance, showing a low applied potential of 1.603 V to achieve 10 mA cm?2 in 1.0 m KOH solution with cycling over 5 h. DFT calculations indicate that the Ir@Co (Ir) sites can accelerate the OER, while the Ir@NC3 sites are responsible for the enhanced HER, clarifying the unprecedented performance of this bifunctional catalyst towards full water splitting.  相似文献   
7.
8.
Considered as a geophysical fluid, the polluted atmosphere shares the shallow domain characteristics with other natural large-scale fluids such as seas and oceans. This means that its domain is excessively greater horizontally than in the vertical dimension, leading to the classic hydrostatic approximation of the Navier–Stokes equations. In the past there has been proved a convergence theorem for this model with respect to the ocean, without considering pollution effects. The novelty of this present work is to provide a generalization of their result translated to the atmosphere, extending the fluid velocity equations with an additional convection–diffusion equation representing pollutants in the atmosphere.  相似文献   
9.
Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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