首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8791篇
  免费   1107篇
  国内免费   342篇
化学   753篇
晶体学   13篇
力学   1015篇
综合类   324篇
数学   5485篇
物理学   2650篇
  2024年   21篇
  2023年   86篇
  2022年   270篇
  2021年   263篇
  2020年   183篇
  2019年   197篇
  2018年   221篇
  2017年   332篇
  2016年   438篇
  2015年   282篇
  2014年   532篇
  2013年   585篇
  2012年   480篇
  2011年   535篇
  2010年   423篇
  2009年   562篇
  2008年   580篇
  2007年   594篇
  2006年   476篇
  2005年   428篇
  2004年   372篇
  2003年   312篇
  2002年   291篇
  2001年   248篇
  2000年   223篇
  1999年   194篇
  1998年   179篇
  1997年   158篇
  1996年   134篇
  1995年   104篇
  1994年   71篇
  1993年   82篇
  1992年   71篇
  1991年   38篇
  1990年   44篇
  1989年   28篇
  1988年   30篇
  1987年   23篇
  1986年   29篇
  1985年   29篇
  1984年   28篇
  1983年   9篇
  1982年   18篇
  1981年   5篇
  1980年   5篇
  1979年   5篇
  1978年   3篇
  1977年   5篇
  1959年   5篇
  1957年   2篇
排序方式: 共有10000条查询结果,搜索用时 93 毫秒
211.
We consider a coefficient identification problem for a mathematical model with free boundary related to ductal carcinoma in situ (DCIS). This inverse problem aims to determine the nutrient consumption rate from additional measurement data at a boundary point. We first obtain a global‐in‐time uniqueness of our inverse problem. Then based on the optimization method, we present a regularization algorithm to recover the nutrient consumption rate. Finally, our numerical experiment shows the effectiveness of the proposed numerical method.  相似文献   
212.
在实际路网情境下结合车道数、车道宽度、路口信号灯设置等路网物理特性,构建了考虑综合交通阻抗的多车型车辆调度模型,提出了两阶段求解策略:第1阶段设计了改进A-star精确解算法用于计算客户时间距离矩阵;第2阶段针对实际路网的特征设计了混合模拟退火算法求解调度方案。以大连市某配送中心运营实例进行路网情境仿真试验,结果表明:改进A-star算法较改进Dijkstra算法具有更短的路径搜索时间;混合模拟退火算法求解结果较实际调度方案优化了13.1% 的综合成本;路网增流、区域拥堵和路段禁行三类路网情境均能对配送方案的车辆配置、路径选择、客户服务次序、作业时间和违约费用等5方面内容产生干扰,调度计划的制定需要详细考虑这些因素的变化。  相似文献   
213.
214.
A new decoupled two-gird algorithm with the Newton iteration is proposed for solving the coupled Navier-Stokes/Darcy model which describes a fluid flow filtrating through porous media. Moreover the err...  相似文献   
215.
216.
We present a generalization of the transition state search using chemical dynamics simulations (TSSCDS) methodology (discussed in a previous study) which allows the topographical characterization of intermolecular potential energy surfaces (IPES) for non-covalently bound complexes (vdW-TSSCDS). Starting from a single random input geometry, we show that vdW-TSSCDS is able to globally and automatically locate stationary points of an IPES, even in limiting cases such as extremely flat regions or nontrivial topologies (eg, bifurcation points). The basic idea is the expression of the connectivity matrix in block structure, where diagonal blocks correspond to the isolated fragments and off-diagonal blocks provide the intermolecular connectivity. To this end, we introduce a new definition of bound or not, in a non-covalent sense, utilizing an extra set of van der Waals distances, which encompasses all kinds of non-covalent distances. To discuss the use of the vdW-TSSCDS method, we present a series of 2-body van der Waals systems, namely, Ar-Benzene (3D), N2-Benzene (6D) and H2O-Benzene (9D). Finally, we further illustrate its capabilities by presenting some applications for n-body problems (n > 2), (H2O)2-Benzene (12D) and (H2O)3-Benzene (21D), as well as to a reactive, fully-flexible, system (Benzene-NO2)+ (39D) in which the simultaneous breaking/formation of both covalent and non-covalent interactions takes place.  相似文献   
217.
Distance weighted discrimination (DWD) is an appealing classification method that is capable of overcoming data piling problems in high-dimensional settings. Especially when various sparsity structures are assumed in these settings, variable selection in multicategory classification poses great challenges. In this paper, we propose a multicategory generalized DWD (MgDWD) method that maintains intrinsic variable group structures during selection using a sparse group lasso penalty. Theoretically, we derive minimizer uniqueness for the penalized MgDWD loss function and consistency properties for the proposed classifier. We further develop an efficient algorithm based on the proximal operator to solve the optimization problem. The performance of MgDWD is evaluated using finite sample simulations and miRNA data from an HIV study.  相似文献   
218.
This work proposes an extended version of the well-known tree-augmented naive Bayes (TAN) classifier where the structure learning step is performed without requiring features to be connected to the class. Based on a modification of Edmonds' algorithm, our structure learning procedure explores a superset of the structures that are considered by TAN, yet achieves global optimality of the learning score function in a very efficient way (quadratic in the number of features, the same complexity as learning TANs). We enhance our procedure with a new score function that only takes into account arcs that are relevant to predict the class, as well as an optimization over the equivalent sample size during learning. These ideas may be useful for structure learning of Bayesian networks in general. A range of experiments shows that we obtain models with better prediction accuracy than naive Bayes and TAN, and comparable to the accuracy of the state-of-the-art classifier averaged one-dependence estimator (AODE). We release our implementation of ETAN so that it can be easily installed and run within Weka.  相似文献   
219.
To understand how proteins function on a cellular level, it is of paramount importance to understand their structures and dynamics, including the conformational changes they undergo to carry out their function. For the aforementioned reasons, the study of large conformational changes in proteins has been an interest to researchers for years. However, since some proteins experience rapid and transient conformational changes, it is hard to experimentally capture the intermediate structures. Additionally, computational brute force methods are computationally intractable, which makes it impossible to find these pathways which require a search in a high-dimensional, complex space. In our previous work, we implemented a hybrid algorithm that combines Monte-Carlo (MC) sampling and RRT*, a version of the Rapidly Exploring Random Trees (RRT) robotics-based method, to make the conformational exploration more accurate and efficient, and produce smooth conformational pathways. In this work, we integrated the rigidity analysis of proteins into our algorithm to guide the search to explore flexible regions. We demonstrate that rigidity analysis dramatically reduces the run time and accelerates convergence.  相似文献   
220.
在近红外光谱900-1700nm的波长范围内采集南疆羊肉的光谱数据,来研究水分含量的快速无损检测.为减弱非目标因素对光谱的影响,采用SNV和去趋势法对光谱数据进行预处理.为降低建模的复杂度,去除共线性的影响,采用连续投影算法和相关系数法相结合选取8个特征波长变量,最后使用PLS和ELM算法分别进行建模.实验表明,与采用全光谱波段建模相比,采用特征波长变量建模,PLS和ELM算法的运行时间都大大缩短,并且在运行时间和预测精度上,ELM算法均优于PLS算法.ELM算法采用8个特征波段变量建模,预测精度达到0.9768,均方误差为4.4291e-04,相关系数为0.7603,运行时间可控制在1e-04s之下,这可为研发羊肉水分含量的便携式检测装置提供理论参考.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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