全文获取类型
收费全文 | 1665篇 |
免费 | 45篇 |
国内免费 | 13篇 |
专业分类
化学 | 1209篇 |
晶体学 | 7篇 |
力学 | 29篇 |
数学 | 271篇 |
物理学 | 207篇 |
出版年
2021年 | 15篇 |
2020年 | 21篇 |
2019年 | 8篇 |
2018年 | 16篇 |
2017年 | 23篇 |
2016年 | 29篇 |
2015年 | 35篇 |
2014年 | 33篇 |
2013年 | 59篇 |
2012年 | 96篇 |
2011年 | 118篇 |
2010年 | 47篇 |
2009年 | 40篇 |
2008年 | 101篇 |
2007年 | 81篇 |
2006年 | 97篇 |
2005年 | 104篇 |
2004年 | 84篇 |
2003年 | 73篇 |
2002年 | 71篇 |
2001年 | 16篇 |
2000年 | 17篇 |
1999年 | 25篇 |
1998年 | 26篇 |
1997年 | 19篇 |
1996年 | 24篇 |
1995年 | 19篇 |
1994年 | 30篇 |
1993年 | 21篇 |
1992年 | 16篇 |
1991年 | 13篇 |
1990年 | 14篇 |
1989年 | 11篇 |
1988年 | 13篇 |
1987年 | 12篇 |
1986年 | 10篇 |
1985年 | 25篇 |
1984年 | 25篇 |
1983年 | 16篇 |
1982年 | 20篇 |
1981年 | 29篇 |
1980年 | 22篇 |
1979年 | 24篇 |
1978年 | 12篇 |
1977年 | 15篇 |
1976年 | 23篇 |
1975年 | 16篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1971年 | 6篇 |
排序方式: 共有1723条查询结果,搜索用时 203 毫秒
1.
2.
We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under Lp norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p<d/(d-1) and p>d/(d-1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of a d-dimensional monotone density. 相似文献
3.
Jon Wilkening 《Linear algebra and its applications》2007,427(1):6-25
We present an efficient algorithm for obtaining a canonical system of Jordan chains for an n × n regular analytic matrix function A(λ) that is singular at the origin. For any analytic vector function b(λ), we show that each term in the Laurent expansion of A(λ)−1b(λ) may be obtained from the previous terms by solving an (n + d) × (n+d) linear system, where d is the order of the zero of det A(λ) at λ = 0. The matrix representing this linear system contains A(0) as a principal submatrix, which can be useful if A(0) is sparse. The last several iterations can be eliminated if left Jordan chains are computed in addition to right Jordan chains. The performance of the algorithm in floating point and exact (rational) arithmetic is reported for several test cases. The method is shown to be forward stable in floating point arithmetic. 相似文献
4.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
5.
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of these orders in terms of a class of generalized riffle shuffles. 相似文献
6.
Dai Lu David Rutledge Milan Kovacevic Jon Hacker 《International Journal of Infrared and Millimeter Waves》2002,23(5):693-704
This paper presents an active patch array designed at 24 GHz. It can be used as a front-end component for a phased array. A series resonant array structure is chosen which is compact and easy excite. With 5 elements, the array proved a 12-dB antenna gain. A power amplifier and a low noise amplifier are designed on a single GaAs chip (PALNA). Bias switch is used in the PALNA, which greatly reduces the switch loss in a transceiver and increases the efficiency. 20-dB small signal gain is achieved in both power amplifier and low noise amplifier. The active patch array is built by the combination of the patch array and PALNA. The measured active gain of this antenna is 35-dB for the PA mode and 31-dB for the LNA mode. This active patch array can obtain an EIRP of 34 dBm with a total radiated power of 22dBm and a maximum PAE of 32%. To check the noise performance, we applied sources at both normal temperature and 77K (liquid nitrogen) and extracted the noise figure (3.5 dB) of the active antenna by the Y factor method. The results proved that the active antenna is working efficiently as both a transmitting and receiving antenna. 相似文献
7.
Jon Baker 《Journal of computational chemistry》1992,13(2):240-253
An efficient algorithm for constrained geometry optimization in Cartesian coordinates is presented. It incorporates mode-following techniques within both the classical method of Lagrange multipliers and the penalty function method. Both constrained minima and transition states can be located and, unlike the standard Z-matrix using internal coordinates, the desired constraints do not have to be satisfied in the initial structure. The algorithm is as efficient as a Z-matrix optimization while presenting several additional advantages. 相似文献
8.
9.
The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature. 相似文献
10.
Summary This paper describes a simplified model which links the sedimentary concentration of selected biomarkers to their export primary production, their stability during transit to the anoxic sediment layer and the sediment bulk sedimentation rate. Manipulation of the biomarker data permits the individual effects of these processes to be separated. Examples demonstrate the use of this strategy in the evaluation of environmentally significant parameters. 相似文献