全文获取类型
收费全文 | 4645篇 |
免费 | 734篇 |
国内免费 | 109篇 |
专业分类
化学 | 739篇 |
晶体学 | 1篇 |
力学 | 87篇 |
综合类 | 74篇 |
数学 | 795篇 |
物理学 | 913篇 |
无线电 | 2879篇 |
出版年
2024年 | 106篇 |
2023年 | 386篇 |
2022年 | 771篇 |
2021年 | 749篇 |
2020年 | 574篇 |
2019年 | 315篇 |
2018年 | 232篇 |
2017年 | 240篇 |
2016年 | 260篇 |
2015年 | 190篇 |
2014年 | 239篇 |
2013年 | 258篇 |
2012年 | 134篇 |
2011年 | 132篇 |
2010年 | 110篇 |
2009年 | 115篇 |
2008年 | 90篇 |
2007年 | 85篇 |
2006年 | 71篇 |
2005年 | 67篇 |
2004年 | 48篇 |
2003年 | 34篇 |
2002年 | 40篇 |
2001年 | 24篇 |
2000年 | 43篇 |
1999年 | 31篇 |
1998年 | 16篇 |
1997年 | 23篇 |
1996年 | 16篇 |
1995年 | 21篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 9篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 5篇 |
排序方式: 共有5488条查询结果,搜索用时 0 毫秒
151.
Boosting is one of the most important strategies in ensemble learning because of its ability to improve the stability and performance of weak learners. It is nonparametric, multivariate, fast and interpretable but is not robust against outliers. To enhance its prediction accuracy as well as immunize it against outliers, a modified version of a boosting algorithm (AdaBoost R2) was developed and called AdaBoost R3. In the sampling step, extremum samples were added to the boosting set. In the robustness step, a modified Huber loss function was applied to overcome the outlier problem. In the output step, a deterministic threshold was used to guarantee that bad predictions do not participate in the final output. The performance of the modified algorithm was investigated with two anticancer data sets of tyrosine kinase inhibitors, and the mechanism of inhibition was studied using the relative weighted variable importance procedure. Investigating the effect of base learner's strength reveals that boosting is only successful using the classification and regression tree method (a weak to moderate learner) and does not have a significant effect using the radial basis functions partial least square method (a strong base learners). Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
152.
针对微信使用群体的普及,本文提出在构建外语学习资源信息管理系统的基础上,搭建一个用于学生校园学习的微信服务账号,从而通过该微信服务账号实现学生对学习资源的利用,更好的促进语言能力的提升。本文借助Web服务器、Java技术、数据库、XML解析技术等系统进行开发,并对其实现进行详细的阐述,从而实现信息化技术与教学方式的创新,具有很大的推广和应用价值。 相似文献
153.
154.
155.
X. Z. Wang F. V. Buontempo A. Young D. Osborn 《SAR and QSAR in environmental research》2013,24(5):451-471
Recent literature has demonstrated the applicability of genetic programming to induction of decision trees for modelling toxicity endpoints. Compared with other decision tree induction techniques that are based upon recursive partitioning employing greedy searches to choose the best splitting attribute and value at each node that will necessarily miss regions of the search space, the genetic programming based approach can overcome the problem. However, the method still requires the discretization of the often continuous-valued toxicity endpoints prior to the tree induction. A novel extension of this method, YAdapt, is introduced in this work which models the original continuous endpoint by adaptively finding suitable ranges to describe the endpoints during the tree induction process, removing the need for discretization prior to tree induction and allowing the ordinal nature of the endpoint to be taken into account in the models built. 相似文献
156.
157.
针对现有的蜂窝网络的在线动态分配模型具有的信道需求量大、呼叫动态变化时阻塞率高和收敛速度慢的缺点,设计了一种基于MetropoisQ学习的蜂窝网络的在线信道分配方法。首先,在考虑同信道限制、邻居信道限制和同小区限制的基础上,设计了在线信道分配的数学模型,然后在Q-Learning算法基础上的设计了一种基于资格迹的Q(λ)算法实现信道的在线分配,为了进一步提高收敛速度,采用Metropois规则对算法中动作的选择方式进行改进,实现探索和利用的平衡。为了验证文中方法,采用Matlab工具上进行实验,仿真实验结果表明文中方法能实现蜂窝通信网络的在线信道分配,且与其它方法比较,具有较少的信道需求量、较低的阻塞率和收敛速度,较其它方法具有较大优越性。 相似文献
158.
Hussein Saad Amr Mohamed Tamer ElBatt 《Wireless Communications and Mobile Computing》2015,15(15):1929-1944
In this paper, we address the problem of distributed interference management of femtocells that share the same frequency band with macrocells using distributed multi‐agent Q‐learning. We formulate and solve two problems representing two different Q‐learning algorithms, namely, femto‐based distributed and sub‐carrier‐based distributed power controls using Q‐learning (FBDPC‐Q and SBDPC‐Q). FBDPC‐Q is a multi‐agent algorithm that works on a global basis, for example, deals with the aggregate macrocell and femtocell capacities. Its complexity increases exponentially with the number of sub‐carriers in the system. Also, it does not take into consideration the sub‐carrier macrocell capacity as a constraint. To overcome these problems, SBDPC‐Q is proposed, which is a multi‐agent algorithm that works on a sub‐carrier basis, for example, sub‐carrier macrocell and femtocell capacities. Each of FBDPC‐Q and SBDPC‐Q works in three different learning paradigms: independent (IL), cooperative (CL), and weighted cooperative (WCL). IL is considered the simplest form for applying Q‐learning in multi‐agent scenarios, where all the femtocells learn independently. CL and WCL are the proposed schemes in which femtocells share partial information during the learning process in order to strike a balance between practical relevance and performance. We prove the convergence of the CL paradigm when used in the FBDPC‐Q algorithm. We show via simulations that the CL paradigm outperforms the IL paradigm in terms of the aggregate femtocell capacity, especially in networks with large number of femtocells and large number of power levels. In addition, we propose WCL to address the CL limitations. Finally, we evaluate the robustness and scalability of both FBDPC‐Q and SBDPC‐Q, against several typical dynamics of plausible wireless scenarios (fading, path loss, random activity of femtocells, etc.). We show that the CL paradigm is the most scalable to large number of femtocells and robust to the network dynamics compared with the IL and WCL paradigms. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
159.
160.