全文获取类型
收费全文 | 1561篇 |
免费 | 104篇 |
国内免费 | 88篇 |
专业分类
化学 | 152篇 |
力学 | 24篇 |
综合类 | 48篇 |
数学 | 1285篇 |
物理学 | 244篇 |
出版年
2024年 | 2篇 |
2023年 | 16篇 |
2022年 | 46篇 |
2021年 | 35篇 |
2020年 | 44篇 |
2019年 | 51篇 |
2018年 | 41篇 |
2017年 | 54篇 |
2016年 | 51篇 |
2015年 | 39篇 |
2014年 | 74篇 |
2013年 | 136篇 |
2012年 | 56篇 |
2011年 | 73篇 |
2010年 | 95篇 |
2009年 | 93篇 |
2008年 | 128篇 |
2007年 | 105篇 |
2006年 | 94篇 |
2005年 | 48篇 |
2004年 | 63篇 |
2003年 | 59篇 |
2002年 | 48篇 |
2001年 | 47篇 |
2000年 | 40篇 |
1999年 | 34篇 |
1998年 | 34篇 |
1997年 | 16篇 |
1996年 | 23篇 |
1995年 | 16篇 |
1994年 | 14篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 9篇 |
1990年 | 8篇 |
1989年 | 5篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 7篇 |
1983年 | 1篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1753条查询结果,搜索用时 828 毫秒
131.
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. 相似文献
132.
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. 相似文献
133.
Yuan J Madore B Panych LP 《Journal of magnetic resonance (San Diego, Calif. : 1997)》2011,208(2):219-224
Fat suppression is important but challenging in balanced steady-state free precession (bSSFP) acquisitions, for a number of clinical applications. In the present work, the practicality of performing fat-water selective excitations using spatial-spectral (SPSP) RF pulses in bSSFP sequence is examined. With careful pulse design, the overall duration of these SPSP pulses was kept short to minimize detrimental effects on TR, scan time and banding artifact content. Fat-water selective excitation using SPSP pulses was demonstrated in both phantom and human bSSFP imaging at 3T, and compared to results obtained using a two-point Dixon method. The sequence with SPSP pulses performed better than the two-point Dixon method, in terms of scan time and suppression performance. Overall, it is concluded here that SPSP RF pulses do represent a viable option for fat-suppressed bSSFP imaging. 相似文献
134.
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. 相似文献
135.
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. 相似文献
136.
The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. This paper is the first one to discuss applications of the MBSP arising in three different research areas: the detection of embedded structures, portfolio analysis in risk management and community structure. The efficient solution of the MBSP is also in the focus of this paper. We discuss pre-processing routines and heuristic solution approaches to the problem. a GRASP metaheuristic is developed and improved versions of a greedy heuristic are discussed. Extensive computational experiments are carried out on a set of instances from the applications previously mentioned as well as on a set of random instances. 相似文献
137.
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the agents using the general service, the value of a coalition is defined as the maximum net revenues that the coalition may obtain by means of cooperation. As a result, a coalition may profit from not allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost-revenue games. Under the assumption that cooperation among the members of the grand coalition grants the use of the service under consideration to all its members, it is shown that a cost-revenue game has a nonempty core for any vector of revenues if, and only if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games with revenues. We show that if every connection cost can take only two values (low or high cost), then, the corresponding minimum cost spanning tree game with revenues has a nonempty core. Furthermore, we provide an example of a minimum cost spanning tree game with revenues with an empty core where every connection cost can take only one of three values (low, medium, or high cost). 相似文献
138.
We show that the equality m1(f(x))=m2(g(x)) for x in a neighborhood of a point a remains valid for all x provided that f and g are open holomorphic maps, f(a)=g(a)=0 and m1,m2 are Minkowski functionals of bounded balanced domains. Moreover, a polynomial relation between f and g is obtained. 相似文献
139.
140.
The edit distance problem for rooted unordered trees is known to be NP-hard. Based on this fact, this paper studies exponential-time algorithms for the problem. For a general case, an time algorithm is presented, where and are the numbers of nodes and and are the numbers of branching nodes in two input trees. This algorithm is obtained by a combination of dynamic programming, exhaustive search, and maximum weighted bipartite matching. For bounded degree trees over a fixed alphabet, it is shown that the problem can be solved in time for any fixed . This result is achieved by avoiding duplicate calculations for identical subsets of small subtrees. 相似文献