全文获取类型
收费全文 | 628篇 |
免费 | 34篇 |
国内免费 | 37篇 |
专业分类
化学 | 44篇 |
力学 | 107篇 |
综合类 | 11篇 |
数学 | 436篇 |
物理学 | 101篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 9篇 |
2021年 | 8篇 |
2020年 | 12篇 |
2019年 | 13篇 |
2018年 | 15篇 |
2017年 | 21篇 |
2016年 | 19篇 |
2015年 | 12篇 |
2014年 | 24篇 |
2013年 | 40篇 |
2012年 | 25篇 |
2011年 | 50篇 |
2010年 | 43篇 |
2009年 | 59篇 |
2008年 | 71篇 |
2007年 | 52篇 |
2006年 | 27篇 |
2005年 | 24篇 |
2004年 | 20篇 |
2003年 | 25篇 |
2002年 | 18篇 |
2001年 | 20篇 |
2000年 | 7篇 |
1999年 | 8篇 |
1998年 | 13篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 8篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有699条查询结果,搜索用时 15 毫秒
81.
We develop a closed queueing network model for flexible manufacturing systems (FMSs), where parts routing follows a probabilistic shortest-queue (PSQ) scheme, i.e. parts are routed to the shortest queue (or the most empty station) with the highest probability. We allow limited local buffer at each work station. We prove that with the PSQ routing, the Markovian queue-length process satisfies time reversibility and has a product-form equilibrium distribution. An algorithm is developed to compute the solutions to the model. The model can be used as a performance evaluation tool to study FMSs. 相似文献
82.
Andreas Löhne 《Journal of Mathematical Analysis and Applications》2006,319(2):617-634
In this paper we introduce a convergence concept for closed convex subsets of a finite-dimensional normed vector space. This convergence is called C-convergence. It is defined by appropriate notions of upper and lower limits. We compare this convergence with the well-known Painlevé-Kuratowski convergence and with scalar convergence. In fact, we show that a sequence (An)n∈NC-converges to A if and only if the corresponding support functions converge pointwise, except at relative boundary points of the domain of the support function of A, to the support function of A. 相似文献
83.
84.
In this paper, we study darning of general symmetric Markov processes by shorting some parts of the state space into singletons. A natural way to construct such processes is via Dirichlet forms restricted to the function spaces whose members take constant values on these collapsing parts. They include as a special case Brownian motion with darning, which has been studied in details in Chen (2012), Chen and Fukushima (2012) and Chen et al. (2016). When the initial processes have discontinuous sample paths, the processes constructed in this paper are the genuine extensions of those studied in Chen and Fukushima (2012). We further show that, up to a time change, these Markov processes with darning can be approximated in the sense of finite-dimensional distributions by introducing additional jumps with large intensity among these compact sets to be collapsed into singletons. For diffusion processes, it is also possible to get, up to a time change, diffusions with darning by increasing the conductance on these compact sets to infinity. To accomplish these, we give a version of the semigroup characterization of Mosco convergence to closed symmetric forms whose domain of definition may not be dense in the -space. The latter is of independent interest and potentially useful to study convergence of Markov processes having different state spaces. Indeed, we show in Section 5 of this paper that Brownian motion in a plane with a very thin flag pole can be approximated by Brownian motion in the plane with a vertical cylinder whose horizontal motion on the cylinder is a circular Brownian motion moving at fast speed. 相似文献
85.
We establish a relationship between geodesic nets and critical points of the distance function. We bound the number of balanced points for certain minimizing geodesic nets on manifolds homeomorphic to the n-sphere. This result is used to give conditions under which a minimizing geodesic flower degenerates into a simple closed geodesic. 相似文献
86.
S.H. Kulkarni 《Linear algebra and its applications》2010,432(11):3012-3017
Aim of this short note is to obtain a formula for the gap between two densely defined unbounded closed operators. It is interesting to note that the formula is very similar to the corresponding formula for the gap between two bounded operators. 相似文献
87.
Yusuke Suzuki 《Discrete Mathematics》2010,310(1):6-11
We show that, for any given non-spherical orientable closed surface F2, there exists an optimal 1-planar graph which can be embedded on F2 as a triangulation. On the other hand, we prove that there does not exist any such graph for the nonorientable closed surfaces of genus at most 3. 相似文献
88.
M.A. Goberna E. González M.I. Todorov 《Journal of Mathematical Analysis and Applications》2010,364(1):209-221
Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. This paper provides five characterizations of the larger class of closed convex sets in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed in the paper. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed. 相似文献
89.
90.
Bangteng Xu 《Journal of Combinatorial Theory, Series A》2010,117(7):981-131
Let G be a group acting transitively on a set X such that all subdegrees are finite. Isaacs and Praeger (1993) [5] studied the common divisor graph of (G,X). For a group G and its subgroup A, based on the results in Isaacs and Praeger (1993) [5], Kaplan (1997) [6] proved that if A is stable in G and the common divisor graph of (A,G) has two components, then G has a nice structure. Motivated by the notion of the common divisor graph of (G,X), Camina (2008) [3] introduced the concept of the IP-graph of a naturally valenced association scheme. The common divisor graph of (G,X) is the IP-graph of the association scheme arising from the action of G on X. Xu (2009) [8] studied the properties of the IP-graph of an arbitrary naturally valenced association scheme, and generalized the main results in Isaacs and Praeger (1993) [5] and Camina (2008) [3]. In this paper we first prove that if the IP-graph of a naturally valenced association scheme (X,S) is stable and has two components (not including the trivial component whose only vertex is 1), then S has a closed subset T such that the thin residue O?(T) and the quotient scheme (X/O?(T),S//O?(T)) have very nice properties. Then for an association scheme (X,S) and a closed subset T of S such that S//T is an association scheme on X/T, we study the relations between the closed subsets of S and those of S//T. Applying these results to schurian schemes and common divisor graphs of groups, we obtain the results of Kaplan [6] as direct consequences. 相似文献