全文获取类型
收费全文 | 1560篇 |
免费 | 104篇 |
国内免费 | 88篇 |
专业分类
化学 | 152篇 |
力学 | 24篇 |
综合类 | 48篇 |
数学 | 1285篇 |
物理学 | 243篇 |
出版年
2024年 | 2篇 |
2023年 | 16篇 |
2022年 | 45篇 |
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篇 |
排序方式: 共有1752条查询结果,搜索用时 593 毫秒
31.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
32.
M. Brazil 《Discrete Applied Mathematics》2006,154(18):2545-2564
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. 相似文献
33.
STRONG LAW OF LARGE NUMBERS AND ASYMPTOTIC EQUIPARTITION PROPERTY FOR NONSYMMETRIC MARKOV CHAIN FIELDS ON CAYLEY TREES 总被引:1,自引:0,他引:1
Some strong laws of large numbers for the frequcncies of occurrence of states and ordered couples of states for nonsymmetric Markov chain fields(NSMC)on Cayley trees are studied.In the proof,a new technique for the study of strong liinit theorems of Markov chains is extended to the case of Markov chain fields.The asymptotic equiparti- tion properties with almost everywhere(a.e.)convergence for NSMC on Cayley trees are obtained. 相似文献
34.
The authors consider the limiting behavior of various branches in a uniform recursive tree with size growing to infinity.The limiting distribution ofζ_(n,m),the number of branches with size m in a uniform recursive tree of order n,converges weakly to a Poisson distribution with parameter 1/m with convergence of all moments.The size of any large branch tends to infinity almost surely. 相似文献
35.
Asiswellknown,thetheoryfornonlinearpolymerizationswasinitiatedbyFloryandStockmayer[1—3].MillerandMacosko[4—6]proposedarecursivemethodfordealingwiththeproblemofthepostgelpropertiesofthenetworkformingpolymerization.Stepto[7]investigatedthegelgelreactionofRAft… 相似文献
36.
The lattice model for equilibrium polymerization in a solvent proposed by Wheeler and Pfeuty is solved exactly on a Bethe lattice (core of a Caylay tree) with general coordination numberq. Earlier mean-field results are reobtained in the limitq, but the phase diagrams show deviations from them for finiteq. Whenq=2, our results turn into the solution of the one-dimensional problem. Although the model is solved directly, without the use of the correspondence between the equilibrium polymerization model and the diluten0 model, we verified that the latter model may also be solved on the Bethe lattice, its solution being identical to the direct solution in all parameter space. As observed in earlier studies of the puren0 vector model, the free energy is not always convex. We obtain the region of negative susceptibility for our solution and compare this result with mean field and renormalization group (-expansion) calculations. 相似文献
37.
The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))−1/2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. We give a sharp lower bound on the Randić index of conjugated trees (trees with a perfect matching) in terms of the number
of vertices. A sharp lower bound on the Randić index of trees with a given size of matching is also given
Mei Lu: Partially supported by NNSFC (No. 60172005)
Lian-zhu Zhang: Partially supported by NNSFC (No. 10271105)
Feng Tian: Partially supported by NNSFC (No. 10431020) 相似文献
38.
Fast folding and comparison of RNA secondary structures 总被引:40,自引:0,他引:40
I. L. Hofacker W. Fontana P. F. Stadler L. S. Bonhoeffer M. Tacker P. Schuster 《Monatshefte für Chemie / Chemical Monthly》1994,125(2):167-188
Summary Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and base pairing probabilities.An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment.All computer codes are written in ANSI C. They include implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.
Schnelle Faltung und Vergleich von Sekundärstrukturen von RNA
Zusammenfassung Die im Vienna RNA package enthaltenen Computer Programme für die Berechnung und den Vergleich von RNA Sekundärstrukturen werden präsentiert. Ihren Kern bilden Algorithmen zur Vorhersage von Strukturen minimaler Energie sowie zur Berechnung von Zustandssumme und Basenpaarungswahrscheinlichkeiten mittels dynamischer Programmierung.Ein effizienter heuristischer Algorithmus für das inverse Faltungsproblem wird vorgestellt. Darüberhinaus präsentieren wir kompakte und effiziente Programme zum Vergleich von RNA Sekundärstrukturen durch Baum-Editierung und Alignierung.Alle Programme sind in ANSI C geschrieben, darunter auch eine Implementation des Faltungs-algorithmus für Parallelrechner mit verteiltem Speicher. Wie Tests auf einem Intel Hypercube zeigen, wird das Parallelrechnen umso effizienter je länger die Sequenzen sind.相似文献
39.
《Discrete Mathematics》2022,345(6):112832
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance. 相似文献
40.