全文获取类型
收费全文 | 189篇 |
免费 | 2篇 |
国内免费 | 3篇 |
专业分类
化学 | 3篇 |
力学 | 4篇 |
数学 | 177篇 |
物理学 | 10篇 |
出版年
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 1篇 |
2016年 | 6篇 |
2015年 | 1篇 |
2014年 | 7篇 |
2013年 | 6篇 |
2012年 | 6篇 |
2011年 | 10篇 |
2010年 | 13篇 |
2009年 | 21篇 |
2008年 | 14篇 |
2007年 | 8篇 |
2006年 | 10篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有194条查询结果,搜索用时 31 毫秒
51.
This paper examines an M[x]/G/1 queueing system with a randomized vacation policy and at most J vacations. Whenever the system is empty, the server immediately takes a vacation. If there is at least one customer found waiting in the queue upon returning from a vacation, the server will be immediately activated for service. Otherwise, if no customers are waiting for service at the end of a vacation, the server either remains idle with probability p or leaves for another vacation with probability 1-p. This pattern continues until the number of vacations taken reaches J. If the system is empty by the end of the J th vacation, the server is dormant idly in the system. If there is one or more customers arrive at server idle state, the server immediately starts his services for the arrivals. For such a system, we derive the distributions of important characteristics, such as system size distribution at a random epoch and at a departure epoch, system size distribution at busy period initiation epoch, idle period and busy period, etc. Finally, a cost model is developed to determine the joint suitable parameters (p∗,J∗) at a minimum cost, and some numerical examples are presented for illustrative purpose. 相似文献
52.
53.
Kazunori KOJIMA Daisuke KAMAI Akie YAMAMOTO Yuji TSUCHITANI Hiroaki KATAOKA 《Physical Therapy Research》2021,24(3):272
Objective: The purpose of the study was to clarify the causal effect of toe-grasping exercises on the improvement of static or dynamic balance ability in home-based rehabilitation users. Method: Our study included 34 subjects who met the criteria and were evaluable out of 98 rehabilitation service users at home nursing stations. This study was a randomized controlled trial. The intervention group performed towel gathering exercises in addition to the regular home-based rehabilitation program. The primary outcome was one-leg standing time, and the secondary outcomes were two-step test and toe grip strength. Results: Seventeen subjects were assigned to the intervention group and seventeen to the control group by block randomization. Data from 15 and 12 subjects in the intervention group and control group, respectively, who were able to complete the initial evaluation and the evaluation after 3 months, were analyzed. We compared the amount of change after 3 months of evaluation in the intervention group with the change in the control group. The results showed that the left/right mean value of oneleg standing time in the intervention group was significantly greater than that in the control group. In terms of the amount of change in the intervention period (T2-T1) within each assessment, there were significant improvements in both the toe-grip strength and the two-step values in the intervention group. Conclusion: We found that toe-grasping exercises could improve the balance ability of home-based rehabilitation users. This suggests the clinical significance of toe function in rehabilitation programs. 相似文献
54.
Allan J. Macleod 《Advances in Computational Mathematics》1994,2(2):251-260
A test procedure is developed for software which evaluates the Bessel functionsJ
0,J
1,Y
0,Y
1. The tests are highly accurate and are applied to various available codes. Results are presented on the performance of the
codes. 相似文献
55.
In this paper, we present an overview of probabilistic techniques based on randomized algorithms for solving “hard’’ problems arising in performance verification and control of complex systems. This area is fairly recent, even though its roots lie in the robustness techniques for handling uncertain control systems developed in the 1980s. In contrast to these deterministic techniques, the main ingredient of the methods discussed in this survey is the use of probabilistic concepts. The introduction of probability and random sampling permits overcoming the fundamental tradeoff between numerical complexity and conservatism that lie at the roots of the worst-case deterministic methodology. The simplicity of implementation of randomized techniques may also help bridging the gap between theory and practical applications. 相似文献
56.
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in Rn (the current best algorithm has complexity roughly n4, conjectured to be n3). Our main tools, dispersion of random determinants and dispersion of the length of a random point from a convex body, are of independent interest and applicable more generally; in particular, the latter is closely related to the variance hypothesis from convex geometry. This geometric dispersion also leads to lower bounds for matrix problems and property testing. 相似文献
57.
Gérard Cornuéjols 《Mathematical Programming》2008,112(1):3-44
This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces the necessary tools from
polyhedral theory and gives a geometric understanding of several classical families of valid inequalities such as lift-and-project
cuts, Gomory mixed integer cuts, mixed integer rounding cuts, split cuts and intersection cuts, and it reveals the relationships
between these families. The tutorial also discusses computational aspects of generating the cuts and their strength.
Supported by NSF grant DMI-0352885, ONR grant N00014-03-1-0188 and ANR grant BLAN06-1-138894. 相似文献
58.
This paper discusses a randomized nonautonomous logistic equation
59.
We study the problem of sampling uniformly at random from the set of k-colorings of a graph with maximum degree Δ. We focus attention on the Markov chain Monte Carlo method, particularly on a popular Markov chain for this problem, the Wang–Swendsen–Kotecký (WSK) algorithm. The second author recently proved that the WSK algorithm quickly converges to the desired distribution when k11Δ/6. We study how far these positive results can be extended in general. In this note we prove the first non-trivial results on when the WSK algorithm takes exponentially long to reach the stationary distribution and is thus called torpidly mixing. In particular, we show that the WSK algorithm is torpidly mixing on a family of bipartite graphs when 3k<Δ/(20logΔ), and on a family of planar graphs for any number of colors. We also give a family of graphs for which, despite their small chromatic number, the WSK algorithm is not ergodic when kΔ/2, provided k is larger than some absolute constant k0. 相似文献
60.
Erich Novak Ian H. Sloan Henryk Wozniakowski 《Foundations of Computational Mathematics》2004,4(2):121-156
We study the approximation problem (or problem of optimal recovery in the
$L_2$-norm) for weighted Korobov spaces with smoothness
parameter $\a$. The weights $\gamma_j$ of the Korobov spaces moderate
the behavior of periodic functions with respect to successive variables.
The nonnegative smoothness parameter $\a$ measures the decay
of Fourier coefficients. For $\a=0$, the Korobov space is the
$L_2$ space, whereas for positive $\a$, the Korobov space
is a space of periodic functions with some smoothness
and the approximation problem
corresponds to a compact operator. The periodic functions are defined on
$[0,1]^d$ and our main interest is when the dimension $d$ varies and
may be large. We consider algorithms using two different
classes of information.
The first class $\lall$ consists of arbitrary linear functionals.
The second class $\lstd$ consists of only function values
and this class is more realistic in practical computations.
We want to know when the approximation problem is
tractable. Tractability means that there exists an algorithm whose error
is at most $\e$ and whose information cost is bounded by a polynomial
in the dimension $d$ and in $\e^{-1}$. Strong tractability means that
the bound does not depend on $d$ and is polynomial in $\e^{-1}$.
In this paper we consider the worst case, randomized, and quantum
settings. In each setting, the concepts of error and cost are defined
differently and, therefore, tractability and strong tractability
depend on the setting and on the class of information.
In the worst case setting, we apply known results to prove
that strong tractability and tractability in the class $\lall$
are equivalent. This holds
if and only if $\a>0$ and the sum-exponent $s_{\g}$ of weights is finite, where
$s_{\g}= \inf\{s>0 : \xxsum_{j=1}^\infty\g_j^s\,<\,\infty\}$.
In the worst case setting for the class $\lstd$ we must assume
that $\a>1$ to guarantee that
functionals from $\lstd$ are continuous. The notions of strong
tractability and tractability are not equivalent. In particular,
strong tractability holds if and only if $\a>1$ and
$\xxsum_{j=1}^\infty\g_j<\infty$.
In the randomized setting, it is known that randomization does not
help over the worst case setting in the class $\lall$. For the class
$\lstd$, we prove that strong tractability and tractability
are equivalent and this holds under the same assumption
as for the class $\lall$ in the worst case setting, that is,
if and only if $\a>0$ and $s_{\g} < \infty$.
In the quantum setting, we consider only upper bounds for the class
$\lstd$ with $\a>1$. We prove that $s_{\g}<\infty$ implies strong
tractability.
Hence for $s_{\g}>1$, the randomized and quantum settings
both break worst case intractability of approximation for
the class $\lstd$.
We indicate cost bounds on algorithms with error at
most $\e$. Let $\cc(d)$ denote the cost of computing $L(f)$ for
$L\in \lall$ or $L\in \lstd$, and let the cost of one arithmetic
operation be taken as unity.
The information cost bound in the worst case setting for the
class $\lall$ is of order $\cc (d) \cdot \e^{-p}$
with $p$ being roughly equal to $2\max(s_\g,\a^{-1})$.
Then for the class $\lstd$
in the randomized setting,
we present an algorithm with error at most $\e$ and whose total cost is
of order $\cc(d)\e^{-p-2} + d\e^{-2p-2}$, which for small $\e$ is roughly
$$
d\e^{-2p-2}.
$$
In the quantum setting, we present a quantum algorithm
with error at most $\e$ that
uses about only $d + \log \e^{-1}$ qubits
and whose total cost is of order
$$
(\cc(d) +d) \e^{-1-3p/2}.
$$
The ratio of the costs of the algorithms in the quantum setting and
the randomized setting is of order
$$
\frac{d}{\cc(d)+d}\,\left(\frac1{\e}\right)^{1+p/2}.
$$
Hence, we have a polynomial speedup of order $\e^{-(1+p/2)}$.
We stress that $p$ can be arbitrarily large, and in this case
the speedup is huge. 相似文献