全文获取类型
收费全文 | 5807篇 |
免费 | 139篇 |
国内免费 | 144篇 |
专业分类
化学 | 2130篇 |
晶体学 | 6篇 |
力学 | 782篇 |
综合类 | 28篇 |
数学 | 2370篇 |
物理学 | 774篇 |
出版年
2024年 | 9篇 |
2023年 | 67篇 |
2022年 | 63篇 |
2021年 | 76篇 |
2020年 | 66篇 |
2019年 | 66篇 |
2018年 | 64篇 |
2017年 | 60篇 |
2016年 | 83篇 |
2015年 | 107篇 |
2014年 | 174篇 |
2013年 | 255篇 |
2012年 | 278篇 |
2011年 | 297篇 |
2010年 | 251篇 |
2009年 | 363篇 |
2008年 | 379篇 |
2007年 | 451篇 |
2006年 | 348篇 |
2005年 | 285篇 |
2004年 | 323篇 |
2003年 | 233篇 |
2002年 | 214篇 |
2001年 | 151篇 |
2000年 | 147篇 |
1999年 | 130篇 |
1998年 | 145篇 |
1997年 | 108篇 |
1996年 | 118篇 |
1995年 | 88篇 |
1994年 | 74篇 |
1993年 | 89篇 |
1992年 | 60篇 |
1991年 | 85篇 |
1990年 | 42篇 |
1989年 | 32篇 |
1988年 | 41篇 |
1987年 | 37篇 |
1986年 | 38篇 |
1985年 | 43篇 |
1984年 | 41篇 |
1983年 | 16篇 |
1982年 | 28篇 |
1981年 | 17篇 |
1980年 | 9篇 |
1979年 | 9篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1974年 | 2篇 |
排序方式: 共有6090条查询结果,搜索用时 15 毫秒
1.
Plasma-assisted flow control is of high industrial interest, but practical applications at full scale require a large surface of interaction. Nanosecond pulsed Dielectric Barrier Discharge (DBD) have demonstrated promising results of flow control, but their interacting region is limited to only a few cm2. In this paper, the conditions to extend a surface nanosecond DBD are documented. It is shown that a sliding discharge regime can fully fill an inter-electrode distance of 40 mm. This discharge regime promotes the formation of two hemispheric pressure waves originating from both air-exposed electrodes while an horizontal region of pressure gradient is also observed. 相似文献
2.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
3.
Ashish Goel Monika R. Henzinger Serge Plotkin Eva Tardos 《Journal of Algorithms in Cognition, Informatics and Logic》2003,48(2):314-332
In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum. 相似文献
4.
5.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
6.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
7.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
8.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
9.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
10.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献