全文获取类型
收费全文 | 3003篇 |
免费 | 302篇 |
国内免费 | 115篇 |
专业分类
化学 | 174篇 |
力学 | 38篇 |
综合类 | 80篇 |
数学 | 2799篇 |
物理学 | 329篇 |
出版年
2024年 | 3篇 |
2023年 | 20篇 |
2022年 | 108篇 |
2021年 | 107篇 |
2020年 | 83篇 |
2019年 | 90篇 |
2018年 | 78篇 |
2017年 | 90篇 |
2016年 | 100篇 |
2015年 | 78篇 |
2014年 | 179篇 |
2013年 | 208篇 |
2012年 | 142篇 |
2011年 | 144篇 |
2010年 | 158篇 |
2009年 | 195篇 |
2008年 | 180篇 |
2007年 | 217篇 |
2006年 | 160篇 |
2005年 | 104篇 |
2004年 | 110篇 |
2003年 | 104篇 |
2002年 | 90篇 |
2001年 | 91篇 |
2000年 | 65篇 |
1999年 | 57篇 |
1998年 | 56篇 |
1997年 | 34篇 |
1996年 | 54篇 |
1995年 | 36篇 |
1994年 | 38篇 |
1993年 | 13篇 |
1992年 | 17篇 |
1991年 | 23篇 |
1990年 | 12篇 |
1989年 | 13篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 15篇 |
1985年 | 27篇 |
1984年 | 23篇 |
1983年 | 6篇 |
1982年 | 19篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1957年 | 1篇 |
排序方式: 共有3420条查询结果,搜索用时 31 毫秒
71.
72.
Asiswellknown,thetheoryfornonlinearpolymerizationswasinitiatedbyFloryandStockmayer[1—3].MillerandMacosko[4—6]proposedarecursivemethodfordealingwiththeproblemofthepostgelpropertiesofthenetworkformingpolymerization.Stepto[7]investigatedthegelgelreactionofRAft… 相似文献
73.
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. 相似文献
74.
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) 相似文献
75.
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.相似文献
76.
77.
近年来世界各地频发灾情疫情等紧急事件,严重影响人民的生活物资保障。在这种情况下,急需建立应急物资中心来缓解燃眉之急。该类问题通常面临资源稀缺并且时间相对紧迫的处境,因此需要在短时间内获得合理的应急设施选址方案来提升服务的质量和效率。本文对应急物资中心选址问题展开研究,提出一种考虑后续运输成本以及有概率发生紧急事件而导致无法正常运送物资的双目标离散选址模型,并为此设计一种二进制多目标蝗虫优化算法。该算法采用模糊关联熵系数来引导迭代更新,同时为其添加外部档案,最优解选择机制和竞争决策机制来提升算法性能。多次数值实验表明该算法的计算效率和求解质量较高,可作为应急物资中心选址问题的一种可行且有效的算法。 相似文献
78.
Kenneth W. Mihavics Aris M. Ouksel 《Computational & Mathematical Organization Theory》1996,1(2):143-155
The relationship between organizational learning and organizational design is explored. In particular, we examine the information processing aspects of organizational learning as they apply to a two-valued decision making task and the relation of such aspects to organizational structure. Our primary contribution is to extend Carley's (1992) model of this process. The original model assumes that all data input into the decision making processes are of equal importance or weight in determining the correct overall organizational decision. The extension described here allows for the more natural situation of non-uniform weights of evidence. Further extensions to the model are also discussed. Such organizational learning performance measures provide an interesting framework for analyzing the recent trend towards flatter organizational structures. This research suggests that flatter structures are not always better, but rather that data environment, ultimate performance goals, and relative need for speed in learning can be used to form a contingency model for choosing organizational structure. 相似文献
79.
Consider anM/M/1 queueing system with server vacations where the server is turned off as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random variables with exponential distribution. At the end of a vacation period, the server may either be turned on if the queue is non empty or take another vacation. The following costs are incurred: a holding cost ofh per unit of time and per customer in the system and a fixed cost of each time the server is turned on. We show that there exists a threshold policy that minimizes the long-run average cost criterion. The approach we use was first proposed in Blanc et al. (1990) and enables us to determine explicitly the optimal threshold and the optimal long-run average cost in terms of the model parameters. 相似文献
80.
Oleg V. Belegradek 《Proceedings of the American Mathematical Society》1996,124(2):623-625
We show that for any arithmetical -degree there is a first order decision problem such that has -degree for the free 2-step nilpotent group of rank 2. This implies a conjecture of Sacerdote.