全文获取类型
收费全文 | 2839篇 |
免费 | 59篇 |
国内免费 | 14篇 |
专业分类
化学 | 1923篇 |
晶体学 | 15篇 |
力学 | 49篇 |
数学 | 374篇 |
物理学 | 551篇 |
出版年
2021年 | 21篇 |
2020年 | 31篇 |
2019年 | 18篇 |
2018年 | 23篇 |
2017年 | 27篇 |
2016年 | 41篇 |
2015年 | 48篇 |
2014年 | 47篇 |
2013年 | 111篇 |
2012年 | 137篇 |
2011年 | 175篇 |
2010年 | 85篇 |
2009年 | 61篇 |
2008年 | 148篇 |
2007年 | 129篇 |
2006年 | 146篇 |
2005年 | 150篇 |
2004年 | 149篇 |
2003年 | 112篇 |
2002年 | 113篇 |
2001年 | 55篇 |
2000年 | 60篇 |
1999年 | 49篇 |
1998年 | 47篇 |
1997年 | 28篇 |
1996年 | 41篇 |
1995年 | 38篇 |
1994年 | 43篇 |
1993年 | 58篇 |
1992年 | 34篇 |
1991年 | 27篇 |
1990年 | 25篇 |
1989年 | 22篇 |
1988年 | 28篇 |
1987年 | 19篇 |
1986年 | 27篇 |
1985年 | 41篇 |
1984年 | 36篇 |
1983年 | 25篇 |
1982年 | 33篇 |
1981年 | 37篇 |
1980年 | 30篇 |
1979年 | 40篇 |
1978年 | 29篇 |
1977年 | 25篇 |
1976年 | 41篇 |
1975年 | 28篇 |
1974年 | 18篇 |
1973年 | 17篇 |
1971年 | 16篇 |
排序方式: 共有2912条查询结果,搜索用时 15 毫秒
1.
2.
3.
The electro-optic response of ferroelectric smectic C* liquid crystals has been studied. Anomalous switching behaviour of such materials which possess a negative dielectric anisotropy has been reported. These materials show a minimum in response time at a sufficiently high field. We present results showing the dependency of this minimum upon spontaneous polarisation and the effect of AC bias. Calculations based upon the equation of motion of the director around the cone are presented which describe this effect and its dependence on the relative magnitudes of the spontaneous polarization and dielectric anisotropy of the material. Good agreement with the experimental results is found. 相似文献
4.
In a previous paper we gave a new formulation and derived the Euler equations and other necessary conditions to solve strong, pathwise, stochastic variational problems with trajectories driven by Brownian motion. Thus, unlike current methods which minimize the control over deterministic functionals (the expected value), we find the control which gives the critical point solution of random functionals of a Brownian path and then, if we choose, find the expected value.This increase in information is balanced by the fact that our methods are anticipative while current methods are not. However, our methods are more directly connected to the theory and meaningful examples of deterministic variational theory and provide better means of solution for free and constrained problems. In addition, examples indicate that there are methods to obtain nonanticipative solutions from our equations although the anticipative optimal cost function has smaller expected value.In this paper we give new, efficient numerical methods to find the solution of these problems in the quadratic case. Of interest is that our numerical solution has a maximal, a priori, pointwise error of O(h3/2) where h is the node size. We believe our results are unique for any theory of stochastic control and that our methods of proof involve new and sophisticated ideas for strong solutions which extend previous deterministic results by the first author where the error was O(h2).We note that, although our solutions are given in terms of stochastic differential equations, we are not using the now standard numerical methods for stochastic differential equations. Instead we find an approximation to the critical point solution of the variational problem using relations derived from setting to zero the directional derivative of the cost functional in the direction of simple test functions.Our results are even more significant than they first appear because we can reformulate stochastic control problems or constrained calculus of variations problems in the unconstrained, stochastic calculus of variations formulation of this paper. This will allow us to find efficient and accurate numerical solutions for general constrained, stochastic optimization problems. This is not yet being done, even in the deterministic case, except by the first author. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
10.
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. 相似文献