全文获取类型
收费全文 | 1966篇 |
免费 | 116篇 |
国内免费 | 141篇 |
专业分类
化学 | 585篇 |
力学 | 60篇 |
综合类 | 13篇 |
数学 | 1388篇 |
物理学 | 177篇 |
出版年
2023年 | 14篇 |
2022年 | 24篇 |
2021年 | 26篇 |
2020年 | 41篇 |
2019年 | 45篇 |
2018年 | 43篇 |
2017年 | 35篇 |
2016年 | 57篇 |
2015年 | 39篇 |
2014年 | 72篇 |
2013年 | 114篇 |
2012年 | 67篇 |
2011年 | 62篇 |
2010年 | 74篇 |
2009年 | 107篇 |
2008年 | 110篇 |
2007年 | 127篇 |
2006年 | 137篇 |
2005年 | 134篇 |
2004年 | 128篇 |
2003年 | 124篇 |
2002年 | 76篇 |
2001年 | 66篇 |
2000年 | 95篇 |
1999年 | 52篇 |
1998年 | 63篇 |
1997年 | 71篇 |
1996年 | 40篇 |
1995年 | 33篇 |
1994年 | 15篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 20篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 7篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1971年 | 2篇 |
1936年 | 1篇 |
排序方式: 共有2223条查询结果,搜索用时 15 毫秒
101.
Consider K ≥ 2 independent copies of the random walk on the symmetric group SN starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $n\in \mathbb{N}$, let Gn be the subgroup of SN generated by the K positions of the chains. In the uniform transposition model, we prove that there is a cut‐off phenomenon at time N ln(N)/(2K) for the non‐existence of fixed point of Gn and for the transitivity of Gn, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non‐existence of a fixed point of Gn appears at time of order $N^{1+\frac{2}{K}}$ (at least for K ≥ 3), but there is no cut‐off phenomenon. In the latter model, we recover a cut‐off phenomenon for the non‐existence of a fixed point at a time proportional to N by allowing the number K to be proportional to ln(N). The main tools of the proofs are spectral analysis and coupling techniques. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012 相似文献
102.
103.
104.
Let M
n =X1+...+Xn be a martingale with bounded differences Xm=Mm-Mm-1 such that {|Xm| m}=1 with some nonnegative m. Write 2=
1
2
+ ... +
n
2
. We prove the inequalities {M
nx}c(1-(x/)), {M
n x} 1- c(1- (-x/)) with a constant
. The result yields sharp inequalities in some models related to the measure concentration phenomena. 相似文献
105.
106.
Clemens Berger 《Advances in Mathematics》2002,169(1):118-175
107.
Consider a closed Jackson type network in which each queue has a single exponential server. Assume that N customers are moving among k queues. We establish simple closed form bounds on the network throughput (both lower and upper), which are sharper than those that are currently available. Numerical evaluation indicates that the improvements are significant. 相似文献
108.
A simple technique is given in this paper for the construction and analysis of a class of finite element discretizations for convection-diffusion problems in any spatial dimension by properly averaging the PDE coefficients on element edges. The resulting finite element stiffness matrix is an -matrix under some mild assumption for the underlying (generally unstructured) finite element grids. As a consequence the proposed edge-averaged finite element scheme is particularly interesting for the discretization of convection dominated problems. This scheme admits a simple variational formulation, it is easy to analyze, and it is also suitable for problems with a relatively smooth flux variable. Some simple numerical examples are given to demonstrate its effectiveness for convection dominated problems.
109.
Dimitri P. Bertsekas 《Computational Optimization and Applications》1999,12(1-3):41-51
Given a single feasible solution
and a single infeasible solution
of a mathematical program, we provide an upper bound to the optimal dual value. We assume that
satisfies a weakened form of the Slater condition. We apply the bound to convex programs and we discuss its relation to Hoffman-like bounds. As a special case, we recover a bound due to Mangasarian [11] on the distance of a point to a convex set specified by inequalities. 相似文献
110.
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strategy and multi-search threads strategy. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed. The goal of parallelization is to speedup the search in finding better quality solutions. Observations support that both parallelization strategies are beneficial, with functional decomposition producing slightly better results. Experiments were conducted for the VLSI cell placement, an NP-hard problem, and the objective was to achieve the best possible solution in terms of interconnection length, timing performance (circuit speed), and area. The multiobjective nature of this problem is addressed using a fuzzy goal-based cost computation. 相似文献