全文获取类型
收费全文 | 7584篇 |
免费 | 1240篇 |
国内免费 | 435篇 |
专业分类
化学 | 2096篇 |
晶体学 | 36篇 |
力学 | 544篇 |
综合类 | 244篇 |
数学 | 2885篇 |
物理学 | 3454篇 |
出版年
2024年 | 31篇 |
2023年 | 133篇 |
2022年 | 521篇 |
2021年 | 431篇 |
2020年 | 266篇 |
2019年 | 225篇 |
2018年 | 169篇 |
2017年 | 303篇 |
2016年 | 383篇 |
2015年 | 288篇 |
2014年 | 492篇 |
2013年 | 673篇 |
2012年 | 468篇 |
2011年 | 447篇 |
2010年 | 419篇 |
2009年 | 450篇 |
2008年 | 422篇 |
2007年 | 445篇 |
2006年 | 369篇 |
2005年 | 282篇 |
2004年 | 224篇 |
2003年 | 244篇 |
2002年 | 227篇 |
2001年 | 182篇 |
2000年 | 185篇 |
1999年 | 153篇 |
1998年 | 135篇 |
1997年 | 112篇 |
1996年 | 108篇 |
1995年 | 62篇 |
1994年 | 75篇 |
1993年 | 68篇 |
1992年 | 38篇 |
1991年 | 34篇 |
1990年 | 34篇 |
1989年 | 19篇 |
1988年 | 22篇 |
1987年 | 20篇 |
1986年 | 22篇 |
1985年 | 18篇 |
1984年 | 19篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 7篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1977年 | 6篇 |
1973年 | 2篇 |
1967年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有9259条查询结果,搜索用时 15 毫秒
101.
对一种新型结构微谐振环波长选择开关的特性进行了研究.分析了器件的工作状态和相应的开关操作,利用新型光强传递函数公式,对器件不同工作状态的光谱响应和不同开关操作的开关响应进行了数值模拟,讨论了耦合系数和损耗对光谱响应和开关响应的影响.结果表明,该器件可以实现三个信道同时接入、两个信道同时接入、单信道接入以及无信道接入等四种方式的信号波长选择性接入.多信道接入方式的开态串扰性能变差,关态的串扰性能不受影响.实现器件上述接入方式之间转换的开关操作可以分成三类,开关操作达到最佳关态串扰时的小微环折射率变化值都在6.0×10-3左右,而实现完全开关时的小微环折射率变化值小于8.0×10-4,表明易于通过热-光效应实现开关操作,并且温度调制的控制容差较大.损耗对器件开关特性的影响结果表明可根据损耗的实际数值,优化信道关闭时的微环折射率取值. 相似文献
102.
化学需氧量(Chemical Oxygen Demand,COD)是水体有机污染的一项重要指标,化学需氧量越高,表示水污染程度越严重。 为了解决传统的COD测量方法耗时较长,不利于快速、实时地获取水体中COD的信息等问题。本文提出了基于透射光谱测量结合主成分分析(Principal Component Analysis, PCA)改进水体COD含量估算模型。具体的,采集100组COD水体光谱信息,分别使用3种不同的高光谱数据预处理方法对光谱数据进行预处理,分析不同预处理方法对模型精度的影响,并基于不同的预处理方法分别建立高斯过程回归模型(Gaussian Process Regression, GPR)和BP神经网络模型,分析不同预处理方法对模型精度的影响;并对各模型结合PCA数据降维方法进行模型的改进,通过比较模型的精度选择最优模型进行水体COD含量的检测。结果显示,相比于原始光谱数据建立的GPR模型和BP神经网络模型,数据预处理后的模型精度明显提升;且结合PCA对预处理后的数据进一步降维处理后,模型精度得到了进一步的提升。其中,基于标准正态变量变换特征结合PCA改进BP神经网络模型基于PCA改进的BP神经网络模型R^2高达0.9940,均方根误差RMSE为0.022540。证明了基于PCA改进的BP神经网络数据降维方法对预处理后的光谱数据进行降维处理,有利于去除光谱中的冗余信息,提取特征信息,可以实现高光谱检测方法可以实现COD含量估算模型的优化,从而为传统COD测量方法存在的问题提出了一种新的解决思路。 相似文献
103.
104.
Marianna Milano Chiara Zucco Marzia Settino Mario Cannataro 《Entropy (Basel, Switzerland)》2022,24(5)
Network alignment is a fundamental task in network analysis. In the biological field, where the protein–protein interaction (PPI) is represented as a graph, network alignment allowed the discovery of underlying biological knowledge such as conserved evolutionary pathways and functionally conserved proteins throughout different species. A recent trend in network science concerns network embedding, i.e., the modelling of nodes in a network as a low-dimensional feature vector. In this survey, we present an overview of current PPI network embedding alignment methods, a comparison among them, and a comparison to classical PPI network alignment algorithms. The results of this comparison highlight that: (i) only five network embeddings for network alignment algorithms have been applied in the biological context, whereas the literature presents several classical network alignment algorithms; (ii) there is a need for developing an evaluation framework that may enable a unified comparison between different algorithms; (iii) the majority of the proposed algorithms perform network embedding through matrix factorization-based techniques; (iv) three out of five algorithms leverage external biological resources, while the remaining two are designed for domain agnostic network alignment and tested on PPI networks; (v) two algorithms out of three are stated to perform multi-network alignment, while the remaining perform pairwise network alignment. 相似文献
105.
Mobile crowdsensing (MCS) is attracting considerable attention in the past few years as a new paradigm for large-scale information sensing. Unmanned aerial vehicles (UAVs) have played a significant role in MCS tasks and served as crucial nodes in the newly-proposed space-air-ground integrated network (SAGIN). In this paper, we incorporate SAGIN into MCS task and present a Space-Air-Ground integrated Mobile CrowdSensing (SAG-MCS) problem. Based on multi-source observations from embedded sensors and satellites, an aerial UAV swarm is required to carry out energy-efficient data collection and recharging tasks. Up to date, few studies have explored such multi-task MCS problem with the cooperation of UAV swarm and satellites. To address this multi-agent problem, we propose a novel deep reinforcement learning (DRL) based method called Multi-Scale Soft Deep Recurrent Graph Network (ms-SDRGN). Our ms-SDRGN approach incorporates a multi-scale convolutional encoder to process multi-source raw observations for better feature exploitation. We also use a graph attention mechanism to model inter-UAV communications and aggregate extra neighboring information, and utilize a gated recurrent unit for long-term performance. In addition, a stochastic policy can be learned through a maximum-entropy method with an adjustable temperature parameter. Specifically, we design a heuristic reward function to encourage the agents to achieve global cooperation under partial observability. We train the model to convergence and conduct a series of case studies. Evaluation results show statistical significance and that ms-SDRGN outperforms three state-of-the-art DRL baselines in SAG-MCS. Compared with the best-performing baseline, ms-SDRGN improves 29.0% reward and 3.8% CFE score. We also investigate the scalability and robustness of ms-SDRGN towards DRL environments with diverse observation scales or demanding communication conditions. 相似文献
106.
Small world effects in the harmonious unifying hybrid preferential model (HUHPM) networks are studied both numerically and analytically. The idea and method of the HUHPM is applied to three typical examples of unweighted BA model, weighted BBV model, and the TDE model, so-called HUHPM-BA, HUHPM-BBV and HUHPM-TDE networks. Comparing the HUHPM with current typical models above, it is found that the HUHPM networks has the smallest average path length and the biggest average clustering coefficient. The results demonstrate that the HUHPM is more suitable not only for the un-weighted models but also for the weighted models. 相似文献
107.
Liuhai Wang Xin Du Bo Jiang Weifeng Pan Hua Ming Dongsheng Liu 《Entropy (Basel, Switzerland)》2022,24(5)
Software maintenance is indispensable in the software development process. Developers need to spend a lot of time and energy to understand the software when maintaining the software, which increases the difficulty of software maintenance. It is a feasible method to understand the software through the key classes of the software. Identifying the key classes of the software can help developers understand the software more quickly. Existing techniques on key class identification mainly use static analysis techniques to extract software structure information. Such structure information may contain redundant relationships that may not exist when the software runs and ignores the actual interaction times between classes. In this paper, we propose an approach based on dynamic analysis and entropy-based metrics to identify key classes in the Java GUI software system, called KEADA (identifying KEy clAsses based on Dynamic Analysis and entropy-based metrics). First, KEADA extracts software structure information by recording the calling relationship between classes during the software running process; such structure information takes into account the actual interaction of classes. Second, KEADA represents the structure information as a weighted directed network and further calculates the importance of each node using an entropy-based metric OSE (One-order Structural Entropy). Third, KEADA ranks classes in descending order according to their OSE values and selects a small number of classes as the key class candidates. In order to verify the effectiveness of our approach, we conducted experiments on three Java GUI software systems and compared them with seven state-of-the-art approaches. We used the Friedman test to evaluate all approaches, and the results demonstrate that our approach performs best in all software systems. 相似文献
108.
You-Gang Zhang Xia-Xia Liu Jian-Cheng Zong Yang-Teng-Jiao Zhang Rong Dong Na Wang Zhi-Hui Ma Li Li Shang-Long Wang Yan-Ling Mu Song-Song Wang Zi-Min Liu Li-Wen Han 《Molecules (Basel, Switzerland)》2022,27(13)
Phytotherapy offers obvious advantages in the intervention of Coronary Artery Disease (CAD), but it is difficult to clarify the working mechanisms of the medicinal materials it uses. DGS is a natural vasoprotective combination that was screened out in our previous research, yet its potential components and mechanisms are unknown. Therefore, in this study, HPLC-MS and network pharmacology were employed to identify the active components and key signaling pathways of DGS. Transgenic zebrafish and HUVECs cell assays were used to evaluate the effectiveness of DGS. A total of 37 potentially active compounds were identified that interacted with 112 potential targets of CAD. Furthermore, PI3K-Akt, MAPK, relaxin, VEGF, and other signal pathways were determined to be the most promising DGS-mediated pathways. NO kit, ELISA, and Western blot results showed that DGS significantly promoted NO and VEGFA secretion via the upregulation of VEGFR2 expression and the phosphorylation of Akt, Erk1/2, and eNOS to cause angiogenesis and vasodilation. The result of dynamics molecular docking indicated that Salvianolic acid C may be a key active component of DGS in the treatment of CAD. In conclusion, this study has shed light on the network molecular mechanism of DGS for the intervention of CAD using a network pharmacology-driven strategy for the first time to aid in the intervention of CAD. 相似文献
109.
介绍了《高等数学》课程网络化学习系统的设计思路与实现方法.系统利用网络多媒体的灵活表现形式,双向互动等功能,将传统的教学学习环节与现代多媒体网络技术进行有机的结合,使学生学习变得生动有趣且不受时间、空间的限制,为学生课后自主学习提供了良好的学习环境. 相似文献
110.