全文获取类型
收费全文 | 31134篇 |
免费 | 3766篇 |
国内免费 | 991篇 |
专业分类
化学 | 2727篇 |
晶体学 | 40篇 |
力学 | 792篇 |
综合类 | 394篇 |
数学 | 4432篇 |
物理学 | 4763篇 |
无线电 | 22743篇 |
出版年
2024年 | 136篇 |
2023年 | 506篇 |
2022年 | 995篇 |
2021年 | 1216篇 |
2020年 | 1146篇 |
2019年 | 770篇 |
2018年 | 681篇 |
2017年 | 1063篇 |
2016年 | 1256篇 |
2015年 | 1257篇 |
2014年 | 2242篇 |
2013年 | 2011篇 |
2012年 | 2276篇 |
2011年 | 2146篇 |
2010年 | 1652篇 |
2009年 | 1630篇 |
2008年 | 1844篇 |
2007年 | 1849篇 |
2006年 | 1697篇 |
2005年 | 1387篇 |
2004年 | 1238篇 |
2003年 | 1234篇 |
2002年 | 970篇 |
2001年 | 863篇 |
2000年 | 798篇 |
1999年 | 561篇 |
1998年 | 472篇 |
1997年 | 401篇 |
1996年 | 378篇 |
1995年 | 265篇 |
1994年 | 238篇 |
1993年 | 167篇 |
1992年 | 118篇 |
1991年 | 77篇 |
1990年 | 61篇 |
1989年 | 57篇 |
1988年 | 42篇 |
1987年 | 18篇 |
1986年 | 32篇 |
1985年 | 35篇 |
1984年 | 22篇 |
1983年 | 5篇 |
1982年 | 15篇 |
1981年 | 15篇 |
1980年 | 9篇 |
1979年 | 6篇 |
1977年 | 10篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ?2+logGK) logGM log (G? ?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ?3) times faster than the algorithm developed in the latter paper. 相似文献
23.
Semi-interpenetrating polymer networks (IPNs) of poly(ethylene glycol), poly(vinyl alcohol) and polyacrylamide were prepared as a support for enzyme immobilization and kinetic studies were performed for the immobilization of -amylase. The effect of IPN composition on the extent of immobilization was investigated and the percentage of relative activity of the immobilized enzyme was evaluated as a function of the chemical architecture of the IPNs, pH and temperature, taking starch as a substrate. The kinetic constants and the maximum reaction velocity were also evaluated. The IPNs were characterized by IR spectral analysis. 相似文献
24.
采用25.344 Mbit/s光监控信息传送技术可以更好地满足当前密集波分复用(DWDM)系统中不断增加的网络监控信息和附加业务的需要.文章首先介绍了25.344 Mbit/s光监控信息传送系统的技术方案,然后详细描述了其帧结构、码型设计以及硬件实现的框图,最后介绍了该技术的优点. 相似文献
25.
针对特斯拉线圈复杂的电网络模型,提出了利用求解非线性方程和优化目标函数建立等值网络的方法。该等值网络在宽频范围内,在阻抗参数、有载增益、输入阻抗、传输功率与传输效率方面,均与原网络近似等值。该方法应用电压、电流之积计算灵敏度,方便地获得雅可比矩阵和目标函数梯度。本文方法对“网络分析与综合”课程或“电路理论”课程的师生,以及科研人员,具有切实的启发作用。 相似文献
26.
炉内结渣是影响火电机组和气化工艺可靠运行的关键因素之一,准确预测灰熔点可以提前调整炉膛出口温度以避免结渣。本论文采用激光诱导击穿光谱(LIBS)采集煤灰样中金属元素的光谱,分别建立煤灰中的金属元素的谱线强度与煤灰熔点的随机森林模型、支持向量机回归模型和线性回归模型,直接预测煤灰熔点温度。采用基于马氏距离(MD)的异常数据剔除算法和基于稀疏矩阵的基线估计与降噪算法(BEADS),对粉煤灰样的全光谱数据进行了预处理。随机森林模型对粉煤灰熔点的预测平均相对误差(MRE)为54.74%,支持向量机回归模型的预测平均相对误差为60.08%,而线性回归模型的预测平均相对误差达到了9.78%。研究结果表明,线性回归模型对煤灰熔点的预测结果更准确。 相似文献
27.
化学需氧量(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测量方法存在的问题提出了一种新的解决思路。 相似文献
28.
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. 相似文献
29.
Xuran Li Simiao Chen Jinghui Zhang Li Yu Weiyan Chen Yuyan Zhang 《Molecules (Basel, Switzerland)》2022,27(10)
Dried roots of Polygala tenuifolia (YuanZhi in Chinese) are widely used in Chinese herbal medicine. These components in YuanZhi have significant anti-oxidation properties owing to high levels of 3,6’-disinapoylsucrose (DISS) and Polygalaxanthone III (PolyIII). In order to efficiently extract natural medicines, response surface methodology (RSM) and least squares support vector machine (LSSVM) were used for the modeling and optimization of ultrasound-assisted extraction of DISS and PolyIII together to determine the antioxidant activity of the extracts obtained from YuanZhi. For the optimal combination of the comprehensive yield of DISS and PolyIII (Y), the Box-Behnken design (BBD) was used to improve extraction time (X1), extraction temperature (X2), liquid–solid ratio (X3), and ethanol concentration (X4). The optimal process parameters were determined to be as follows: extraction time, 93 min; liquid–solid ratio, 40 mL/g; extraction temperature, 48 °C; and ethanol concentration, 67%. With these conditions, the predictive optimal combination comprehensive evaluation value is 13.0217. It was clear that the LS-SVM model had higher accuracy in predictive and optimization capabilities, with higher antioxidant activity and lower relative deviations values, than did RSM. Hence, the LS-SVM model proved to be more effective for the analysis and improvement of the extraction process. 相似文献
30.
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. 相似文献