全文获取类型
收费全文 | 10241篇 |
免费 | 644篇 |
国内免费 | 557篇 |
专业分类
化学 | 765篇 |
晶体学 | 24篇 |
力学 | 328篇 |
综合类 | 132篇 |
数学 | 1832篇 |
物理学 | 1403篇 |
综合类 | 6958篇 |
出版年
2024年 | 25篇 |
2023年 | 71篇 |
2022年 | 181篇 |
2021年 | 205篇 |
2020年 | 173篇 |
2019年 | 147篇 |
2018年 | 155篇 |
2017年 | 218篇 |
2016年 | 255篇 |
2015年 | 297篇 |
2014年 | 457篇 |
2013年 | 486篇 |
2012年 | 496篇 |
2011年 | 664篇 |
2010年 | 488篇 |
2009年 | 595篇 |
2008年 | 630篇 |
2007年 | 851篇 |
2006年 | 701篇 |
2005年 | 657篇 |
2004年 | 549篇 |
2003年 | 431篇 |
2002年 | 421篇 |
2001年 | 349篇 |
2000年 | 309篇 |
1999年 | 235篇 |
1998年 | 199篇 |
1997年 | 182篇 |
1996年 | 168篇 |
1995年 | 121篇 |
1994年 | 125篇 |
1993年 | 100篇 |
1992年 | 90篇 |
1991年 | 98篇 |
1990年 | 69篇 |
1989年 | 65篇 |
1988年 | 54篇 |
1987年 | 29篇 |
1986年 | 26篇 |
1985年 | 22篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1979年 | 4篇 |
1977年 | 9篇 |
1976年 | 3篇 |
1969年 | 1篇 |
1959年 | 3篇 |
1955年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Protein Conformation of a Lattice Model Using Tabu Search 总被引:1,自引:0,他引:1
We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model. 相似文献
52.
A new method of using time-averaged digital speckle pattern interferometry for the quantitative measurement of vibration amplitude was developed. Signal processing techniques especially the Hilbert transformation for quantitative evaluation of the Bessel fringes obtained in time-averaged digital speckle pattern interferometry were explored. The quadrature signal after Hilbert transformation is equivalent to a 90° phase-shifted interferogram for a monotonically increasing or decreasing phase function. An algorithm was developed for Bessel fringe contrast enhancement and phase extraction. The techniques were tested numerically and experimentally. Sub-fringe quantification of the time-averaged vibration fringes is realised with the proposed method. Compared with the commonly used phase shift method which requires a minimum of two images for image processing, this method requires only one fringe pattern for data extraction. 相似文献
53.
A new method for rotation and brightness invariant pattern recognition was proposed by applying multiple circular harmonic expansions to the joint transform correlator. The amplitudes of the multiple orders of circular harmonic expansions made from a detecting image were synthetically modified to respond to the same auto-correlation peaks. These modified circular harmonic expansions were arranged in the input plane as reference patterns together with an arbitrary target pattern, and the correlation signals between them were calculated in the subtracted joint transform correlator. The fraction of the correlation-peak intensities between the target and the references were extracted as a new discrimination parameter. This new parameter performs pattern recognition under rotation and brightness invariance with good discriminability. Its high discriminability has been proved in computer simulations using the face image patterns of many individuals. 相似文献
54.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce. 相似文献
55.
Huang Wen |qi Yin Ai |hua . School of Computer Science Technology Huazhong University of Science Technology Wuhan Hubei China . School of Mathematics Computer Science Hubei University Wuhan Hubei China 《武汉大学学报:自然科学英文版》2003,8(3):797-802
0 IntroductionThejobshopschedulingproblemwithwhichwearecon cernedconsistsinschedulingasetofjobsonasetofma chinesfortheobjectiveofminimizingthemake span ,i.e .themaximumoftimeneededforfinishingalljobs,whichissubjecttotheconstrainsthateachjobhasafixedprocessingorderthroughthemachinesandeachmachinecanprocessatmostonejobatatime .ThisproblemisNP hardandevenisoneofthehardestcom binationaloptimizationproblems.Itiswellknownthatonlysmallsizeprobleminstancescanbesolvedwithinareasonablecomputa tionalti… 相似文献
56.
小长径比垂直管气液两相流动特性分析 总被引:1,自引:0,他引:1
实验观察了小长径比垂直上流管内流型及特点,并对管入口处的压力波动特性和系统的压差波动特性进行了试验研究.结果表明:小长径比(L/D)垂直管内流型表现为泡状流、塞状流、乳沫状流、环状流和液束环状流;分别增加管线中的气量、液量,或者同时增加气液流量,均会造成垂直管入口处压力波动的均值和最大压力的增加;压力信号的概率密度(PDF)大部分呈双峰分布,也存在单峰和多峰分布;差压信号的概率密度符合正态分布,其功率谱密度同压力信号相比具有频率波动范围宽、幅值小的特点. 相似文献
57.
关于由衍射片的背面反射光形成的衍射图样的讨论 总被引:1,自引:0,他引:1
在光的衍射实验中,我们看到的一般是由通过衍射片的直射光形成的衍射图样,但在衍射片的另一面,同样存在着另一个衍射图样,它是由衍射片的背面反射光形成的,两个衍射图样关于衍射片对称.本文给出了这种实验现象,并用巴比涅原理解释了这种现象. 相似文献
58.
The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant
ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the
predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory
results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach
using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets
show that feature selection using fuzzy SVM obtains better results than using SVM. 相似文献
59.
简要讨论了基于Web的Internet上化学资源挖掘的两种主要手段,着重介绍了利用搜索引擎和化学主题资源检索化学资源的具体方法。 相似文献
60.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search. 相似文献