全文获取类型
收费全文 | 653篇 |
免费 | 56篇 |
国内免费 | 46篇 |
专业分类
化学 | 55篇 |
力学 | 28篇 |
综合类 | 16篇 |
数学 | 533篇 |
物理学 | 123篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 7篇 |
2021年 | 14篇 |
2020年 | 13篇 |
2019年 | 23篇 |
2018年 | 24篇 |
2017年 | 17篇 |
2016年 | 15篇 |
2015年 | 12篇 |
2014年 | 23篇 |
2013年 | 51篇 |
2012年 | 25篇 |
2011年 | 34篇 |
2010年 | 25篇 |
2009年 | 41篇 |
2008年 | 44篇 |
2007年 | 43篇 |
2006年 | 37篇 |
2005年 | 37篇 |
2004年 | 27篇 |
2003年 | 28篇 |
2002年 | 27篇 |
2001年 | 23篇 |
2000年 | 17篇 |
1999年 | 22篇 |
1998年 | 21篇 |
1997年 | 14篇 |
1996年 | 17篇 |
1995年 | 10篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 4篇 |
排序方式: 共有755条查询结果,搜索用时 109 毫秒
91.
A parallel algorithm for depth-first searching of a directed acyclic graph (DAG) on a shared memory model of a SIMD computer is proposed. The algorithm uses two parallel tree traversal algorithms, one for the preorder traversal and the other for therpostorder traversal of an ordered tree. Each of these traversal algorithms has a time complexity ofO(logn) whenO(n) processors are used,n being the number of vertices in the tree. The parallel depth-first search algorithm for a directed acyclic graphG withn vertices has a time complexity ofO((logn)2) whenO(n
2.81/logn) processors are used. 相似文献
92.
We study the properties of finite ergodic Markov Chains whose transition probability matrix P is singular. The results establish bounds on the convergence time of Pm to a matrix where all the rows are equal to the stationary distribution of P. The results suggest a simple rule for identifying the singular matrices which do not have a finite convergence time. We next study finite convergence to the stationary distribution independent of the initial distribution. The results establish the connection between the convergence time and the order of the minimal polynomial of the transition probability matrix. A queuing problem and a maintenance Markovian decision problem which possess the property of rapid convergence are presented. 相似文献
93.
We study the Pareto optimal equilibria payoffs of the non-cooperative game associated with the cost spanning tree problem.
We give two characterisations of these payoffs: one based on the tree they induce and another based on the strategies played
by agents. Moreover, an algorithm for computing all these payoffs is provided. 相似文献
94.
The concept of a minimum spanning tree (MST) is used to study patterns of comovements for a set of twenty government bond market indices for developed North American, European, and Asian countries. We show how the MST and its related hierarchical tree evolve over time and describe the dynamic development of market linkages. Over the sample period, 1993-2008, linkages between markets have decreased somewhat. However, a subset of European Union (EU) bond markets does show increasing levels of comovements. The evolution of distinct groups within the Eurozone is also examined. The implications of our findings for portfolio diversification benefits are outlined. 相似文献
95.
An approach to highly enhance the compression efficiency of the integral images by applying the Karhunen-Loeve transform (KLT) algorithm to the motion-compensated sub-images is proposed. The sub-images transformed from the elemental images picked-up from the three-dimensional (3D) object might represent the different perspectives of the object. Thus, the similarity among the sub-images gets better than that among the elemental images, so that an improvement of compression efficiency of the sub-images could be obtained. However, motion vectors occurred among the sub-images might result in an additional increase of image data to be compressed. Accordingly, in this paper, motion vectors have been estimated and compensated in all sub-image in advance. Then the KLT algorithm was applied to these motion-compensated sub-images for compression. It is shown from some experimental results that compression efficiency of the proposed method has been improved up to 24.44%, 40.62%, respectively, on the average compared to that of the conventional KLT compression method and that of the JPEG. 相似文献
96.
A spanning tree of a properly edge-colored complete graph, , is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectured that if is properly -edge-colored, then the edges of can be partitioned into rainbow spanning trees except when . By means of an explicit, constructive approach, in this paper we construct mutually edge-disjoint rainbow spanning trees for any positive value of . Not only are the rainbow trees produced, but also some structure of each rainbow spanning tree is determined in the process. This improves upon best constructive result to date in the literature which produces exactly three rainbow trees. 相似文献
97.
Hongbo Zhang 《代数通讯》2018,46(2):780-791
A ring R is said to have the finitely generated cancellation property provided that the module isomorphism R⊕B?R⊕C implies B?C for any finitely generated R-modules B and C. It is proved that R has this property is equivalent to the existence of the cancellation matrices over R. Moreover, the structure of such matrices is investigated and finite weakly stable rings are characterized in terms of their cancellation matrices. 相似文献
98.
《Journal of Graph Theory》2018,88(4):631-640
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2‐regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs. 相似文献
99.
I. Fabrici J. Harant T. Madaras S. Mohr R. Soták C. T. Zamfirescu 《Journal of Graph Theory》2020,95(1):125-137
A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges induce a complete subgraph, then the graph is locally maximal 1-planar. For a 3-connected locally maximal 1-planar graph G, we show the existence of a spanning 3-connected planar subgraph and prove that G is Hamiltonian if G has at most three 3-vertex-cuts, and that G is traceable if G has at most four 3-vertex-cuts. Moreover, infinitely many nontraceable 5-connected 1-planar graphs are presented. 相似文献
100.
In this paper, we calculate the number of spanning trees in prism and antiprism graphs corresponding to the skeleton of a prism and an antiprism. By the electrically equivalent transformations and rules of weighted generating function, we obtain a relationship for the weighted number of spanning trees at the successive two generations. Using the knowledge of difference equations, we derive the analytical expressions for enumeration of spanning trees. In addition, we again calculate the number of spanning trees in Apollonian networks, which shows that this method is simple and effective. Finally we compare the entropy of our networks with other studied networks and find that the entropy of the antiprism graph is larger. 相似文献