全文获取类型
收费全文 | 2033篇 |
免费 | 54篇 |
国内免费 | 190篇 |
专业分类
化学 | 1086篇 |
晶体学 | 5篇 |
力学 | 186篇 |
综合类 | 1篇 |
数学 | 539篇 |
物理学 | 460篇 |
出版年
2024年 | 3篇 |
2023年 | 27篇 |
2022年 | 27篇 |
2021年 | 30篇 |
2020年 | 41篇 |
2019年 | 48篇 |
2018年 | 42篇 |
2017年 | 49篇 |
2016年 | 69篇 |
2015年 | 70篇 |
2014年 | 85篇 |
2013年 | 129篇 |
2012年 | 123篇 |
2011年 | 158篇 |
2010年 | 146篇 |
2009年 | 186篇 |
2008年 | 200篇 |
2007年 | 165篇 |
2006年 | 118篇 |
2005年 | 88篇 |
2004年 | 85篇 |
2003年 | 41篇 |
2002年 | 41篇 |
2001年 | 37篇 |
2000年 | 25篇 |
1999年 | 20篇 |
1998年 | 25篇 |
1997年 | 26篇 |
1996年 | 21篇 |
1995年 | 19篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有2277条查询结果,搜索用时 15 毫秒
1.
2.
Sadaharu Jo 《Applied Surface Science》2006,252(10):3514-3519
The morphologies and lattice structures of anthracene single crystals grown from the vapor phase were investigated using optical microscopy, phase contrast microscopy, atomic force microscopy (AFM), and X-ray diffraction analysis. Common morphologies with hexagonal large planes were observed irrespective of crystal size. The observation of certain surface morphologies with a phase contrast microscopy revealed that the spiral steps originated from screw dislocations present on the (0 0 1) planes. Moreover, the center and edge of the (0 0 1) planes had large curvatures, similar to hills. Resultantly, quarter-monolayer (ML) steps were observed on the large and flat planes between both hills. 相似文献
3.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
4.
5.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows 总被引:6,自引:0,他引:6
Michael Polacek Richard F. Hartl Karl Doerner Marc Reimann 《Journal of Heuristics》2004,10(6):613-627
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. 相似文献
6.
H. Maekawa K. Tsubakihara A. Ohnishi 《The European Physical Journal A - Hadrons and Nuclei》2007,33(3):269-272
We study the hyperon-nucleus potential with distorted-wave impulse wave approximation (DWIA) using the Green's function method.
In order to include the nucleon and hyperon potential effects in Fermi averaging, we introduce the local optimal momentum
approximation of target nucleons. We can describe the quasi-free Λ , Σ and Ξ production spectra in a better way than in the
standard Fermi-averaged t -matrix treatments. 相似文献
7.
The FRS-ESR facility at GSI provides one of the most efficient methods for direct mass measurements. In the present experiment,
exotic nuclei were produced via fragmentation of 152Sm projectiles in a thick beryllium target at 500-600 MeV/u, separated in-flight with the fragment separator FRS, and injected
into the storage-cooler ring ESR. Time-resolved Schottky Mass Spectrometry was applied for mass measurements of stored and
electron-cooled bare and few-electron ions. 373 different nuclides were identified by means of the spectra of their revolution
frequencies. Masses for 18 nuclides (84Zr, 92Ru, 94Rh, 107,108,110Sb, 111,112,114I, 118Ba, 122,123La, 124Ce, 127Pr, 129Nd, 132Pm, 134Sm, 137Eu) have been determined for the first time. Masses for 111,112I and 113Xe have been obtained via known α-decay energies. The experiment and first results will be presented. 相似文献
8.
We consider the classical problem of searching for a heavier coin in a set of n coins, n-1 of which have the same weight. The weighing device is b-balance which is the generalization of two-arms balance. The minimum numbers of weighings are determined exactly for worst-case sequential algorithm, average-case sequential algorithm, worst-case predetermined algorithm, average-case predetermined algorithm.We also investigate the above search model with additional constraint: each weighing is only allowed to use the coins that are still in doubt. We present a worst-case optimal sequential algorithm and an average-case optimal sequential algorithm requiring the minimum numbers of weighings. 相似文献
9.
In this article, by introducing characteristic singular integral operator and associate singular integral equations (SIEs), the authors discuss the direct method of solution for a class of singular integral equations with certain analytic inputs. They obtain both the conditions of solvability and the solutions in closed form. It is noteworthy that the method is different from the classical one that is due to Lu. 相似文献
10.
This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique. 相似文献