全文获取类型
收费全文 | 369篇 |
免费 | 40篇 |
国内免费 | 42篇 |
专业分类
化学 | 4篇 |
力学 | 5篇 |
综合类 | 15篇 |
数学 | 410篇 |
物理学 | 17篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 10篇 |
2021年 | 3篇 |
2020年 | 16篇 |
2019年 | 12篇 |
2018年 | 11篇 |
2017年 | 18篇 |
2016年 | 15篇 |
2015年 | 8篇 |
2014年 | 14篇 |
2013年 | 37篇 |
2012年 | 11篇 |
2011年 | 15篇 |
2010年 | 23篇 |
2009年 | 35篇 |
2008年 | 28篇 |
2007年 | 17篇 |
2006年 | 34篇 |
2005年 | 22篇 |
2004年 | 11篇 |
2003年 | 13篇 |
2002年 | 21篇 |
2001年 | 10篇 |
2000年 | 10篇 |
1999年 | 9篇 |
1998年 | 4篇 |
1997年 | 11篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有451条查询结果,搜索用时 187 毫秒
1.
2.
3.
Palle E.T. Jorgensen Erin P.J. Pearse 《Journal of Mathematical Analysis and Applications》2019,469(2):765-807
Motivated by applications to machine learning, we construct a reversible and irreducible Markov chain whose state space is a certain collection of measurable sets of a chosen l.c.h. space . We study the resulting network (connected undirected graph), including transience, Royden and Riesz decompositions, and kernel factorization. We describe a construction for Hilbert spaces of signed measures which comes equipped with a new notion of reproducing kernels and there is a unique solution to a regularized optimization problem involving the approximation of functions by functions of finite energy. The latter has applications to machine learning (for Markov random fields, for example). 相似文献
4.
5.
6.
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. 相似文献
7.
A.H.Tang 《中国物理C(英文版)》2020,44(5):054101-054101-13
In this paper a pair of observables are proposed as alternative ways,by examining the fluctuation of net momentum-ordering of charged pairs,to study the charge separation induced by the Chiral Magnetic Effect(CME)in relativistic heavy ion collisions.They are,the out-of-plane to in-plane ratio of fluctuation of the difference between signed balance functions measured in pair’s rest frame,and the ratio of it to similar measurement made in the laboratory frame.Both observables have been studied with simulations including flow-related backgrounds,and for the first time,backgrounds that are related to resonance's global spin alignment.The two observables have similar positive responses to signal,and opposite,limited responses to identifiable backgrounds arising from resonance flow and spin alignment.Both observables have also been tested with two realistic models,namely,a multi-phase transport(AMPT)model and the anomalous-viscous fluid dynamics(AVFD)model.These two observables,when cross examined,will provide useful insights in the study of CME-induced charge separation. 相似文献
8.
Jørgen Bang-Jensen Thomas Bellitto Thomas Schweser Michael Stiebitz 《Journal of Graph Theory》2020,95(1):76-98
DP-coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of finding a list-coloring of a given graph with a list-assignment to finding an independent transversal in an auxiliary graph with vertex set . In this paper, we extend the definition of DP-colorings to digraphs using the approach from Neumann-Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks’ type theorem regarding the DP-chromatic number, which extends various results on the (list-)chromatic number of digraphs. 相似文献
9.
10.
Jørgen Bang‐Jensen Tilde My Christiansen Alessandro Maddaloni 《Journal of Graph Theory》2017,85(2):545-567
The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1]. 相似文献