首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13149篇
  免费   1398篇
  国内免费   707篇
化学   2283篇
晶体学   88篇
力学   1650篇
综合类   238篇
数学   7826篇
物理学   3169篇
  2024年   17篇
  2023年   128篇
  2022年   252篇
  2021年   356篇
  2020年   291篇
  2019年   288篇
  2018年   314篇
  2017年   458篇
  2016年   455篇
  2015年   336篇
  2014年   631篇
  2013年   894篇
  2012年   829篇
  2011年   750篇
  2010年   639篇
  2009年   813篇
  2008年   775篇
  2007年   856篇
  2006年   712篇
  2005年   597篇
  2004年   513篇
  2003年   499篇
  2002年   446篇
  2001年   389篇
  2000年   375篇
  1999年   300篇
  1998年   292篇
  1997年   235篇
  1996年   203篇
  1995年   225篇
  1994年   200篇
  1993年   167篇
  1992年   146篇
  1991年   124篇
  1990年   106篇
  1989年   86篇
  1988年   69篇
  1987年   62篇
  1986年   51篇
  1985年   66篇
  1984年   60篇
  1983年   17篇
  1982年   32篇
  1981年   26篇
  1980年   24篇
  1979年   40篇
  1978年   25篇
  1977年   33篇
  1976年   24篇
  1974年   7篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
One of the major capacity boosters for 5G networks is the deployment of ultra-dense heterogeneous networks (UDHNs). However, this deployment results in a tremendous increase in the energy consumption of the network due to the large number of base stations (BSs) involved. In addition to enhanced capacity, 5G networks must also be energy efficient for it to be economically viable and environmentally friendly. Dynamic cell switching is a very common way of reducing the total energy consumption of the network, but most of the proposed methods are computationally demanding, which makes them unsuitable for application in ultra-dense network deployment with massive number of BSs. To tackle this problem, we propose a lightweight cell switching scheme also known as Threshold-based Hybrid cEll swItching Scheme (THESIS) for energy optimization in UDHNs. The developed approach combines the benefits of clustering and exhaustive search (ES) algorithm to produce a solution whose optimality is close to that of the ES (which is guaranteed to be optimal), but is computationally more efficient than ES and as such can be applied for cell switching in real networks even when their dimension is large. The performance evaluation shows that THESIS significantly reduces the energy consumption of the UDHN and can reduce the complexity of finding a near-optimal solution from exponential to polynomial complexity.  相似文献   
2.
当前锂离子动力电池电化学模型存在模型复杂、建模难度大、计算效率低、老化评估效果差的问题,本文提出一种考虑电池衰退老化的机理模型(ADME).本文首先通过有限差分法对伪二维(P2D)电化学模型进行离散降阶处理,得到简化伪二维(SP2D)模型.在SP2D模型的基础上,基于阴阳两极发生的副反应导致的衰退老化现象,提出一种考虑电池衰退老化的机理模型.其次,使用多变量偏差补偿最小二乘法实现模型参数辨识.最后通过动力电池衰退老化性能循环实验,对比分析了恒流、脉冲工况下SP2D模型和ADME模型的终端电压输出.结果表明:ADME模型较为简单、计算效率和估算精度高,可以有效评估电池容量老化衰退,得到理想的锂离子动力电池外特性曲线.  相似文献   
3.
将TiNi基记忆合金薄膜与光纤相结合可制成智能化、集成化且成本经济的微机电系统和微传感器件.本文采用磁控溅射法在二氧化硅光纤基底上制备TiNi记忆合金薄膜,系统讨论了溅射工艺参数以及后续退火处理对薄膜质量的影响.采用自研制光纤镀膜掩膜装置在直径为125μm的光纤圆周表面上形成均匀薄膜.实验表明:在靶基距、背底真空度、Ar气流量和溅射时间一定的条件下,溅射功率存在最佳值;溅射压强较大时,薄膜沉积速率较低,但薄膜表面粗糙度较小.进行退火处理后,薄膜形成较良好的晶体结构,Ti49.09Ni50.91薄膜中马氏体B19′相和奥氏体B2相共存,但以B19′为主.根据本文研究结果,在玻璃光纤基底上制备高质量的TiNi基记忆合金薄膜是可实现的,本工作为下一步研制微机电系统和微型传感器做了基础准备.  相似文献   
4.
针对土壤定量分析受基体效应影响大,LIBS定量分析精度不佳等问题,采用粒子群算法对LSSVM进行优化,提高模型的精确度。选取Pb Ⅰ 405.78 nm和Cr Ⅰ 425.44 nm作为分析谱线进行分析。采集十二个不同浓度样品的特征光谱,每个浓度样品在不同点采集20组数据,将其中17组数据设为训练集,3组数据设为预测集,用LSSVM和PSO-LSSVM两种方法建立定标模型。对比两种模型的拟合相关系数(R2)、训练集均方根误差(RMSEC)和预测集均方根误差(RMSEP)。由于自吸收效应的影响,随着浓度的增加,预测值逐渐低于实际值,LSSVM定标模型的拟合程度较低,无法达到实验要求,模型性能有待提高。利用粒子群算法对LSSVM的模型参数惩罚系数和核函数参数进行优化,得到最佳的参数组合,Pb元素为(8 096.8, 138.865 7),Cr元素为(4 908.6, 393.563 5),用最佳的参数组合构建LSSVM的定标模型。相比于LSSVM,PSO-LSSVM定标模型的精确度更高,Pb和Cr元素的R2提高到了0.982 8和0.985 0,拟合效果明显提升。Pb和Cr元素的训练集均方根误差由0.026 0 Wt%和0.027 2 Wt%下降到0.022 4 Wt%和0.019 1 Wt%,预测集均方根误差由0.101 8 Wt%和0.078 8 Wt% 下降到0.045 8 Wt%和0.042 0 Wt%,模型的稳定性进一步提高。说明PSO-LSSVM算法能够更好地降低土壤基体效应和自吸收效应带来的影响,提高分析结果的精确度与稳定性。  相似文献   
5.
求全局最优化问题的填充函数算法被提出以来,参数的选取和调整一直是制约算法有效性的因素。如何在实际的计算过程中选取合适的参数,直接影响和决定了运算速度和效率。因此,构造不含参数的填充函数就显得极为重要。提出一个新的无参数的填充函数,对其理论性质进行了分析,并给出相应的填充函数算法,数值计算验证了算法的有效性。  相似文献   
6.
This letter studies the problem of minimizing increasing set functions, equivalently, maximizing decreasing set functions, over the base matroid. This setting has received great interest, since it generalizes several applied problems including actuator and sensor placement problems in control, task allocation problems, video summarization, and many others. We study two greedy heuristics, namely, the forward and reverse greedy. We provide two novel performance guarantees for the approximate solutions obtained by them depending on both submodularity ratio and curvature.  相似文献   
7.
Solution combustion synthesis (SCS) is a worldwide used methodology for the preparation of inorganic ceramic and composite materials with controlled properties for a wide number of applications, from catalysis to photocatalysis and electrocatalysis, from heavy metal removal to sensoristics and electronics. The high versatility and efficiency of this technique have led to the introduction of many variants, which allowed important optimization to the prepared materials. Moreover, its ecofriendly nature encouraged further studies about the use of sustainable precursors for the preparation of nanomaterials for energy and environment, according to the concept of circular economy. On the other hand, the large variety of expressions to define SCS and the often-contradictory definitions of the SCS parameters witnessed a scarce consciousness of the potentiality of this methodology. In this review article, the most important findings about SCS and the selection criteria for its main parameters are critically reviewed, in order to give useful guidelines to those scientists who want to use this methodology for preparing materials with improved or new functional properties. This review aims as well (i) to bring more clarity in the SCS terminology (ii) to increase the awareness of the SCS as a convenient tool for the synthesis of materials and (iii) to propose a new perspective in the SCS, with special attention to the use of ecofriendly procedures. Part of the review is also dedicated to precautions and limitations of this powerful methodology.  相似文献   
8.
The Traveling Salesman Problem with Pickup and Delivery seeks a minimum cost path with pickups preceding deliveries. It is important in on-demand last-mile logistics, such as ride sharing and meal delivery. We examine the use of low-width Decision Diagrams in a branch-and-bound with and without Assignment Problem inference duals as a primal heuristic for finding good solutions within strict time budgets. We show these diagrams can be more effective than similarly structured hybrid Constraint Programming techniques for real-time decision making.  相似文献   
9.
Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.  相似文献   
10.
E. Casas  M. Mateos 《Optimization》2019,68(1):255-278
ABSTRACT

A class of semilinear parabolic reaction diffusion equations with multiple time delays is considered. These time delays and corresponding weights are to be optimized such that the associated solution of the delay equation is the best approximation of a desired state function. The differentiability of the mapping is proved that associates the solution of the delay equation to the vector of weights and delays. Based on an adjoint calculus, first-order necessary optimality conditions are derived. Numerical test examples show the applicability of the concept of optimizing time delays.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号