全文获取类型
收费全文 | 4042篇 |
免费 | 380篇 |
国内免费 | 284篇 |
专业分类
化学 | 676篇 |
晶体学 | 11篇 |
力学 | 278篇 |
综合类 | 85篇 |
数学 | 3018篇 |
物理学 | 638篇 |
出版年
2024年 | 4篇 |
2023年 | 25篇 |
2022年 | 84篇 |
2021年 | 93篇 |
2020年 | 90篇 |
2019年 | 75篇 |
2018年 | 90篇 |
2017年 | 109篇 |
2016年 | 129篇 |
2015年 | 83篇 |
2014年 | 174篇 |
2013年 | 303篇 |
2012年 | 193篇 |
2011年 | 193篇 |
2010年 | 190篇 |
2009年 | 261篇 |
2008年 | 306篇 |
2007年 | 272篇 |
2006年 | 223篇 |
2005年 | 227篇 |
2004年 | 177篇 |
2003年 | 152篇 |
2002年 | 132篇 |
2001年 | 152篇 |
2000年 | 158篇 |
1999年 | 129篇 |
1998年 | 107篇 |
1997年 | 107篇 |
1996年 | 78篇 |
1995年 | 62篇 |
1994年 | 43篇 |
1993年 | 32篇 |
1992年 | 23篇 |
1991年 | 25篇 |
1990年 | 11篇 |
1989年 | 15篇 |
1988年 | 24篇 |
1987年 | 11篇 |
1986年 | 12篇 |
1985年 | 21篇 |
1984年 | 23篇 |
1983年 | 10篇 |
1982年 | 12篇 |
1981年 | 18篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1977年 | 14篇 |
1976年 | 6篇 |
1959年 | 2篇 |
排序方式: 共有4706条查询结果,搜索用时 250 毫秒
31.
We study the number of determining modes necessary for continuous data assimilation in the two-dimensional incompressible Navier–Stokes equations. Our focus is on how the spatial structure of the body forcing affects the rate of continuous data assimilation and the number of determining modes. We treat this problem analytically by proving a convergence result depending on the H
–1 norm of f and computationally by considering a family of forcing functions with identical Grashof numbers that are supported on different annuli in Fourier space. The rate of continuous data assimilation and the number of determining modes is shown to depend strongly on the length scales present in the forcing. 相似文献
32.
TieYong YangGuangjun 《分析论及其应用》2004,20(1):58-68
In this paper, we construct some continuous but non-differentiable functions defined by quinary decimal, that are Kiesswetter-like functions. We discuss their properties, then investigate the Hausdorff dimensions of graphs of these functions and give a detailed proof. 相似文献
33.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
34.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
35.
Bush连续不可微函数的分形性质 总被引:1,自引:0,他引:1
本文对用递推关系确定的Bush连续不可微函数,找出了迭代函数系(IFS),从而得到它的级数表达式和所具有的自仿射分形的有关性质.最后还计算出函数图象的Hausdorff 维数的准确值. 相似文献
36.
The notion of a fuzzy retract was introduced by Rodabaugh (1981). The notion of a fuzzy pairwise retract was introduced in 2001. Some weak forms and some strong forms of α-continuous mappings were introduced in 1988 and 1997. The authors extend some of these forms to the L-fuzzy bitopological setting and construct various α-fuzzy pairwise retracts. The concept of weakly induced spaces in the case L = [0,1] was introduced by Martin (1980). Liu and Luo (1987) generalized this notion to the case that L is an arbitrary F-lattice and introduced the notion of induced L-fts. Several results are obtained, especially, for L-valued pairwise stratification spaces. 相似文献
37.
Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities. 相似文献
38.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
39.
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. 相似文献
40.
T. Charitat B. Fourcade 《The European Physical Journal B - Condensed Matter and Complex Systems》1998,1(3):333-336
An o-ring takes spontaneously the shape of a chair when strong enough torsion is applied in its tangent plane. This state
is metastable, since work has to be done on the o-ring to return to the circular shape. We show that this metastable state
exists in a Hamiltonian where curvature and torsion are coupled via an intrinsic curvature term. If the o-ring is constrained to be planar (2d case), this metastable state displays a kink-anti-kink
pair. This state is metastable if the ratio is less than , where C and A are the torsion and the bending elastic constants [#!landau!#]. In three dimensions, our variational approach shows that
. This model can be generalized to the case where the bend is induced by a concentration field which follows the variations
of the curvature.
Received: 27 August 1997 / Revised: 23 October 1997 / Accepted: 12 November 1997 相似文献