全文获取类型
收费全文 | 1312篇 |
免费 | 153篇 |
国内免费 | 90篇 |
专业分类
化学 | 158篇 |
晶体学 | 2篇 |
力学 | 206篇 |
综合类 | 33篇 |
数学 | 516篇 |
物理学 | 640篇 |
出版年
2024年 | 2篇 |
2023年 | 11篇 |
2022年 | 34篇 |
2021年 | 31篇 |
2020年 | 33篇 |
2019年 | 38篇 |
2018年 | 26篇 |
2017年 | 23篇 |
2016年 | 35篇 |
2015年 | 26篇 |
2014年 | 67篇 |
2013年 | 85篇 |
2012年 | 68篇 |
2011年 | 85篇 |
2010年 | 69篇 |
2009年 | 72篇 |
2008年 | 84篇 |
2007年 | 84篇 |
2006年 | 67篇 |
2005年 | 78篇 |
2004年 | 82篇 |
2003年 | 50篇 |
2002年 | 69篇 |
2001年 | 50篇 |
2000年 | 28篇 |
1999年 | 29篇 |
1998年 | 40篇 |
1997年 | 41篇 |
1996年 | 23篇 |
1995年 | 14篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 17篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 4篇 |
1974年 | 1篇 |
排序方式: 共有1555条查询结果,搜索用时 0 毫秒
1.
2.
Bernhard Heinemann 《Mathematical Logic Quarterly》1997,43(2):203-215
Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated. 相似文献
3.
In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions. 相似文献
4.
Eduardo Mizraji 《Complexity》2004,9(6):33-42
This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the ECA laws in a “spectrum” of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates “exclusive‐or” and “equivalence” are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. © 2004 Wiley Periodicals, Inc. Complexity 9: 33–42, 2004 相似文献
5.
Alan L. Andrew 《BIT Numerical Mathematics》2003,43(3):485-503
The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems. 相似文献
6.
S. Scott Collis Kaveh Ghayour Matthias Heinkenschloss Michael Ulbrich Stefan Ulbrich 《国际流体数值方法杂志》2002,40(11):1401-1429
The control of complex, unsteady flows is a pacing technology for advances in fluid mechanics. Recently, optimal control theory has become popular as a means of predicting best case controls that can guide the design of practical flow control systems. However, most of the prior work in this area has focused on incompressible flow which precludes many of the important physical flow phenomena that must be controlled in practice including the coupling of fluid dynamics, acoustics, and heat transfer. This paper presents the formulation and numerical solution of a class of optimal boundary control problems governed by the unsteady two‐dimensional compressible Navier–Stokes equations. Fundamental issues including the choice of the control space and the associated regularization term in the objective function, as well as issues in the gradient computation via the adjoint equation method are discussed. Numerical results are presented for a model problem consisting of two counter‐rotating viscous vortices above an infinite wall which, due to the self‐induced velocity field, propagate downward and interact with the wall. The wall boundary control is the temporal and spatial distribution of wall‐normal velocity. Optimal controls for objective functions that target kinetic energy, heat transfer, and wall shear stress are presented along with the influence of control regularization for each case. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
7.
8.
In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd. 相似文献
9.
Noga Alon Oded Goldreich Johan Hstad Ren Peralta 《Random Structures and Algorithms》1992,3(3):289-304
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity. 相似文献
10.
XIE Fu-Ding Xiao-Shan LIU Feng 《理论物理通讯》2004,42(11)
Based on the rank analysis method, algorithmization idea, and symbolic computation, in this paper we have presented a method to construct the conservation laws for nonlinear evolution equations. The polynomial conservation laws for K (n 2, n) equations and mnK(m, n) equations are found by using of this approach and some new results have been obtained. 相似文献