全文获取类型
收费全文 | 1798篇 |
免费 | 125篇 |
国内免费 | 58篇 |
专业分类
化学 | 257篇 |
晶体学 | 2篇 |
力学 | 51篇 |
综合类 | 36篇 |
数学 | 1407篇 |
物理学 | 228篇 |
出版年
2023年 | 8篇 |
2022年 | 31篇 |
2021年 | 44篇 |
2020年 | 29篇 |
2019年 | 23篇 |
2018年 | 34篇 |
2017年 | 40篇 |
2016年 | 50篇 |
2015年 | 38篇 |
2014年 | 76篇 |
2013年 | 107篇 |
2012年 | 93篇 |
2011年 | 98篇 |
2010年 | 92篇 |
2009年 | 117篇 |
2008年 | 150篇 |
2007年 | 139篇 |
2006年 | 87篇 |
2005年 | 91篇 |
2004年 | 88篇 |
2003年 | 58篇 |
2002年 | 56篇 |
2001年 | 58篇 |
2000年 | 63篇 |
1999年 | 54篇 |
1998年 | 39篇 |
1997年 | 36篇 |
1996年 | 35篇 |
1995年 | 25篇 |
1994年 | 16篇 |
1993年 | 18篇 |
1992年 | 13篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有1981条查询结果,搜索用时 717 毫秒
61.
In this paper we construct a first solution of the stochastic realization problem in a nonlinear setting. The great bulk of previous work on stochastic realization has been in the linear Gaussian setting. Such Markovian representations are used e.g., to apply certain filtering and stochastic control techniques. Our methods consist of an amalgamation of methods introduced by Nelson with the Lax-Phillips type geometric approach to linear Gaussian stochastic realization which has been developed by Lindquist and Picci and by Ruckebusch. The result of this that we are able to realize any purely nondeterministic process satisfying suitable continuity conditions as an instantaneous function of a Markov process. 相似文献
62.
63.
64.
首先,以拟开通的大连港至鹿特丹港北海航道班轮航线为研究对象,以油耗和运营成本最小化为优化目标,将官方已有记载的北海航道通过的货船航速数据输入Eureqa软件,得到航行最高速度f(x)与进入北海航道时间t的拟合度最好的函数公式.在此基础上,构建了北海航道班轮运输排班的数学模型;其次,在仿真实例分析中,选用了5000TEU的集装箱船作为计算参数,将捕食搜索算法运用到数学模型求解之中,并且运用MATLAB软件进行求解,在最快航速受限的前提下,得到单艘班轮最佳往返时间和相同型号班轮的最低配置数目以及在服务周期内班轮公司所要付出的最低运营成本;最后,通过比较研究,得出结论是:最快航速的提高,对于降低北海航线班轮运输的运营成本将起较大作用. 相似文献
65.
Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle . 相似文献
66.
67.
针对若干远海岛礁群系统封闭性的分布特点,将中心岛礁选址、各岛礁建设泊位数量和规模、仓库储存量、运输船型和数量以及航线设置、班期组织等作为规划内容,以整个运输网络系统总成本最低为原则,综合考虑了仓库存储理论,建立了兼顾“选址-库存-路径”的规划模型。结合所建模型特点,提出了双层并行搜索遗传算法,构建了以海上运输为基本交通方式的双向物流系统。最后,以我国南海为例进行建模并求解,采用不同算法并通过多组不同规模的算例进行演算比较,验证了所建模型和算法的有效性与合理性。 相似文献
68.
69.
《Optimization》2012,61(3):329-330
We explore how randomization can help asymptotic convergence properties of simple directional search-based optimization methods. Specifically, we develop a cheap, iterative randomized Hessian estimation scheme. We then apply this technique and analyse how it enhances a random directional search method. Then, we proceed to develop a conjugate-directional search method that incorporates estimated Hessian information without requiring the direct use of gradients. 相似文献
70.
Herbert Oberacher Graeme Whitley Bernd Berger Wolfgang Weinmann 《Journal of mass spectrometry : JMS》2013,48(4):497-504
A tandem mass spectral database system consists of a library of reference spectra and a search program. State‐of‐the‐art search programs show a high tolerance for variability in compound‐specific fragmentation patterns produced by collision‐induced decomposition and enable sensitive and specific ‘identity search’. In this communication, performance characteristics of two search algorithms combined with the ‘Wiley Registry of Tandem Mass Spectral Data, MSforID’ (Wiley Registry MSMS, John Wiley and Sons, Hoboken, NJ, USA) were evaluated. The search algorithms tested were the MSMS search algorithm implemented in the NIST MS Search program 2.0g (NIST, Gaithersburg, MD, USA) and the MSforID algorithm (John Wiley and Sons, Hoboken, NJ, USA). Sample spectra were acquired on different instruments and, thus, covered a broad range of possible experimental conditions or were generated in silico. For each algorithm, more than 30 000 matches were performed. Statistical evaluation of the library search results revealed that principally both search algorithms can be combined with the Wiley Registry MSMS to create a reliable identification tool. It appears, however, that a higher degree of spectral similarity is necessary to obtain a correct match with the NIST MS Search program. This characteristic of the NIST MS Search program has a positive effect on specificity as it helps to avoid false positive matches (type I errors), but reduces sensitivity. Thus, particularly with sample spectra acquired on instruments differing in their setup from tandem‐in‐space type fragmentation, a comparably higher number of false negative matches (type II errors) were observed by searching the Wiley Registry MSMS. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献