全文获取类型
收费全文 | 1409篇 |
免费 | 103篇 |
国内免费 | 91篇 |
专业分类
化学 | 146篇 |
力学 | 24篇 |
综合类 | 48篇 |
数学 | 1162篇 |
物理学 | 223篇 |
出版年
2024年 | 3篇 |
2023年 | 15篇 |
2022年 | 47篇 |
2021年 | 32篇 |
2020年 | 41篇 |
2019年 | 48篇 |
2018年 | 38篇 |
2017年 | 48篇 |
2016年 | 46篇 |
2015年 | 36篇 |
2014年 | 61篇 |
2013年 | 116篇 |
2012年 | 49篇 |
2011年 | 68篇 |
2010年 | 85篇 |
2009年 | 86篇 |
2008年 | 112篇 |
2007年 | 102篇 |
2006年 | 89篇 |
2005年 | 45篇 |
2004年 | 57篇 |
2003年 | 56篇 |
2002年 | 44篇 |
2001年 | 44篇 |
2000年 | 36篇 |
1999年 | 32篇 |
1998年 | 34篇 |
1997年 | 15篇 |
1996年 | 22篇 |
1995年 | 14篇 |
1994年 | 13篇 |
1993年 | 7篇 |
1992年 | 5篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1603条查询结果,搜索用时 15 毫秒
31.
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. 相似文献
32.
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) 相似文献
33.
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.相似文献
34.
35.
Arie Tamir 《Mathematical Programming》1993,62(1-3):475-496
In the classicalp-center location model on a network there is a set of customers, and the primary objective is to selectp service centers that will minimize the maximum distance of a customer to a closest center. Suppose that thep centers receive their supplies from an existing central depot on the network, e.g. a warehouse. Thus, a secondary objective is to locate the centers that optimize the primary objective as close as possible to the central depot. We consider tree networks and twop-center models. We show that the set of optimal solutions to the primary objective has a semilattice structure with respect to some natural ordering. Using this property we prove that there is ap-center solution to the primary objective that simultaneously minimizes every secondary objective function which is monotone nondecreasing in the distances of thep centers from the existing central depot.Restricting the location models to a rooted path network (real line) we prove that the above results hold for the respective classicalp-median problems as well. 相似文献
36.
Weiping Wang Bo Liao Tianming Wang Wen Zhu 《International journal of quantum chemistry》2006,106(9):1998-2005
A 3D graphical representation of DNA sequences, which has no circuit or degeneracy, is derived for mathematical denotation of DNA sequence. Based on this graphical representation, we propose a new sequence distance measure. We make use of the corresponding similarity matrix to construct a phylogenic tree by virtue of the fuzzy theory. The examination of phylogenic tree belong to eight species illustrates the utility of our approach. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2006 相似文献
37.
Yushuang Li Yufang Qin Xiaoqi Zheng Yu Zhang 《International journal of quantum chemistry》2012,112(10):2330-2335
A new three‐dimensional graphical representation of DNA sequences, three‐unit semicircles (TUS)‐curve, which maps a given sequence into a dot sequences embedded in three‐unit semicircles, is proposed based on three biclassifications of nucleotides. TUS‐curve has the merit of compactness and could avoid the degeneracy and loss of information. The geometrical center of the curve, which indicates the distribution of base frequencies of the corresponding DNA sequence, is extracted and applied to analyze the similarity of various species. Phylogenetic tree of 11 species based on their first exons of β‐globin genes showed that the TUS‐curve is a powerful tool to get valuable biological information. © 2011 Wiley Periodicals, Inc. Int J Quantum Chem, 2011 相似文献
38.
Lan Lei Xianya Geng Shuchao Li Yingjun Peng Yuantian Yu 《International journal of quantum chemistry》2019,119(24):e26044
Let denote a molecular graph of linear [n] phenylene with n hexagons and n squares, and let the Möbius phenylene chain be the graph obtained from the by identifying the opposite lateral edges in reversed way. Utilizing the decomposition theorem of the normalized Laplacian characteristic polynomial, we study the normalized Laplacian spectrum of , which consists of the eigenvalues of two symmetric matrices ℒ R and ℒ Q of order 3n. By investigating the relationship between the roots and coefficients of the characteristic polynomials of the two matrices above, we obtain an explicit closed-form formula of the multiplicative degree-Kirchhoff index as well as the number of spanning trees of . Furthermore, we determine the limited value for the quotient of the multiplicative degree-Kirchhoff index and the Gutman index of . 相似文献
39.
This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in and , the families of all trees and caterpillars, respectively, of order . We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if is an optimal tree in or for , then every leaf of is adjacent to a vertex of degree at least . We also use the Gluing Lemma to answer an open question of Jamison and to provide a conceptually simple proof of Jamison's result that the path has minimum mean subtree order among all trees of order . We prove that if is optimal in , then the number of leaves in is and that if is optimal in , then the number of leaves in is . Along the way, we describe the asymptotic structure of optimal trees in several narrower families of trees. 相似文献
40.
Let E?R be an interval. By studying an admissible family of branching mechanisms{ψt,t ∈E} introduced in Li [Ann. Probab., 42, 41-79(2014)], we construct a decreasing Levy-CRT-valued process {Tt, t ∈ E} by pruning Lévy trees accordingly such that for each t ∈E, Tt is a ψt-Lévy tree. We also obtain an analogous process {Tt*,t ∈E} by pruning a critical Levy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of {Tt,t ∈E} at the ascension time A := inf{t ∈E;Tt is finite} can be represented by{Tt*,t∈E}.The results generalize those studied in Abraham and Delmas [Ann. Probab., 40, 1167-1211(2012)]. 相似文献