全文获取类型
收费全文 | 4627篇 |
免费 | 593篇 |
国内免费 | 334篇 |
专业分类
化学 | 458篇 |
晶体学 | 7篇 |
力学 | 160篇 |
综合类 | 188篇 |
数学 | 2417篇 |
物理学 | 2324篇 |
出版年
2024年 | 12篇 |
2023年 | 38篇 |
2022年 | 286篇 |
2021年 | 266篇 |
2020年 | 147篇 |
2019年 | 125篇 |
2018年 | 104篇 |
2017年 | 162篇 |
2016年 | 194篇 |
2015年 | 143篇 |
2014年 | 261篇 |
2013年 | 305篇 |
2012年 | 207篇 |
2011年 | 252篇 |
2010年 | 245篇 |
2009年 | 274篇 |
2008年 | 268篇 |
2007年 | 316篇 |
2006年 | 249篇 |
2005年 | 242篇 |
2004年 | 210篇 |
2003年 | 175篇 |
2002年 | 155篇 |
2001年 | 115篇 |
2000年 | 91篇 |
1999年 | 87篇 |
1998年 | 85篇 |
1997年 | 73篇 |
1996年 | 57篇 |
1995年 | 67篇 |
1994年 | 44篇 |
1993年 | 25篇 |
1992年 | 22篇 |
1991年 | 26篇 |
1990年 | 21篇 |
1989年 | 30篇 |
1988年 | 20篇 |
1987年 | 16篇 |
1986年 | 12篇 |
1985年 | 25篇 |
1984年 | 16篇 |
1983年 | 11篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 10篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1974年 | 5篇 |
排序方式: 共有5554条查询结果,搜索用时 0 毫秒
51.
本文用拓扑方法探讨了脂肪胺的密度和折光指数与其分子结构之间的关系。提出一个既适用于密度又适用于折光指数的定量关系。应用这一定量关系, 不仅能够描述脂肪胺密度和折光指数的变化规律。预测脂肪胺的密度和折光指数,而且能够合理表征物质结构与性能之间的关系。 相似文献
52.
The dimensional analyses of the position and momentum variances‐based quantum mechanical Heisenberg uncertainty measure, as well as the entropic information measures given by the Shannon information entropy sum and the product of Fisher information measures are carried out for two widely used nonrelativistic isotropic exponential‐cosine screened Coulomb potentials generated by multiplying the superpositions of (i) Yukawa‐like, ?Z(e?μr/r), and (ii) Hulthén‐like, ?Zμ(1/(eμr ? 1)), potentials by cos(bμr) followed by addition of the term a/r2, where a and b ≥ 0, μ are the screening parameters and Z, in case of atoms, denotes the nuclear charge. Under the spherical symmetry, all the information measures considered are shown to be independent of the scaling of the set [μ, Z] at a fixed value of μ/Z, a, and b and the other parameters defining the superpositions of the potentials. Numerical results are presented, which support the validity of the scaling properties. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2007 相似文献
53.
W. Seidel 《Journal of Global Optimization》1991,1(3):295-303
We ask the experts in global optimization if there is an efficient solution to an optimization problem in acceptance sampling: Here, one often has incomplete prior information about the quality of incoming lots. Given a cost model, a decision rule for the inspection of a lot may then be designed that minimizes the maximum loss compatible with the available information. The resulting minimax problem is sometimes hard to solve, as the loss functions may have several local maxima which vary in an unpredictable way with the parameters of the decision rule. 相似文献
54.
Due to their wide application in many disciplines, how to make an efficient ranking for nodes, especially for nodes in graph data, has aroused lots of attention. To overcome the shortcoming that most traditional ranking methods only consider the mutual influence between nodes but ignore the influence of edges, this paper proposes a self-information weighting-based method to rank all nodes in graph data. In the first place, the graph data are weighted by regarding the self-information of edges in terms of node degree. On this base, the information entropy of nodes is constructed to measure the importance of each node and in which case all nodes can be ranked. To verify the effectiveness of this proposed ranking method, we compare it with six existing methods on nine real-world datasets. The experimental results show that our method performs well on all of these nine datasets, especially for datasets with more nodes. 相似文献
55.
56.
Sahar Erfanian Yewang Zhou Amar Razzaq Azhar Abbas Asif Ali Safeer Teng Li 《Entropy (Basel, Switzerland)》2022,24(10)
Bitcoin (BTC)—the first cryptocurrency—is a decentralized network used to make private, anonymous, peer-to-peer transactions worldwide, yet there are numerous issues in its pricing due to its arbitrary nature, thus limiting its use due to skepticism among businesses and households. However, there is a vast scope of machine learning approaches to predict future prices precisely. One of the major problems with previous research on BTC price predictions is that they are primarily empirical research lacking sufficient analytical support to back up the claims. Therefore, this study aims to solve the BTC price prediction problem in the context of both macroeconomic and microeconomic theories by applying new machine learning methods. Previous work, however, shows mixed evidence of the superiority of machine learning over statistical analysis and vice versa, so more research is needed. This paper applies comparative approaches, including ordinary least squares (OLS), Ensemble learning, support vector regression (SVR), and multilayer perceptron (MLP), to investigate whether the macroeconomic, microeconomic, technical, and blockchain indicators based on economic theories predict the BTC price or not. The findings point out that some technical indicators are significant short-run BTC price predictors, thus confirming the validity of technical analysis. Moreover, macroeconomic and blockchain indicators are found to be significant long-term predictors, implying that supply, demand, and cost-based pricing theories are the underlying theories of BTC price prediction. Likewise, SVR is found to be superior to other machine learning and traditional models. This research’s innovation is looking at BTC price prediction through theoretical aspects. The overall findings show that SVR is superior to other machine learning models and traditional models. This paper has several contributions. It can contribute to international finance to be used as a reference for setting asset pricing and improved investment decision-making. It also contributes to the economics of BTC price prediction by introducing its theoretical background. Moreover, as the authors still doubt whether machine learning can beat the traditional methods in BTC price prediction, this research contributes to machine learning configuration and helping developers use it as a benchmark. 相似文献
57.
Damian Radosaw Sowinski Jonathan Carroll-Nellenback Jeremy DeSilva Adam Frank Gourab Ghoshal Marcelo Gleiser 《Entropy (Basel, Switzerland)》2022,24(10)
Agents interacting with their environments, machine or otherwise, arrive at decisions based on their incomplete access to data and their particular cognitive architecture, including data sampling frequency and memory storage limitations. In particular, the same data streams, sampled and stored differently, may cause agents to arrive at different conclusions and to take different actions. This phenomenon has a drastic impact on polities—populations of agents predicated on the sharing of information. We show that, even under ideal conditions, polities consisting of epistemic agents with heterogeneous cognitive architectures might not achieve consensus concerning what conclusions to draw from datastreams. Transfer entropy applied to a toy model of a polity is analyzed to showcase this effect when the dynamics of the environment is known. As an illustration where the dynamics is not known, we examine empirical data streams relevant to climate and show the consensus problem manifest. 相似文献
58.
In this paper, we present the concept of the logical entropy of order m, logical mutual information, and the logical entropy for information sources. We found upper and lower bounds for the logical entropy of a random variable by using convex functions. We show that the logical entropy of the joint distributions and is always less than the sum of the logical entropy of the variables and . We define the logical Shannon entropy and logical metric permutation entropy to an information system and examine the properties of this kind of entropy. Finally, we examine the amount of the logical metric entropy and permutation logical entropy for maps. 相似文献
59.
Dempster–Shafer evidence theory is widely used in modeling and reasoning uncertain information in real applications. Recently, a new perspective of modeling uncertain information with the negation of evidence was proposed and has attracted a lot of attention. Both the basic probability assignment (BPA) and the negation of BPA in the evidence theory framework can model and reason uncertain information. However, how to address the uncertainty in the negation information modeled as the negation of BPA is still an open issue. Inspired by the uncertainty measures in Dempster–Shafer evidence theory, a method of measuring the uncertainty in the negation evidence is proposed. The belief entropy named Deng entropy, which has attracted a lot of attention among researchers, is adopted and improved for measuring the uncertainty of negation evidence. The proposed measure is defined based on the negation function of BPA and can quantify the uncertainty of the negation evidence. In addition, an improved method of multi-source information fusion considering uncertainty quantification in the negation evidence with the new measure is proposed. Experimental results on a numerical example and a fault diagnosis problem verify the rationality and effectiveness of the proposed method in measuring and fusing uncertain information. 相似文献
60.
Yuan Cao Wanyi Liu Lan Qin Bingqiang Liu Shuai Chen Jing Ye Xianzhao Xia Chao Wang 《Entropy (Basel, Switzerland)》2022,24(11)
Entropy is a measure of uncertainty or randomness. It is the foundation for almost all cryptographic systems. True random number generators (TRNGs) and physical unclonable functions (PUFs) are the silicon primitives to respectively harvest dynamic and static entropy to generate random bit streams. In this survey paper, we present a systematic and comprehensive review of different state-of-the-art methods to harvest entropy from silicon-based devices, including the implementations, applications, and the security of the designs. Furthermore, we conclude the trends of the entropy source design to point out the current spots of entropy harvesting. 相似文献