全文获取类型
收费全文 | 2704篇 |
免费 | 411篇 |
国内免费 | 125篇 |
专业分类
化学 | 445篇 |
晶体学 | 21篇 |
力学 | 319篇 |
综合类 | 92篇 |
数学 | 985篇 |
物理学 | 1378篇 |
出版年
2024年 | 1篇 |
2023年 | 42篇 |
2022年 | 114篇 |
2021年 | 80篇 |
2020年 | 97篇 |
2019年 | 77篇 |
2018年 | 80篇 |
2017年 | 118篇 |
2016年 | 102篇 |
2015年 | 92篇 |
2014年 | 169篇 |
2013年 | 218篇 |
2012年 | 143篇 |
2011年 | 176篇 |
2010年 | 164篇 |
2009年 | 170篇 |
2008年 | 171篇 |
2007年 | 151篇 |
2006年 | 123篇 |
2005年 | 128篇 |
2004年 | 114篇 |
2003年 | 97篇 |
2002年 | 95篇 |
2001年 | 81篇 |
2000年 | 46篇 |
1999年 | 57篇 |
1998年 | 44篇 |
1997年 | 45篇 |
1996年 | 30篇 |
1995年 | 32篇 |
1994年 | 21篇 |
1993年 | 27篇 |
1992年 | 19篇 |
1991年 | 22篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 2篇 |
1984年 | 10篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1980年 | 4篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 7篇 |
1975年 | 3篇 |
1974年 | 3篇 |
排序方式: 共有3240条查询结果,搜索用时 1 毫秒
11.
单循环赛赛程安排的一个图论方法 总被引:2,自引:0,他引:2
唐保祥 《数学的实践与认识》2004,34(5):120-125
利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案 相似文献
12.
Madhu V. Nayakkankuppam 《Mathematical Programming》2007,109(2-3):477-504
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using
the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos
method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects
related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously
possible, and acceptable parallel scalability on sufficiently large problems.
This work was supported in part by NSF grants DMS-0215373 and DMS-0238008. 相似文献
13.
M.C. Ubaldi V. Stasi U. Colombo D. Piccinin M. Martinelli 《Photonics and Nanostructures》2007,5(2-3):145-148
Roughness reduction of a submicron waveguide profile in chemically amplified negative resist is here performed by proper selection of an alkali-based developer, taking into account that its smaller molecules lead to smoother resist surface by altering the developing mechanism of aggregate extraction performed with standard quaternary ammonium hydroxide. Roughness is then analyzed by means of classical Atomic Force Microscope inspection; furthermore, a non-invasive line edge roughness analysis approach based on top-down scanning electron microscope acquisition gives comparable results, in terms of standard deviation and molecular aggregate periodicity. 相似文献
15.
本文我们给出一个修正的非线性扩散方程模型,与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分:卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题,因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性,同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型,并且给出几个具体图像在该模型下处理结果。 相似文献
16.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
17.
18.
19.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
20.