全文获取类型
收费全文 | 16226篇 |
免费 | 2388篇 |
国内免费 | 1156篇 |
专业分类
化学 | 1584篇 |
晶体学 | 151篇 |
力学 | 2701篇 |
综合类 | 263篇 |
数学 | 9178篇 |
物理学 | 5893篇 |
出版年
2024年 | 31篇 |
2023年 | 137篇 |
2022年 | 253篇 |
2021年 | 257篇 |
2020年 | 377篇 |
2019年 | 348篇 |
2018年 | 315篇 |
2017年 | 453篇 |
2016年 | 503篇 |
2015年 | 378篇 |
2014年 | 651篇 |
2013年 | 1189篇 |
2012年 | 803篇 |
2011年 | 838篇 |
2010年 | 765篇 |
2009年 | 909篇 |
2008年 | 988篇 |
2007年 | 1083篇 |
2006年 | 1026篇 |
2005年 | 948篇 |
2004年 | 823篇 |
2003年 | 852篇 |
2002年 | 765篇 |
2001年 | 667篇 |
2000年 | 624篇 |
1999年 | 596篇 |
1998年 | 466篇 |
1997年 | 411篇 |
1996年 | 330篇 |
1995年 | 245篇 |
1994年 | 205篇 |
1993年 | 208篇 |
1992年 | 154篇 |
1991年 | 130篇 |
1990年 | 124篇 |
1989年 | 71篇 |
1988年 | 95篇 |
1987年 | 77篇 |
1986年 | 65篇 |
1985年 | 94篇 |
1984年 | 82篇 |
1983年 | 40篇 |
1982年 | 62篇 |
1981年 | 63篇 |
1980年 | 42篇 |
1979年 | 52篇 |
1978年 | 50篇 |
1977年 | 45篇 |
1976年 | 28篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
In general, we will use the numerical differentiation when dealing with the differential equations. Thus the differential equations can be transformed into algebraic equations and then we can get the numerical solutions. But as we all have known, the numerical differentiation process is very sensitive to even a small level of errors. In contrast it is expected that on average the numerical integration process is much less sensitive to errors. In this paper, based on the Sinc method we provide a new method using Sinc method incorporated with the double exponential transformation based on the interpolation of the highest derivatives (SIHD) for the differential equations. The error in the approximation of the solution is shown to converge at an exponential rate. The numerical results show that compared with the exiting results, our method is of high accuracy, of good convergence with little computational efforts. It is easy to treat nonhomogeneous mixed boundary condition for our method, which is unlike the traditional Sinc method. 相似文献
62.
Jing-na Li Xiao-feng Wang Zheng-an Yao 《应用数学学报(英文版)》2007,23(3):421-432
In this paper, we propose a model in studying soft ferromagnetic films, which is readily accessible experimentally. By using penalty approximation and compensated compactness, we prove that the dynamical equation in thin film has a local weak solution. Moreover, the corresponding linear equation is also dealt with in great detail. 相似文献
63.
We study theoretically a nonlinear response of the planar metal/dielectric nanostructures constituted from periodical array
of ultra thin silver layers and the layers of Kerr-like nonlinear dielectric. We predict hysteresis-type dependences of the
components of the tensor of effective dielectric permittivity on the field intensity allowing the change in material transmission
properties from transparent to opaque and back at extremely low intensities of the light. It makes possible to control the
light by light in all-optical nanoscale devices and circuits. 相似文献
64.
Supply Chain Management (SCM) is an important activity in all producing facilities and in many organizations to enable vendors,
manufacturers and suppliers to interact gainfully and plan optimally their flow of goods and services. To realize this, a
dynamic modelling approach for characterizing supply chain activities is opportune, so as to plan efficiently the set of activities
over a distributed network in a formal and scientific way. The dynamical system will result so complex that it is not generally
possible to specify the functional forms and the parameters of interest, relating outputs to inputs, states and stochastic
terms by experiential specification methods. Thus the algorithm that will presented is Data Driven, determining simultaneously
the functional forms, the parameters and the optimal control policy from the data available for the supply chain. The aim
of this paper is to present this methodology, by considering dynamical aspects of the system, the presence of nonlinear relationships
and unbiased estimation procedures to quantify these relations, leading to a nonlinear and stochastic dynamical system representation
of the SCM problem. Moreover, the convergence of the algorithm will be proved and the satisfaction of the required statistical
conditions demonstrated. Thus SCM problems may be formulated as formal scientific procedures, with well defined algorithms
and a precise calculation sequence to determine the best alternative to enact. A “Certainty equivalent principle” will be
indicated to ensure that the effects of the inevitable uncertainties will not lead to indeterminate results, allowing the
formulation of demonstrably asymptotically optimal management plans. 相似文献
65.
66.
A family of skew Hadamard difference sets 总被引:1,自引:0,他引:1
Cunsheng Ding 《Journal of Combinatorial Theory, Series A》2006,113(7):1526-1535
In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics. 相似文献
67.
Arne Barinka Stephan Dahlke Wolfgang Dahmen 《Advances in Computational Mathematics》2006,24(1-4):5-34
Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work
balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations
as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the
approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could
be shown under the assumption that the entries in properly compressed standard representations are known or computable in
average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption
is justified in the context of elliptic boundary value problems.
Dedicated to Charles A. Micchelli on the occasion of his 60th birthday
Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55.
This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported
in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The
second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract
HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1. 相似文献
68.
本文我们给出一个修正的非线性扩散方程模型,与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分:卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题,因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性,同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型,并且给出几个具体图像在该模型下处理结果。 相似文献
69.
Jinyan Fan 《Computational Optimization and Applications》2006,34(2):215-227
In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The
new method preserves the global convergence of the traditional trust region methods in which the trust region radius will
be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition
which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic.
Finally, some numerical results are given.
This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong
University, and E-Institute of Computational Sciences of Shanghai Universities.
An erratum to this article is available at . 相似文献
70.
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. 相似文献