全文获取类型
收费全文 | 6945篇 |
免费 | 513篇 |
国内免费 | 382篇 |
专业分类
化学 | 339篇 |
晶体学 | 8篇 |
力学 | 304篇 |
综合类 | 45篇 |
数学 | 2462篇 |
物理学 | 1579篇 |
综合类 | 3103篇 |
出版年
2024年 | 16篇 |
2023年 | 66篇 |
2022年 | 122篇 |
2021年 | 119篇 |
2020年 | 127篇 |
2019年 | 118篇 |
2018年 | 115篇 |
2017年 | 152篇 |
2016年 | 178篇 |
2015年 | 178篇 |
2014年 | 306篇 |
2013年 | 319篇 |
2012年 | 327篇 |
2011年 | 355篇 |
2010年 | 345篇 |
2009年 | 470篇 |
2008年 | 451篇 |
2007年 | 594篇 |
2006年 | 481篇 |
2005年 | 373篇 |
2004年 | 333篇 |
2003年 | 301篇 |
2002年 | 303篇 |
2001年 | 238篇 |
2000年 | 208篇 |
1999年 | 169篇 |
1998年 | 172篇 |
1997年 | 146篇 |
1996年 | 145篇 |
1995年 | 100篇 |
1994年 | 80篇 |
1993年 | 63篇 |
1992年 | 47篇 |
1991年 | 48篇 |
1990年 | 37篇 |
1989年 | 27篇 |
1988年 | 41篇 |
1987年 | 23篇 |
1986年 | 28篇 |
1985年 | 18篇 |
1984年 | 23篇 |
1983年 | 5篇 |
1982年 | 16篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1957年 | 2篇 |
排序方式: 共有7840条查询结果,搜索用时 544 毫秒
1.
随着城市化高速发展,老厂房再利用的问题日益急迫.上海是中国近代工业起源地,也是率先着手对彰显城市文脉的工业遗产进行调查和保护的历史文化名城.本文以上海典型案例入手,分析了具有代表性的老厂房改造的项目特点,并在此基础上,对常州大成三厂这一民国时期的纺织业遗留地块进行改造设计手法进行介绍,从设计理念、设计内容和节点设计3个方面,体现了文化传承和生态技术相融合理念. 相似文献
2.
算法的相关性变换与划分带个数的关系 总被引:1,自引:0,他引:1
王树义 《大连理工大学学报》1995,35(3):422-424
使用相关性变换法,划分并映射循环算法到具有固定尺寸的Systolic阵列。下标集合被划分成若干条带,划分带的条数与变换后的Systolic阵列算法的执行时间成正比。指出了Moldovan给出的计算划分带条数的公式有很大局限性,给出了由空间变换计算划分带条数的方法。 相似文献
3.
A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with zb‐ for the left and zb+ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
4.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献
5.
Susan Baker Lisa Kelchner Barbara Weinrich Linda Lee Paul Willging Robin Cotton Karen Zur 《Journal of voice》2006,20(4):631-641
Laryngotracheal stenosis is defined as a congenital or acquired narrowing of the airway. Congenital causes may include subglottic membranous or cartilaginous narrowing. Acquired causes may include trauma due to prolonged endotracheal or tracheal intubation or laryngotracheal injury. Although advances have been made over the past 30 years in reconstructive surgeries to improve airway patency in these patients, long-term laryngeal function for voice production is not well defined in this population. This review examines causes, symptoms and signs, and methods for diagnosing laryngotracheal stenosis. Surgical management procedures are briefly summarized. The current literature on voice outcomes is summarized. The predominant voice characteristics in the population are presented, although results are challenged by the heterogeneity of voice presentation and paucity of data from instrumental measures. Considerations for subjective and instrumental assessment, measures of quality of life, instrumental methods, and treatment options specific to the needs of this population are discussed. Research strategies to identify long-term outcomes of surgical and behavioral treatments in this population are posed. 相似文献
6.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
7.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
8.
9.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献
10.
通过分析多项工程的加固改造设计和施工要点,提出了多种扩建改造加固的方法和处理加固设计中常见疑难问题的措施. 相似文献