首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2252篇
  免费   86篇
  国内免费   205篇
化学   185篇
力学   35篇
综合类   29篇
数学   2173篇
物理学   121篇
  2024年   2篇
  2023年   19篇
  2022年   28篇
  2021年   20篇
  2020年   36篇
  2019年   48篇
  2018年   50篇
  2017年   41篇
  2016年   56篇
  2015年   36篇
  2014年   97篇
  2013年   148篇
  2012年   82篇
  2011年   98篇
  2010年   87篇
  2009年   146篇
  2008年   188篇
  2007年   138篇
  2006年   131篇
  2005年   126篇
  2004年   85篇
  2003年   96篇
  2002年   80篇
  2001年   78篇
  2000年   68篇
  1999年   76篇
  1998年   72篇
  1997年   57篇
  1996年   53篇
  1995年   32篇
  1994年   25篇
  1993年   25篇
  1992年   22篇
  1991年   15篇
  1990年   13篇
  1989年   15篇
  1988年   15篇
  1987年   5篇
  1986年   4篇
  1985年   25篇
  1984年   17篇
  1983年   4篇
  1982年   13篇
  1981年   15篇
  1980年   19篇
  1979年   15篇
  1978年   8篇
  1977年   5篇
  1976年   4篇
  1936年   1篇
排序方式: 共有2543条查询结果,搜索用时 31 毫秒
1.
2.
3.
针对在线评价的发布时间、获得的“有用”的投票数以及是否被贴上“砖家”点评标签对在线评价信息可信度和消费者购买决策具有重要影响,提出一种基于在线评价信息且考虑评价信息可信度及消费者类型的酒店排序方法。首先,将不同类型消费者群体给出的在线评价信息转换成考虑在线评价信息可信度的区间中智数;其次,依据区间中智数距离测度公式确定针对目标群体的各消费者群体权重,进而依据INLNPA集成算子集结各消费者群体评价信息确定针对目标群体的酒店-属性决策矩阵;再次,依据区间中智集熵测度方法确定各属性权重,在此基础上,基于VIKOR方法得到针对目标群体的酒店排序结果;最后,通过一个实例分析说明该方法的有效性和可行性。  相似文献   
4.
在处理多属性决策问题中,QUALIFLEX是一种非常有用的排序算法。针对属性取值为简化中性犹豫模糊集的多属性决策问题,提出了SNHFS-QUALIFLEX算法。另外考虑到属性权重不确定的情况,将LINMAP扩展到简化中性犹豫模糊集中,定义了符号距离,建立了最优数学规划模型来确定属性权重。最后将SNHFS-QUALIFLEX方法应用到多属性决策实例中,并验证了其可行性和有效性。  相似文献   
5.
《Discrete Mathematics》2022,345(6):112832
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.  相似文献   
6.
《Discrete Mathematics》2022,345(1):112659
In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular F-saturated graphs. One of the essential questions is given F, for which n does a regular n-vertex F-saturated graph exist. They proved that for all sufficiently large n, there is a regular K3-saturated graph with n vertices. We extend this result to both K4 and K5 and prove some partial results for larger complete graphs. Using a variation of sum-free sets from additive combinatorics, we prove that for all k2, there is a regular C2k+1-saturated with n vertices for infinitely many n. Studying the sum-free sets that give rise to C2k+1-saturated graphs is an interesting problem on its own and we state an open problem in this direction.  相似文献   
7.
We give different conditions for the invariance of closed sets with respect to differential inclusions governed by a maximal monotone operator defined on Hilbert spaces, which is subject to a Lipschitz continuous perturbation depending on the state. These sets are not necessarily weakly closed as in [3], [4], while the invariance criteria are still written by using only the data of the system. So, no need to the explicit knowledge of neither the solution of this differential inclusion, nor the semi-group generated by the maximal monotone operator. These invariant/viability results are next applied to derive explicit criteria for a-Lyapunov pairs of lower semi-continuous (not necessarily weakly-lsc) functions associated to these differential inclusions. The lack of differentiability of the candidate Lyapunov functions and the consideration of general invariant sets (possibly not convex or smooth) are carried out by using techniques from nonsmooth analysis.  相似文献   
8.
We are concerned with a family of dissipative active scalar equation on . By using similar methods from the previous paper of Y. Giga et al. (see Introduction below), we construct a unique real, spatially almost periodic mild solution θ of 1.1 satisfying 1.11 . In this paper, we consider some countable sum‐closed frequency sets (see Remark 1.1 ). We show that the property of the solution is rather different from Chae et al 1 and obtain that with some initial data θ0 for all t≥0, and 0≤αω, where ω is a fixed constant. Furthermore, arranging the elements of a countable sum‐closed frequency set Fδ as in Remark 1.3 , we have for any 0≤αω that belongs to , where Fδ is defined in 1.4 or 1.5 .  相似文献   
9.
In this study, several simple aspects associated with the periodic table (PT) of the elements are commented. First, the connection of the PT with the structure of a seven-dimensional Boolean hypercube leads afterward to discuss the nature of those PT elements bearing prime atomic numbers. Second, the use of quantum similarity (QS) to obtain an alternative insight on the PT element relations will be also developed. The foundation of the second part starts admitting that any element of the PT can be attached to a schematic electronic density function, constructed with a single Gaussian function: a Gaussian atomic density function, allowing to consider the PT elements as a set of quantum objects, and permits a straightforward construction of a QS matrix. Such QS scheme can be applied to the whole PT or to any subset of it. Manipulation of the QS matrices attached to any quantum object set allows the evaluation of statistical-like values, acting as coordinates to numerically or graphically represent the chosen PT atomic element sets. © 2019 Wiley Periodicals, Inc.  相似文献   
10.
Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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