全文获取类型
收费全文 | 175789篇 |
免费 | 17882篇 |
国内免费 | 10351篇 |
专业分类
化学 | 91927篇 |
晶体学 | 1924篇 |
力学 | 12932篇 |
综合类 | 533篇 |
数学 | 42766篇 |
物理学 | 53940篇 |
出版年
2024年 | 237篇 |
2023年 | 2065篇 |
2022年 | 2856篇 |
2021年 | 3615篇 |
2020年 | 4190篇 |
2019年 | 4051篇 |
2018年 | 12919篇 |
2017年 | 12517篇 |
2016年 | 10575篇 |
2015年 | 5481篇 |
2014年 | 6052篇 |
2013年 | 7820篇 |
2012年 | 12749篇 |
2011年 | 19589篇 |
2010年 | 11676篇 |
2009年 | 11786篇 |
2008年 | 12760篇 |
2007年 | 14285篇 |
2006年 | 5667篇 |
2005年 | 5839篇 |
2004年 | 4841篇 |
2003年 | 4530篇 |
2002年 | 3372篇 |
2001年 | 2212篇 |
2000年 | 2045篇 |
1999年 | 2224篇 |
1998年 | 2034篇 |
1997年 | 1856篇 |
1996年 | 2080篇 |
1995年 | 1614篇 |
1994年 | 1531篇 |
1993年 | 1257篇 |
1992年 | 1121篇 |
1991年 | 1045篇 |
1990年 | 840篇 |
1989年 | 621篇 |
1988年 | 522篇 |
1987年 | 439篇 |
1986年 | 431篇 |
1985年 | 364篇 |
1984年 | 283篇 |
1983年 | 190篇 |
1982年 | 183篇 |
1981年 | 144篇 |
1980年 | 122篇 |
1979年 | 87篇 |
1978年 | 68篇 |
1976年 | 52篇 |
1974年 | 56篇 |
1973年 | 56篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
981.
The problem of scheduling on a multi-stage parallel-processor architecture in computer centres is addressed with the objective of minimizing average completion time of a set of requests. The problem is modelled as a flexible flowshop problem for which few heuristics exist in the flowshop scheduling literature. A new three-phase heuristic is proposed in this paper. An extensive computational experiment has been conducted to compare the performance of the existing heuristics and the proposed heuristic. The results indicate that the proposed heuristic significantly outperforms the existing ones. More specifically, the overall average error of the best existing heuristic is about five times that of the proposed heuristic while the overall average CPU time of the proposed heuristic is about half of the best existing one. More importantly, as the number of requests increases, the CPU time of the proposed heuristic decreases considerably (compared to the best existing heuristic) while the ratio of the error (of the best existing to the proposed heuristic) of about five times remains almost the same. 相似文献
982.
983.
H-J Kim D-H Lee P Xirouchakis 《The Journal of the Operational Research Society》2006,57(10):1231-1240
This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time. 相似文献
984.
The surface properties of nanofibres are of importance in various applications. In this work, electrospun polyamide nanofibres were used as substrates for creating functional nanostructures on the nanofibre surfaces. A RF magnetron sputter coating was used to deposit the functional layer of titanium dioxide (TiO2) onto the nanofibres. Atomic force microscopy (AFM), X-ray diffraction (XRD), X-ray photoelectron spectroscopy (XPS) and environmental scanning electron microscopy (ESEM) were employed to study the topography, grain structure and wetting of the nanofibre surfaces, respectively. The AFM results indicated a significant difference in the morphology of the nanofibres before and after the TiO2 sputter coating. The XRD analysis showed the amorphous structures of the TiO2 deposition layer. XPS spectra reflected the chemical features of the deposited nanostructures. The ESEM observation revealed that the surface wettability of TiO2 sputter coated nanofibres was significantly improved after UV irradiation. 相似文献
985.
986.
We prove that a for a mapping f of finite distortion , the -Hausdorff measure of any point preimage is zero provided is integrable, with , and the multiplicity function of f is essentially bounded. As a consequence for we obtain that the mapping is then open and discrete.
Received: 18 June 2001 / Revised version: 31 January 2002 / Published online: 27 June 2002 相似文献
987.
Nikolai Neumaier 《Communications in Mathematical Physics》2002,230(2):271-288
In this paper we explicitly construct local ν-Euler derivations , where the ξα are local, conformally symplectic vector fields and the are formal series of locally defined differential operators, for Fedosov star products on a symplectic manifold (M,ω) by means of which we are able to compute Deligne's characteristic class of these star products. We show that this class
is given by , where is a formal series of closed two-forms on M the cohomology class of which coincides with the one introduced by Fedosov to classify his star products. Moreover, we consider
star products that have additional algebraic structures and compute the effect of these structures on the corresponding characteristic
classes of these star products. Specifying the constituents of Fedosov's construction we obtain star products with these special
properties. Finally, we investigate equivalence transformations between such special star products and prove existence of
equivalence transformations being compatible with the considered algebraic structures.
Dedicated to the memory of Moshé Flato
Received: 28 June 1999 / Accepted: 11 April 2002?Published online: 11 September 2002 相似文献
988.
J A Bennell C N Potts J D Whitehead 《The Journal of the Operational Research Society》2002,53(10):1109-1117
In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines dictates the number of circuits of the conveyor belt required to manufacture each of several products. The goal is to find an ordering of the machines that minimises the maximum number of circuits required for the manufacture of any of the products. Since the problem is strongly NP-hard, the study of heuristic methods is of interest. This paper proposes iterated descent and tabu search algorithms, and a randomised insertion algorithm. Results of extensive computational tests show that all of our algorithms outperform a previously known algorithm that applies a greedy heuristic to the solution of a linear programming relaxation. The best quality solutions are obtained with iterated descent. This adds further evidence to the belief that iterated descent can produce high quality solutions to a variety of combinatorial optimisation problems. Moreover, unlike some other local search algorithms, iterated descent does not require much tuning in order to be competitive. 相似文献
989.
Combinations of problem structuring methods with hard OR methodologies are seldom described in the literature. This paper will reflect on the barriers to such combinations that can be seen at the philosophical level—paradigm incommensurability—and cognitive level—type of personality and difficulty of switching paradigm. This paper examines the combination of Soft Systems Methodology and Discrete Event Simulation within an Intermediate Care case study. The paper will argue, by way of the practical application, that these problems are not insurmountable and that the result can be seen as interplay of the soft and hard paradigms. The idea of yin and yang is proposed as a metaphor for this process. 相似文献
990.