全文获取类型
收费全文 | 618篇 |
免费 | 63篇 |
国内免费 | 44篇 |
专业分类
化学 | 20篇 |
晶体学 | 1篇 |
力学 | 124篇 |
综合类 | 13篇 |
数学 | 458篇 |
物理学 | 109篇 |
出版年
2023年 | 13篇 |
2022年 | 4篇 |
2021年 | 16篇 |
2020年 | 26篇 |
2019年 | 14篇 |
2018年 | 25篇 |
2017年 | 21篇 |
2016年 | 22篇 |
2015年 | 16篇 |
2014年 | 22篇 |
2013年 | 56篇 |
2012年 | 32篇 |
2011年 | 33篇 |
2010年 | 22篇 |
2009年 | 26篇 |
2008年 | 32篇 |
2007年 | 29篇 |
2006年 | 35篇 |
2005年 | 38篇 |
2004年 | 29篇 |
2003年 | 29篇 |
2002年 | 24篇 |
2001年 | 18篇 |
2000年 | 28篇 |
1999年 | 19篇 |
1998年 | 15篇 |
1997年 | 7篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1985年 | 4篇 |
1984年 | 7篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
排序方式: 共有725条查询结果,搜索用时 312 毫秒
21.
22.
23.
The direct injection of CO2 into the deep ocean is one of the feasible ways for the mitigation of the global warming, although there is a concern about its environmental impact near the injection point. To minimize its biological impact, it is necessary to make CO2 disperse as quickly as possible, and it is said that injection with a pipe towed by a moving ship is effective for this purpose. Because the injection ship moves over a spatial scale of O(102km), a mesoscale model is necessary to analyse the dispersion of CO2. At the same time, since it is important to investigate high CO2 concentration near the injection point, a small‐scale model is also required. Therefore, in this study, a numerical model was developed to analyse CO2 dispersion in the deep ocean by using a fixed mesoscale and a moving small‐scale grid systems, the latter of which is nested and moves in the former along the trajectory of the moving ship. To overcome the artificial diffusion of mass concentration at the interface of the two different grid systems and to keep its spatial accuracy almost the same as that in the small‐scale, a particle Laplacian method was adopted and newly modified for anisotropic diffusion in the ocean. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
24.
Thilo Weinert 《Mathematical Logic Quarterly》2010,56(6):659-665
We introduce the Bounded Axiom A Forcing Axiom (BAAFA). It turns out that it is equiconsistent with the existence of a regular ∑2‐correct cardinal and hence also equiconsistent with BPFA. Furthermore we show that, if consistent, it does not imply the Bounded Proper Forcing Axiom (BPFA) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
25.
Sufficient conditions are established for the oscillation of proper solutions of the system
where f
i
:+ × 2m (i=1,2) satisfy the local Carathéodory conditions and
i
,
i
:+ +(i=1,...,m) are continuous functions such that
i
(t) t for
. 相似文献
26.
This paper treats multidimensional discrete input-output systems from the constructive point of view. We adapt and improve recursive algorithms, derived earlier by E. Zerz and the second author from standard Gröbner basis algorithms, for the solution of the canonical Cauchy problem for linear systems of partial difference equations with constant coefficients on the lattices N = r1 × r2. These recursive algorithms, in turn, furnish four other solution methods for the initial value problem, namely by transfer operators, by canonical Kalman global state equations, by parametrizations of controllable systems and, for systems with proper transfer matrix and left bounded input signals, by convolution with the transfer matrix. In the 2D-case N = 2 the last method was studied by S. Zampieri. Minimally embedded systems are studied and give rise to especially simple Kalman equations. The latter also imply a useful characterization of the characteristic or polar variety of the system by eigenvalue spectra. For N = r we define reachability of a system and prove that controllability implies reachability, but not conversely. Moreover we solve, in full generality, the modelling problem which was introduced and partially solved by F. Pauer and S. Zampieri. Various algorithms have been implemented by the first author in axiom, and examples are demonstrated by means of computer generated pictures. Related work on state space representations has been done by the Padovian and Groningian system theory schools. 相似文献
27.
Sy D. Friedman 《Proceedings of the American Mathematical Society》1999,127(12):3707-3709
We use ``iterated square sequences' to show that there is an -definable partition such that if is an inner model not containing :
- (a)
- For some is stationary.
- (b)
- For each there is a generic extension of in which does not exist and is non-stationary.
28.
Endre Boros Khaled Elbassioni Vladimir Gurvich Leonid Khachiyan 《Mathematical Programming》2003,98(1-3):355-368
A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =1××n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=1××n for a system of polymatroid inequalities does not exceed max{Q,logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2c(c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}n, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides .
This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20 相似文献
29.
Zbigniew Jelonek 《Proceedings of the American Mathematical Society》2003,131(5):1361-1367
Let be a polynomial of degree . Assume that the set there is a sequence s.t. and is finite. We prove that the set of generalized critical values of (hence in particular the set of bifurcation points of ) has at most points. Moreover, We also compute the set effectively.
30.
Harald Biller 《Transactions of the American Mathematical Society》2003,355(1):407-432
Essential results about actions of compact Lie groups on connected manifolds are generalized to proper actions of arbitrary groups on connected cohomology manifolds. Slices are replaced by certain fiber bundle structures on orbit neighborhoods. The group dimension is shown to be effectively finite. The orbits of maximal dimension form a dense open connected subset. If some orbit has codimension at most , then the group is effectively a Lie group.