全文获取类型
收费全文 | 631篇 |
免费 | 23篇 |
国内免费 | 9篇 |
专业分类
化学 | 50篇 |
晶体学 | 2篇 |
力学 | 44篇 |
综合类 | 3篇 |
数学 | 275篇 |
物理学 | 289篇 |
出版年
2024年 | 3篇 |
2023年 | 13篇 |
2022年 | 15篇 |
2021年 | 6篇 |
2020年 | 26篇 |
2019年 | 32篇 |
2018年 | 14篇 |
2017年 | 14篇 |
2016年 | 15篇 |
2015年 | 21篇 |
2014年 | 37篇 |
2013年 | 48篇 |
2012年 | 22篇 |
2011年 | 38篇 |
2010年 | 36篇 |
2009年 | 65篇 |
2008年 | 52篇 |
2007年 | 43篇 |
2006年 | 33篇 |
2005年 | 36篇 |
2004年 | 14篇 |
2003年 | 16篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 13篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有663条查询结果,搜索用时 31 毫秒
71.
Zhanar Berikkyzy Steve Butler Jay Cummings Kristin Heysse Paul Horn Ruth Luo Brent Moran 《Discrete Mathematics》2018,341(2):497-507
Consider the following process on a simple graph without isolated vertices: order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a spanning forest of the graph.The probability of obtaining components in this process for complete bipartite graphs is determined as well as a formula for the expected number of components in any graph. A generic recurrence and some additional basic properties are discussed. 相似文献
72.
Carl Johan Casselgren Hrant H. Khachatrian Petros A. Petrosyan 《Discrete Mathematics》2018,341(3):627-637
An interval-coloring of a multigraph is a proper edge coloring with colors such that the colors of the edges incident with every vertex of are colored by consecutive colors. A cyclic interval-coloring of a multigraph is a proper edge coloring with colors such that the colors of the edges incident with every vertex of are colored by consecutive colors, under the condition that color is considered as consecutive to color . Denote by () and () the minimum and maximum number of colors in a (cyclic) interval coloring of a multigraph , respectively. We present some new sharp bounds on and for multigraphs satisfying various conditions. In particular, we show that if is a -connected multigraph with an interval coloring, then . We also give several results towards the general conjecture that for any triangle-free graph with a cyclic interval coloring; we establish that approximate versions of this conjecture hold for several families of graphs, and we prove that the conjecture is true for graphs with maximum degree at most . 相似文献
73.
The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper, we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a function of the power of an edge ideal I is strictly increasing if I is linearly presented. Examples show that this needs not to be the case for monomial ideals generated in degree greater than two. 相似文献
74.
Oscar Fernández-Ramos 《代数通讯》2013,41(6):1921-1933
Consider an ideal I ? K[x 1,…, x n ], with K an arbitrary field, generated by monomials of degree two. Assuming that I does not have a linear resolution, we determine the step s of the minimal graded free resolution of I where nonlinear syzygies first appear, we show that at this step of the resolution nonlinear syzygies are concentrated in degree s + 3, and we compute the corresponding graded Betti number β s, s+3. The multidegrees of these nonlinear syzygies are also determined and the corresponding multigraded Betti numbers are shown to be all equal to 1. 相似文献
75.
Let G be a finite simple graph on a vertex set V(G) = {x 11,…, x n1}. Also let m 1,…, m n ≥ 2 be integers and G 1,…, G n be connected simple graphs on the vertex sets V(G i ) = {x i1,…, x im i }. In this article, we provide necessary and sufficient conditions on G 1,…, G n for which the graph obtained by attaching the G i to G is unmixed or vertex decomposable. Then we characterize Cohen–Macaulay and sequentially Cohen–Macaulay graphs obtained by attaching the cycle graphs or connected chordal graphs to arbitrary graphs. 相似文献
76.
John Gavin Christopher Jennison 《Journal of computational and graphical statistics》2013,22(2):182-201
Abstract In statistical image reconstruction, data are often recorded on a regular grid of squares, known as pixels, and the reconstructed image is defined on the same pixel grid. Thus, the reconstruction of a continuous planar image is piecewise constant on pixels, and boundaries in the image consist of horizontal and vertical edges lying between pixels. This approximation to the true boundary can result in a loss of information that may be quite noticeable for small objects, only a few pixels in size. Increasing the resolution of the sensor may not be a practical alternative. If some prior assumptions are made about the true image, however, reconstruction to a greater accuracy than that of the recording sensor's pixel grid is possible. We adopt a Bayesian approach, incorporating prior information about the true image in a stochastic model that attaches higher probability to images with shorter total edge length. In reconstructions, pixels may be of a single color or split between two colors. The model is illustrated using both real and simulated data. 相似文献
77.
78.
Giuseppe Savaré 《偏微分方程通讯》2013,38(5-6):869-899
We study a mixed boundary value problem for elliptic second order equations obtaining optimal regularity results under weak assumptions on the data. We also consider the dependence of the solution with respect to perturbations of the boundary sets carrying the Dirichlet and the Neumann conditions. 相似文献
79.
One of the challenges of cellular automaton research is finding models with a low complexity and at the same time a rich dynamics. A measure of low complexity is the number of states in the model and the number of transition rules to switch between those states. In this paper, we propose a 2-dimensional 2-state cellular automaton that-though governed by a single simple transition rule-has a sufficiently rich dynamics to be computationally universal. According to the transition rule, a cell’s state is determined by the sum of the states of the cells at orthogonal or diagonal distances one or two from the cell (distance-2 Moore neighbourhood), but not by the previous state of the cell itself. Notwithstanding its simplicity, this model is able to generate a great variety of patterns, including several types of stable configurations, oscillators and patterns that move over cellular space (gliders). We prove the computational universality of the model by constructing a universal set of logic gates (NOT and AND) from these patterns. A key element in this proof is the shifting of phases and positions of signals such that they meet the input requirements of the logic gates. Similarities of the model with classical spin systems are also discussed. 相似文献
80.