全文获取类型
收费全文 | 574篇 |
免费 | 1篇 |
国内免费 | 2篇 |
专业分类
化学 | 129篇 |
晶体学 | 3篇 |
力学 | 23篇 |
数学 | 207篇 |
物理学 | 215篇 |
出版年
2019年 | 5篇 |
2018年 | 3篇 |
2016年 | 6篇 |
2014年 | 3篇 |
2013年 | 38篇 |
2012年 | 7篇 |
2011年 | 15篇 |
2010年 | 10篇 |
2009年 | 42篇 |
2008年 | 24篇 |
2007年 | 25篇 |
2006年 | 17篇 |
2005年 | 12篇 |
2004年 | 13篇 |
2003年 | 14篇 |
2002年 | 13篇 |
2001年 | 10篇 |
2000年 | 7篇 |
1997年 | 11篇 |
1996年 | 7篇 |
1995年 | 10篇 |
1994年 | 11篇 |
1993年 | 4篇 |
1992年 | 13篇 |
1991年 | 14篇 |
1990年 | 15篇 |
1989年 | 14篇 |
1988年 | 18篇 |
1987年 | 11篇 |
1986年 | 10篇 |
1985年 | 16篇 |
1984年 | 13篇 |
1983年 | 12篇 |
1982年 | 10篇 |
1981年 | 18篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 14篇 |
1977年 | 12篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 10篇 |
1971年 | 4篇 |
1970年 | 2篇 |
1969年 | 4篇 |
1968年 | 2篇 |
1967年 | 3篇 |
1966年 | 2篇 |
排序方式: 共有577条查询结果,搜索用时 468 毫秒
1.
We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported. 相似文献
2.
If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time. 相似文献
3.
We study a leader follower game with two players: a terrorist and a state where the later one installs facilities that provide support in case of a terrorist attack. While the Terrorist attacks one of the metropolitan areas to maximize his utility, the State, which acts as a leader, installs the facilities such that the metropolitan area attacked is the one that minimizes her disutility (i.e., minimizes ‘loss’). We solve the problem efficiently for one facility and we formulate it as a mathematical programming problem for a general number of facilities. We demonstrate the problem via a case study of the 20 largest metropolitan areas in the United States. 相似文献
4.
Marcelo Samuel Berman 《International Journal of Theoretical Physics》1992,31(8):1447-1450
Dirac's large number hypothesis (LNH) and the Whitrow-Randall-Sciama relation are related to some cosmological models. The LNH and Whitrow-Randall-Sciama relations are neither equivalent nor consistent in general relativity, but they may both be valid in the Brans-Dicke theory and in another theory considered in this paper. 相似文献
5.
NIKITIN S.; PR?TZEL-WOLTERS D. 《IMA Journal of Mathematical Control and Information》1991,8(4):431-439
In 1983 Morse proved, for unknown scalar one-dimensional linearsystems, the nonexistence of rational or polynomial universalstabilizers (UAS). In 1983, Nussbaum gave an example of an analyticUAS. In our paper, it is shown that there exist time-invariantpolynomial UAS's with multidimensional gain adaptation. Thedesign procedure is developed for linear, minimum-phase systemsof relative degree one. Convergence of the closed-loop systemis proved. Some numerical simulations are provided. 相似文献
6.
O Berman 《The Journal of the Operational Research Society》2007,58(10):1396-1396
7.
By means of exponential laws we show a Bianchi Type I model of the universe where we define overall deceleration and Hubble's parameters that have constant values. We employ a convenient relation for defining the radius of the universe. Pressure and density have constant values, too. 相似文献
8.
9.
We say that a graphG ishomomorphic to a graphH if there is a mappingp from the vertices of G onto the vertices ofH such thatp(u) andp() are adjacent inH wheneveru and are adjacent in G. Thehomomorphism polynomial of a graphG is a polynomial in two variables that counts the number of homomorphisms ofG onto the complete graph of each order. This polynomial can be computed recursively in an analog to the chromatic polynomial. In this paper, we present some results regarding the homomorphism polynomials of the graphs of chemical compounds — in particular, alkane isomers. The coefficients of the homomorphism polynomial can be used to predict the rankings of compounds with respect to several chemical properties. Our results seem to refine those obtained by Randi et al. from path lengths. 相似文献
10.
J. C. Y. Le Blanc D. Beuchemin K. W. M. Siu R. Guevremont S. S. Berman 《Journal of mass spectrometry : JMS》1991,26(10):831-839
The effects of beat on the electrospray mass spectra of eight globular proteins in solution were studied. These ranged from hardly noticeable to a dramatic shift in the mass spectrometric profile and a concomitant increase in ion abundance. This change is believed to be the result of thermal denaturation of the protein species in solution resulting in a transition from a more compact to a less compact conformation. We accounted for this transition by means of a recently proposed model based on aqueous solution acid/base equilibria. For cytochrome c, profiles calculated by means of this model agree well with experimental data. The ΔH of the denaturation reaction of cytochrome c in aqueous solution containing 0.2% acetic acid was calculated from experimental data to be 103.8 ± 9.2 kJ mol?1, in good agreement with previous measurements. 相似文献