全文获取类型
收费全文 | 919篇 |
免费 | 53篇 |
国内免费 | 68篇 |
专业分类
化学 | 171篇 |
晶体学 | 1篇 |
力学 | 21篇 |
综合类 | 28篇 |
数学 | 696篇 |
物理学 | 123篇 |
出版年
2024年 | 2篇 |
2023年 | 9篇 |
2022年 | 16篇 |
2021年 | 21篇 |
2020年 | 23篇 |
2019年 | 23篇 |
2018年 | 28篇 |
2017年 | 20篇 |
2016年 | 31篇 |
2015年 | 22篇 |
2014年 | 52篇 |
2013年 | 91篇 |
2012年 | 39篇 |
2011年 | 56篇 |
2010年 | 58篇 |
2009年 | 68篇 |
2008年 | 86篇 |
2007年 | 64篇 |
2006年 | 40篇 |
2005年 | 39篇 |
2004年 | 34篇 |
2003年 | 32篇 |
2002年 | 23篇 |
2001年 | 21篇 |
2000年 | 18篇 |
1999年 | 19篇 |
1998年 | 18篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 3篇 |
1992年 | 9篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1040条查询结果,搜索用时 31 毫秒
1.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
2.
O. Fülöp 《Discrete Mathematics》2005,294(3):285-290
We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k. 相似文献
3.
For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω. 相似文献
4.
In this paper, we evaluate various analytic Feynman integrals of first variation, conditional first variation, Fourier-Feynman
transform and conditional Fourier-Feynman transform of cylinder type functions defined over Wiener paths in abstract Wiener
space. We also derive the analytic Feynman integral of the conditional Fourier-Feynman transform for the product of the cylinder
type functions which define the functions in a Banach algebra introduced by Yoo, with n linear factors. 相似文献
5.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
6.
In [W.-C. Kuo, C.C.A. Labuschagne, B.A. Watson, Discrete-time stochastic processes on Riesz spaces, Indag. Math. (N.S.) 15 (3) (2004) 435-451], we introduced the concepts of conditional expectations, martingales and stopping times on Riesz spaces. Here we formulate and prove order theoretic analogues of the Birkhoff, Hopf and Wiener ergodic theorems and the Strong Law of Large Numbers on Riesz spaces (vector lattices). 相似文献
7.
We introduce the time-consistency concept that is inspired by the so-called “principle of optimality” of dynamic programming
and demonstrate – via an example – that the conditional value-at-risk (CVaR) need not be time-consistent in a multi-stage
case. Then, we give the formulation of the target-percentile risk measure which is time-consistent and hence more suitable
in the multi-stage investment context. Finally, we also generalize the value-at-risk and CVaR to multi-stage risk measures
based on the theory and structure of the target-percentile risk measure. 相似文献
8.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
9.
Karl Sigman 《Operations Research Letters》2007,35(5):581-583
In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments. 相似文献
10.
S. Juneja 《Queueing Systems》2007,57(2-3):115-127
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems
in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient
algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such
tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable
bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric
sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key
idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation
then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance
sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates
it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for
the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.
相似文献