全文获取类型
收费全文 | 7113篇 |
免费 | 483篇 |
国内免费 | 638篇 |
专业分类
化学 | 175篇 |
力学 | 177篇 |
综合类 | 114篇 |
数学 | 4040篇 |
物理学 | 727篇 |
综合类 | 3001篇 |
出版年
2024年 | 10篇 |
2023年 | 84篇 |
2022年 | 152篇 |
2021年 | 167篇 |
2020年 | 170篇 |
2019年 | 150篇 |
2018年 | 163篇 |
2017年 | 164篇 |
2016年 | 180篇 |
2015年 | 162篇 |
2014年 | 290篇 |
2013年 | 463篇 |
2012年 | 293篇 |
2011年 | 397篇 |
2010年 | 336篇 |
2009年 | 445篇 |
2008年 | 437篇 |
2007年 | 514篇 |
2006年 | 482篇 |
2005年 | 386篇 |
2004年 | 321篇 |
2003年 | 313篇 |
2002年 | 287篇 |
2001年 | 256篇 |
2000年 | 261篇 |
1999年 | 205篇 |
1998年 | 176篇 |
1997年 | 162篇 |
1996年 | 134篇 |
1995年 | 97篇 |
1994年 | 115篇 |
1993年 | 74篇 |
1992年 | 68篇 |
1991年 | 61篇 |
1990年 | 45篇 |
1989年 | 34篇 |
1988年 | 36篇 |
1987年 | 24篇 |
1986年 | 38篇 |
1985年 | 31篇 |
1984年 | 13篇 |
1983年 | 11篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有8234条查询结果,搜索用时 46 毫秒
1.
Dynamical analysis,circuit realization,and application in pseudorandom number generators of a fractional-order laser chaotic system 下载免费PDF全文
Chenguang Ma 《中国物理 B》2021,30(12):120504-120504
A new five-dimensional fractional-order laser chaotic system (FOLCS) is constructed by incorporating complex variables and fractional calculus into a Lorentz-Haken-type laser system. Dynamical behavior of the system, circuit realization and application in pseudorandom number generators are studied. Many types of multi-stable states are discovered in the system. Interestingly, there are two types of state transition phenomena in the system, one is the chaotic state degenerates to a periodical state, and the other is the intermittent chaotic oscillation. In addition, the complexity of the system when two parameters change simultaneously is measured by the spectral entropy algorithm. Moreover, a digital circuit is design and the chaotic oscillation behaviors of the system are verified on this circuit. Finally, a pseudo-random sequence generator is designed using the FOLCS, and the statistical characteristics of the generated pseudo-random sequence are tested with the NIST-800-22. This study enriches the research on the dynamics and applications of FOLCS. 相似文献
3.
4.
为了构建共享自动驾驶汽车(shared autonomous vehicles,SAV) 的使用意愿模型并分析其影响因素,通过使用时机和使用频率来体现公众对SAV的使用意愿;采用验证性因子分析将态度潜变量转化为潜变量得分,以此将态度潜变量引入传统的有序Logit模型;提出SAV使用意愿的有序Logit模型构建方法,并建立基于个人属性、通勤特征、态度潜变量的SAV使用意愿模型.研究发现:是否使用过滴滴拼车、工作单位停车费、自动驾驶态度对使用时机和3种价格(1,2,3元/km) 下的使用频率有显著影响;使用过滴滴拼车、工作单位收取停车费、支持自动驾驶的群体倾向于频繁地、更早地使用SAV出行;公众期望以1元/km或 2元/km即不超过目前滴滴拼车的价格使用SAV. 相似文献
5.
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a -approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers. 相似文献
6.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
7.
本文通过组合数学和矩阵论的方法获得了完全图的特征多项式和谱,指出完全图的特征多项式的系数与图的结构之间的关系,并证明了邻接谱、拉谱拉斯谱和无符号拉谱拉斯谱三者之间的关系. 相似文献
8.
We generalize Nagel’s formula for the Szegö kernel and use it to compute the Szegö kernel on a class of non-compact CR manifolds whose tangent space decomposes into one complex direction and several totally real directions. We also discuss the control metric on these manifolds and relate it to the size of the Szegö kernel. 相似文献
9.
10.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming. 相似文献