全文获取类型
收费全文 | 507篇 |
免费 | 26篇 |
国内免费 | 34篇 |
专业分类
化学 | 8篇 |
力学 | 5篇 |
数学 | 311篇 |
物理学 | 37篇 |
综合类 | 206篇 |
出版年
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 5篇 |
2020年 | 11篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 13篇 |
2016年 | 8篇 |
2015年 | 6篇 |
2014年 | 14篇 |
2013年 | 29篇 |
2012年 | 24篇 |
2011年 | 43篇 |
2010年 | 26篇 |
2009年 | 38篇 |
2008年 | 28篇 |
2007年 | 36篇 |
2006年 | 29篇 |
2005年 | 25篇 |
2004年 | 25篇 |
2003年 | 16篇 |
2002年 | 22篇 |
2001年 | 17篇 |
2000年 | 16篇 |
1999年 | 13篇 |
1998年 | 14篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 7篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有567条查询结果,搜索用时 15 毫秒
541.
一类具复杂偏差变元的Duffing型方程的周期解 总被引:10,自引:0,他引:10
利用拓扑度方法研究卫类具复杂偏差变元的Duffing型泛函微分方程x″(t) g(x(x(t)))=p(t)周期解的存在性,得到了方程具有周期解的充分条件。 相似文献
542.
543.
L. F. Pontin J. A. Baêta Segundo J. Fernando Perez 《Journal of statistical physics》1994,75(1-2):51-65
We discuss some aspects of the problem of the equivalence of dilute antiferromagnets and random field Ising models. We first investigate for dilute antiferromagnets the validity of the arguments of Imry and Ma. It turns out that they are applicable, but some care is required concerning the role played by the so-called internal Peierls contours. Next we consider a hierarchical version of a dilute antiferromagnetic Ising model in the presence of a uniform magnetic field and show that a renormalization group transformation maps it exactly into a hierarchical version of the random field Ising model, thus proving their equivalence as far as the critical behavior is concerned. In particular this implies that phase transition with spontaneous magnetization occurs only for dimensiond>2. Finally we show that in the absence of internal Peierls contours both models, in their hierarchical versions, exhibit phase transition already in dimensiond=2. 相似文献
544.
崔书英 《河北理工学院学报》2006,28(1):101-105
讨论了整函数的零点分布情况,给出并证明了整函数的零点全部分布在复平面上某个具体区域内的充分必要条件,得到了零点分布问题的一个判据。 相似文献
545.
一种改进的辩论协商模型及其算法 总被引:2,自引:0,他引:2
为了解决现有辩论协商模型过于抽象的问题,提出了一种改进的辩论协商架构.在构架中定义了辩论协商模型的对手、自身和环境等模型,其中对手模型是以协商伙伴为对手,自身模型的内容包括信念、愿望、意图、信任和偏爱,环境模型主要由Agent通讯语言和内容语言、协商协议和信息库组成.同时,提出了相应的算法,它通过合理地组合模型,调整论证评估器的位置,建立协议推理、论证评估、论证产生和论证选取等过程,使得协商信息充分交互,协商过程更为有效.实验结果表明,所提模型和算法是有效、可行的,算法的复杂度与协商对话的轮回有关,若轮回数为n,则复杂度为O(n). 相似文献
546.
Bing Liu 《Journal of Mathematical Analysis and Applications》2005,309(1):313-321
With the help of the coincidence degree continuation theorem, the existence of periodic solutions of a nonlinear second-order differential equation with deviating argument
x″(t)+f1(x(t))x′(t)+f2(x(t))(x′(t))2+g(x(t−τ(t)))=0, 相似文献
547.
《Physics letters. A》2014,378(30-31):2074-2078
In this paper, we propose a method to generate multipartite entangled coherent states (MECS) using a multi-mode superconducting cavity containing an SQUID-based charge qubit. After the projective measurement of simple charge states, MECS representing nonlocal electromagnetic fields of cavity modes have been generated. Furthermore, we investigate the nonlocal properties of the generated MECS by constructing the new concurrence-like entanglement based on the Bell–Klyshko argument. 相似文献
548.
《International Journal of Approximate Reasoning》2014,55(2):607-638
An argument graph is a graph where each node denotes an argument, and each arc denotes an attack by one argument on another. It offers a valuable starting point for theoretical analysis of argumentation following the proposals by Dung. However, the definition of an argument graph does not take into account the belief in the attacks. In particular, when constructing an argument graph from informal arguments, where each argument is described in free text, it is often evident that there is uncertainty about whether some of the attacks hold. This might be because there is some expressed doubt that an attack holds or because there is some imprecision in the language used in the arguments. In this paper, we use the set of spanning subgraphs of an argument graph as a sample space. A spanning subgraph contains all the arguments, and a subset of the attacks, of the argument graph. We assign a probability value to each spanning subgraph such that the sum of the assignments is 1. This means we can reflect the uncertainty over which is the actual subgraph using this probability distribution. Using the probability distribution over subgraphs, we can then determine the probability that a set of arguments is admissible or an extension. We can also obtain the probability of an attack relationship in the original argument graph as a marginal distribution (i.e. it is the sum of the probability assigned to each subgraph containing that attack relationship). We investigate some of the features of this proposal, and we consider the utility of our framework for capturing some practical argumentation scenarios. 相似文献
549.
利用一种新的方法讨论了具偏差变元的一阶中立型微分方程的振动性,得到了方程所有解振动的一些充分条件.并且改进了文献中的部分结果. 相似文献
550.