首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   672篇
  免费   29篇
  国内免费   82篇
化学   265篇
力学   20篇
综合类   1篇
数学   218篇
物理学   279篇
  2024年   2篇
  2023年   9篇
  2022年   26篇
  2021年   40篇
  2020年   13篇
  2019年   30篇
  2018年   20篇
  2017年   28篇
  2016年   48篇
  2015年   28篇
  2014年   53篇
  2013年   71篇
  2012年   43篇
  2011年   53篇
  2010年   32篇
  2009年   53篇
  2008年   45篇
  2007年   43篇
  2006年   30篇
  2005年   17篇
  2004年   20篇
  2003年   10篇
  2002年   6篇
  2001年   14篇
  2000年   8篇
  1999年   5篇
  1998年   8篇
  1997年   3篇
  1996年   4篇
  1995年   2篇
  1994年   6篇
  1992年   1篇
  1990年   1篇
  1989年   2篇
  1988年   3篇
  1985年   1篇
  1984年   1篇
  1981年   2篇
  1979年   1篇
  1974年   1篇
排序方式: 共有783条查询结果,搜索用时 375 毫秒
101.
We investigate the behaviour of Poisson point processes in the neighbourhood of the boundary ∂K of a convex body K in ,d ≥ 2. Making use of the geometry of K, we show various limit results as the intensity of the Poisson process increases and the neighbourhood shrinks to ∂K. As we shall see, the limit processes live on a cylinder generated by the normal bundle of K and have intensity measures expressed in terms of the support measures of K. We apply our limit results to a spatial version of the classical change-point problem, in which random point patterns are considered which have different distributions inside and outside a fixed, but unknown convex body K.  相似文献   
102.
In this paper a new class of higher order (F,ρ,σ)-type I functions for a multiobjective programming problem is introduced, which subsumes several known studied classes. Higher order Mond-Weir and Schaible type dual programs are formulated for a nondifferentiable multiobjective fractional programming problem where the objective functions and the constraints contain support functions of compact convex sets in Rn. Weak and strong duality results are studied in both the cases assuming the involved functions to be higher order (F,ρ,σ)-type I. A number of previously studied problems appear as special cases.  相似文献   
103.
采用非晶态络合物法制备了La0.9Cu0.1MnO3和LaCoO3钙钛矿催化剂, 并利用固定化溶胶工艺合成了Pt纳米粒子负载的Pt/La0.9Cu0.1MnO3和Pt/LaCoO3复合催化剂. 通过透射电镜(TEM)、X射线衍射(XRD)和X射线光电子能谱(XPS)等手段对催化剂的微观结构、形貌及Pt的价态进行了研究; 考察了催化剂的CO催化氧化发光性能. 结果表明, 若La0.9Cu0.1MnO3催化剂表面上负载的Pt纳米颗粒形成团聚, 则在其CO催化氧化发光谱中出现发光峰分裂的现象, 而在Pt纳米颗粒分散较好的Pt/LaCoO3体系中却没有出现这一情况. 因此可以利用CO催化发光谱来初步判断贵金属纳米颗粒在载体表面的分散状态.  相似文献   
104.
At present, there are a number of methods for the prediction of T-cell epitopes and major histocompatibility complex (MHC)-binding peptides. Despite numerous methods for predicting T-cell epitopes, there still exist limitations that affect the reliability of prevailing methods. For this reason, the development of models with high accuracy are crucial. An accurate prediction of the peptides that bind to specific major histocompatibility complex class I and II (MHC-I and MHC-II) molecules is important for an understanding of the functioning of the immune system and the development of peptide-based vaccines. Peptide binding is the most selective step in identifying T-cell epitopes. In this paper, we present a new approach to predicting MHC-binding ligands that takes into account new weighting schemes for position-based amino acid frequencies, BLOSUM and VOGG substitution of amino acids, and the physicochemical and molecular properties of amino acids. We have made models for quantitatively and qualitatively predicting MHC-binding ligands. Our models are based on two machine learning methods support vector machine (SVM) and support vector regression (SVR), where our models have used for feature selection, several different encoding and weighting schemes for peptides. The resulting models showed comparable, and in some cases better, performance than the best existing predictors. The obtained results indicate that the physicochemical and molecular properties of amino acids (AA) contribute significantly to the peptide-binding affinity.  相似文献   
105.
Predicting the location where a protein resides within a cell is important in cell biology. Computational approaches to this issue have attracted more and more attentions from the community of biomedicine. Among the protein features used to predict the subcellular localization of proteins, the feature derived from Gene Ontology (GO) has been shown to be superior to others. However, most of the sights in this field are set on the presence or absence of some predefined GO terms. We proposed a method to derive information from the intrinsic structure of the GO graph. The feature vector was constructed with each element in it representing the information content of the GO term annotating to a protein investigated, and the support vector machines was used as classifier to test our extracted features. Evaluation experiments were conducted on three protein datasets and the results show that our method can enhance eukaryotic and human subcellular location prediction accuracy by up to 1.1% better than previous studies that also used GO-based features. Especially in the scenario where the cellular component annotation is absent, our method can achieved satisfied results with an overall accuracy of more than 87%.  相似文献   
106.
In many sequence data mining applications, the goal is to find frequent substrings. Some of these applications like extracting motifs in protein and DNA sequences are looking for frequently occurring approximate contiguous substrings called simple motifs. By approximate we mean that some mismatches are allowed during similarity test between substrings, and it helps to discover unknown patterns. Structured motifs in DNA sequences are frequent structured contiguous substrings which contains two or more simple motifs. There are some works that have been done to find simple motifs but these works have problems such as low scalability, high execution time, no guarantee to find all patterns, and low flexibility in adaptation to other application. The Flame is the only algorithm that can find all unknown structured patterns in a dataset and has solved most of these problems but its scalability for very large sequences is still weak. In this research a new approach named Next-Symbol-Array based Motif Discovery (NSAMD) is represented to improve scalability in extracting all unknown simple and structured patterns. To reach this goal a new data structure has been presented called Next-Symbol-Array. This data structure makes change in how to find patterns by NSAMD in comparison with Flame and helps to find structured motif faster. Proposed algorithm is as accurate as Flame and extracts all existing patterns in dataset. Performance comparisons show that NSAMD outperforms Flame in extracting structured motifs in both execution time (51% faster) and memory usage (more than 99%). Proposed algorithm is slower in extracting simple motifs but considerable improvement in memory usage (more than 99%) makes NSAMD more scalable than Flame. This advantage of NSAMD is very important in biological applications in which very large sequences are applied.  相似文献   
107.
支持向量机,支持向量回归和分子对接的计算方法已广泛应用于化合物的药理活性计算。为了提高计算的准确性和可靠性,拟以细胞色素P450酶1A2为研究载体,运用建立的联合SVM-SVR-Docking计算模型预测潜在的CYP1A2抑制剂。其中,建立的最优SVM定性模型训练集,内部测试集和外部测试集的准确率分别为99.432%,97.727%和91.667%。最优SVR定量模型训练集和测试集的R和MSE分别为0.763,0.013和0.753,0.056。实验表明两个模型具有较高的准确性和可靠性。通过对SVM和SVR模型结果的比较分析,发现连接性指数、分子构成描述符和官能团数目等分子描述符可能与CYP1A2抑制剂的辨识和活性预测密切相关。随后利用分子对接技术分析化合物与CYP1A2的结合构象及相互作用的稳定性。形成氢键相互作用的关键氨基酸包括THR124,ASP320;形成疏水相互作用的关键氨基酸包括ALA317和GLY316。所获得模型可用于天然产物化学成分中CYP1A2潜在抑制剂的活性计算及其介导的药物-药物相互作用预测提供理论指导,也为合理联合用药提供一定参考。共获得20个对CYP1A2具有潜在抑制活性的化合物。部分结果与文献结果相互印证,进一步说明了模型的准确性和联合计算策略的可靠性.  相似文献   
108.
刘建峰  淦燕 《应用声学》2016,24(3):231-233
针对传统SVM对噪声点和孤立点敏感的问题,以及不能解决样本特征规模大、含有异构信息、在特征空间中分布不平坦的问题,将模糊隶属度融入多核学习中,提出了一种模糊多核学习的方法。通过实验验证了模糊多核学习比传统SVM、模糊支持向量机以及多核学习具有更好的分类效果,从而验证了所提方法能够有效的克服传统SVM对噪声点敏感以及数据分布不平坦的问题。  相似文献   
109.
针对室内复杂环境下火灾识别准确率会降低的问题,提出了一种改进的粒子群算法优化支持向量机参数进行火灾火焰识别的方法。首先在 颜色空间进行火焰图像分割,对获得的火焰图像进行预处理并提取相关特征量;其次采用PSO算法搜索SVM的最优核参数和惩罚因子,并在PSO算法中加入变异操作和非线性动态调整惯性权值的方法,加快了搜索SVM最优参数的精度和速度;然后将提取的火焰各个特征量作为训练样本输入SVM模型进行训练,并建立参数优化后的SVM分类器模型;最后将待测试样本输入SVM模型进行分类识别。算法的火灾识别准确率达到94.09%,分类效果明显优于其他分类算法。仿真结果表明,改进的PSO优化SVM算法提高了火焰识别的准确率和实时性,算法的自适应性更强,误判率更低。  相似文献   
110.
Support vector machines (SVMs) were used as a novel learning machine in the authentication of the origin of salmon. SVMs have the advantage of relying on a well-developed theory and have already proved to be successful in a number of practical applications. This paper provides a new and effective method for the discrimination between wild and farm salmon and eliminates the possibility of fraud through misrepresentation of the country of origin of salmon. The method requires a very simple sample preparation of the fish oils extracted from the white muscle of salmon samples. (1)H NMR spectroscopic analysis provides data that is very informative for analysing the fatty acid constituents of the fish oils. The SVM has been able to distinguish correctly between the wild and farmed salmon; however ca. 5% of the country of origins were misclassified.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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