全文获取类型
收费全文 | 3808篇 |
免费 | 501篇 |
国内免费 | 121篇 |
专业分类
化学 | 480篇 |
晶体学 | 4篇 |
力学 | 208篇 |
综合类 | 76篇 |
数学 | 1230篇 |
物理学 | 1051篇 |
无线电 | 1381篇 |
出版年
2025年 | 13篇 |
2024年 | 54篇 |
2023年 | 54篇 |
2022年 | 111篇 |
2021年 | 93篇 |
2020年 | 128篇 |
2019年 | 123篇 |
2018年 | 103篇 |
2017年 | 122篇 |
2016年 | 136篇 |
2015年 | 135篇 |
2014年 | 213篇 |
2013年 | 281篇 |
2012年 | 223篇 |
2011年 | 222篇 |
2010年 | 208篇 |
2009年 | 216篇 |
2008年 | 254篇 |
2007年 | 250篇 |
2006年 | 227篇 |
2005年 | 159篇 |
2004年 | 166篇 |
2003年 | 140篇 |
2002年 | 111篇 |
2001年 | 107篇 |
2000年 | 81篇 |
1999年 | 74篇 |
1998年 | 70篇 |
1997年 | 48篇 |
1996年 | 52篇 |
1995年 | 32篇 |
1994年 | 38篇 |
1993年 | 24篇 |
1992年 | 22篇 |
1991年 | 17篇 |
1990年 | 17篇 |
1989年 | 15篇 |
1988年 | 4篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 9篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1974年 | 3篇 |
排序方式: 共有4430条查询结果,搜索用时 15 毫秒
71.
C. R. Sarma Dipan K. Ghosh C. Y. Kadolkar 《International journal of quantum chemistry》1999,73(5):389-393
We present a graphical technique for generating and indexing spin monomials of high‐spin systems. The procedure consists of developing a graph with at most n line segments from each node in a given row to the one immediately lower, where n is the multiplicity of single‐particle spin function. The paths lead to monomials with definite M values at each node. This technique has been used to generate and diagonalize the model spin Hamiltonian. ©1999 John Wiley & Sons, Inc. Int J Quant Chem 73: 389–393, 1999 相似文献
72.
We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farchi and Newman considered a special case where the partial order has the maximum element and the Hasse diagram is a tree (tree-like posets) and they gave an O(n4log3n)-time algorithm for finding an optimal search strategy for such a partial order. We show that this problem is equivalent to finding edge ranking of a simple tree corresponding to the Hasse diagram, which implies the existence of a linear-time algorithm for this problem.Then we study a more general problem, namely searching in any partial order with maximum element. We prove that such a generalization is hard, and we give an -approximate polynomial-time algorithm for this problem. 相似文献
73.
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. 相似文献
74.
§1. Preliminary Lemma Using A to denote the cardinal number of a finite set A, we do not explain anymore what are similar to A in this paper. For a given tree T(V,E), if there is a labeling f of its vertices, which satisfiesf[V(T)]={f(u)u∈V(T)}={0,1,2,…,E(T)},lf[E(T)]={lf(uv)=f(u)-f(v), uv∈E(T)}={1,2,…,E(T)},then f is called a graceful labeling of T, and T is called a graceful tree. lf denotes the labeling of edges that is derived from f. In the 1960s, RingedKotzing and A. R… 相似文献
75.
76.
Three-dimensional cellular automaton simulation of tumour growth in inhomogeneous oxygen environment
H. Hötzendorfer W. Estelberger F. Breitenecker 《Mathematical and Computer Modelling of Dynamical Systems: Methods, Tools and Applications in Engineering and Related Sciences》2013,19(2):177-189
Cellular automaton theory has previously been used to study cell growth. In this study, we present a three-dimensional cellular automaton model performing the growth simulation of normal and cancerous cells. The necessary nutrient supply is provided by an artificial arterial tree which is generated by constrained constructive optimization. Spatial oxygen diffusion is approximated again by a cellular automaton model. All results could be illustrated dynamically by three-dimensional volume visualization. Because of the chosen modelling approach, an extension of the model to simulate angiogenic processes is possible. 相似文献
77.
78.
Ping-Feng Xu Jianhua Guo Man-Lai Tang 《Journal of computational and graphical statistics》2013,22(1):205-229
In this article, we propose localized implementations of the iterative proportional scaling (IPS) procedure by the strategy of partitioning cliques for computing maximum likelihood estimations in large Gaussian graphical models. We first divide the set of cliques into several nonoverlapping and nonempty blocks, and then adjust clique marginals in each block locally. Thus, high-order matrix operations can be avoided and the IPS procedure is accelerated. We modify the Swendsen–Wang Algorithm and apply the simulated annealing algorithm to find an approximation to the optimal partition which leads to the least complexity. This strategy of partitioning cliques can also speed up the existing IIPS and IHT procedures. Numerical experiments are presented to demonstrate the competitive performance of our new implementations and strategies. 相似文献
79.
80.