全文获取类型
收费全文 | 1423篇 |
免费 | 104篇 |
国内免费 | 91篇 |
专业分类
化学 | 146篇 |
力学 | 24篇 |
综合类 | 48篇 |
数学 | 1177篇 |
物理学 | 223篇 |
出版年
2024年 | 3篇 |
2023年 | 16篇 |
2022年 | 47篇 |
2021年 | 31篇 |
2020年 | 40篇 |
2019年 | 47篇 |
2018年 | 38篇 |
2017年 | 48篇 |
2016年 | 47篇 |
2015年 | 36篇 |
2014年 | 62篇 |
2013年 | 116篇 |
2012年 | 50篇 |
2011年 | 69篇 |
2010年 | 83篇 |
2009年 | 85篇 |
2008年 | 113篇 |
2007年 | 102篇 |
2006年 | 93篇 |
2005年 | 46篇 |
2004年 | 57篇 |
2003年 | 56篇 |
2002年 | 44篇 |
2001年 | 44篇 |
2000年 | 37篇 |
1999年 | 32篇 |
1998年 | 34篇 |
1997年 | 15篇 |
1996年 | 22篇 |
1995年 | 14篇 |
1994年 | 13篇 |
1993年 | 7篇 |
1992年 | 5篇 |
1991年 | 9篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1618条查询结果,搜索用时 15 毫秒
101.
David A. Croydon 《Probability Theory and Related Fields》2008,140(1-2):207-238
In this article, we prove global and local (point-wise) volume and heat kernel bounds for the continuum random tree. We demonstrate
that there are almost–surely logarithmic global fluctuations and log–logarithmic local fluctuations in the volume of balls
of radius r about the leading order polynomial term as r → 0. We also show that the on-diagonal part of the heat kernel exhibits corresponding global and local fluctuations as t → 0 almost–surely. Finally, we prove that this quenched (almost–sure) behaviour contrasts with the local annealed (averaged
over all realisations of the tree) volume and heat kernel behaviour, which is smooth.
相似文献
102.
Chandra Sekhar Pedamallu Linet Özdamar Tibor Csendes Tamás Vinkó 《Journal of Global Optimization》2008,42(3):369-384
A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves
a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals
in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also
used for activating local search to identify feasible stationary points. The new tree search management technique results
in improved performance across standard solution and computational indicators when compared to previously proposed techniques.
On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than
existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search
space. 相似文献
103.
Let G =(V,E) be a graph without isolated vertices.A set S V is a domination set of G if every vertex in V -S is adjacent to a vertex in S,that is N[S] = V .The domination number of G,denoted by γ(G),is the minimum cardinality of a domination set of G.A set S V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S]has a perfect matching.The paired-domination number,denoted by γpr(G),is defined to be the minimum cardinality of a paired-domination set S in G.A subset S V is a power domination set of G if all vertices of V can be observed recursively by the following rules:(i) all vertices in N[S] are observed initially,and(ii) if an observed vertex u has all neighbors observed except one neighbor v,then v is observed(by u).The power domination number,denoted by γp(G),is the minimum cardinality of a power domination set of G.In this paper,the constructive characterizations for trees with γp = γ and γpr = γp are provided respectively. 相似文献
104.
105.
O. Maimon 《Annals of Operations Research》1986,6(5):147-160
Classical location theories and models were initially developed for the private sector, so that the related operational research literature has emphasized performance measures of efficiency and effectiveness. For public sector applications, measures of equity become important, yet such measures have received little formal treatment. This paper suggests a locational equity measure, the variance measure, and investigates its properties for tree networks. A fast algorithm (O(M)) to locate the minimum variance point on a tree network is developed, and some numerical results illustrate the variance optimal location.This work is dedicated to the memory of Professor Jonathan Halpern 相似文献
106.
Zbigniew R. Bogdanowicz 《Discrete Mathematics》2009,309(10):3074-3082
We show that for positive integers n, m with n(n−1)/2≥m≥n−1, the graph Ln,m having n vertices and m edges that consists of an (n−k)-clique and k−1 vertices of degree 1 has the fewest spanning trees among all connected graphs on n vertices and m edges. This proves Boesch’s conjecture [F.T. Boesch, A. Satyanarayana, C.L. Suffel, Least reliable networks and reliability domination, IEEE Trans. Commun. 38 (1990) 2004-2009]. 相似文献
107.
Path Decomposition of Graphs with Given Path Length 总被引:3,自引:0,他引:3
Ming-qing Zhai~ 《应用数学学报(英文版)》2006,22(4):633-638
A path decomposition of a graph G is a list of paths such that each edge appears in exactly onepath in the list.G is said to admit a {P_l}-decomposition if G can be decomposed into some copies of P_l,whereP_l is a path of length l-1.Similarly,G is said to admit a {P_l,P_k}=decomposition if G can be decomposed intosome copies of P_l or P_k.An k-cycle,denoted by C_k,is a cycle with k vertices.An odd tree is a tree of which allvertices have odd degree.In this paper,it is shown that a connected graph G admits a {P_3,P_4}-decompositionif and only if G is neither a 3-cycle nor an odd tree.This result includes the related result of Yan,Xu andMutu.Moreover,two polynomial algorithms are given to find {P_3}-decomposition and {P_3,P_4}-decompositionof graphs,respectively.Hence,{P_3}-decomposition problem and {P_3,P_4}-decomposition problem of graphs aresolved completely. 相似文献
108.
C. Baiocchi G. Saini P. L. Bertolo C. Carpenito E. Marengo D. Giacosa 《Chromatographia》1990,29(7-8):355-362
Summary The RP-HPLC technique has been applied to the analysis of the flavonoid content of leaf extracts from various genotypes ofPopulus nigra andPopulus deltoides and from several of their hybrids. Two elution procedures different either as regards gradient program or the type of organic modifier used were checked to optimize the reliability of the results obtained. Before making any identification, the chromatographic profiles proved so typical of each species as to allow of their use as fingerprints in this type of taxonomic problem. Individual identifications were carried out by spiking real samples with known amounts of standard substances. The presence of flavonoid compounds previously identified was confirmed and a few new identifications were proposed. 相似文献
109.
We study the cross-correlations of buy and sell volumes on the Korean stock market in high frequency. We observe that the pulling effects of volumes are as small as that of returns. The properties of the correlations of buy and sell volumes differ. They are explained by the degree of synchronization of stock volumes. Further, the pulling effects on the minimal spanning tree are studied. In minimal spanning trees with directed links, the large pulling effects are clustered at the center, not uniformly distributed. The Epps effect of buy and sell volumes are observed. The reversal of the cross-correlations of buy and sell volumes is also detected. 相似文献
110.
Eduardo lvarez-Miranda Alfredo Candia-Vjar Xu-jin CHEN Xiao-dong HU Bi LI 《应用数学学报(英文版)》2014,30(1):1-26
Given a connected graph G=(V,E)with a nonnegative cost on each edge in E,a nonnegative prize at each vertex in V,and a target set V′V,the Prize Collecting Steiner Tree(PCST)problem is to find a tree T in G interconnecting all vertices of V′such that the total cost on edges in T minus the total prize at vertices in T is minimized.The PCST problem appears frequently in practice of operations research.While the problem is NP-hard in general,it is polynomial-time solvable when graphs G are restricted to series-parallel graphs.In this paper,we study the PCST problem with interval costs and prizes,where edge e could be included in T by paying cost xe∈[c e,c+e]while taking risk(c+e xe)/(c+e c e)of malfunction at e,and vertex v could be asked for giving a prize yv∈[p v,p+v]for its inclusion in T while taking risk(yv p v)/(p+v p v)of refusal by v.We establish two risk models for the PCST problem with interval data.Under given budget upper bound on constructing tree T,one model aims at minimizing the maximum risk over edges and vertices in T and the other aims at minimizing the sum of risks over edges and vertices in T.We propose strongly polynomial-time algorithms solving these problems on series-parallel graphs to optimality.Our study shows that the risk models proposed have advantages over the existing robust optimization model,which often yields NP-hard problems even if the original optimization problems are polynomial-time solvable. 相似文献