全文获取类型
收费全文 | 8610篇 |
免费 | 249篇 |
国内免费 | 171篇 |
专业分类
化学 | 1279篇 |
晶体学 | 64篇 |
力学 | 40篇 |
综合类 | 17篇 |
数学 | 5473篇 |
物理学 | 744篇 |
无线电 | 1413篇 |
出版年
2023年 | 41篇 |
2022年 | 58篇 |
2021年 | 65篇 |
2020年 | 79篇 |
2019年 | 170篇 |
2018年 | 154篇 |
2017年 | 104篇 |
2016年 | 108篇 |
2015年 | 166篇 |
2014年 | 303篇 |
2013年 | 429篇 |
2012年 | 353篇 |
2011年 | 581篇 |
2010年 | 453篇 |
2009年 | 569篇 |
2008年 | 551篇 |
2007年 | 595篇 |
2006年 | 427篇 |
2005年 | 307篇 |
2004年 | 245篇 |
2003年 | 257篇 |
2002年 | 232篇 |
2001年 | 171篇 |
2000年 | 154篇 |
1999年 | 189篇 |
1998年 | 208篇 |
1997年 | 177篇 |
1996年 | 180篇 |
1995年 | 220篇 |
1994年 | 165篇 |
1993年 | 177篇 |
1992年 | 158篇 |
1991年 | 95篇 |
1990年 | 99篇 |
1989年 | 115篇 |
1988年 | 65篇 |
1987年 | 51篇 |
1986年 | 53篇 |
1985年 | 76篇 |
1984年 | 72篇 |
1983年 | 55篇 |
1982年 | 66篇 |
1981年 | 43篇 |
1980年 | 40篇 |
1979年 | 42篇 |
1978年 | 42篇 |
1977年 | 17篇 |
1976年 | 17篇 |
1975年 | 11篇 |
1974年 | 10篇 |
排序方式: 共有9030条查询结果,搜索用时 0 毫秒
91.
《Mathematische Nachrichten》2018,291(8-9):1240-1268
In this work we deal with solvability of first‐order differential equations in the form , where L is a planar complex vector field, elliptic everywhere except along a simple closed curve Σ on which it is tangent and vanishes of order . In contrast with the local solvability, it is shown that the zero order term p has influence in the solvability in a full neighborhood of Σ. 相似文献
92.
We investigate the existence of globally generated vector bundles of rank 2 with c1≤3 on a smooth quadric threefold and determine their Chern classes. As an automatic consequence, every rank 2 globally generated vector bundle on Q with c1=3 is an odd instanton up to twist. 相似文献
93.
An action of a finite group on a closed 2-manifold is called almost free if it has a single orbit of points with nontrivial stabilizers. It is called large when the order of the group is greater than or equal to the genus of the surface. We prove that the orientation-preserving large almost free actions of G on closed orientable surfaces correspond to the Nielsen equivalence classes of generating pairs of G . We classify the almost free actions on the surfaces of genera 3 and 4, find the large almost free actions of the alternating group A5, and give various other examples. 相似文献
94.
We show that over a field of characteristic 2 a central simple algebra with orthogonal involution that decomposes into a product of quaternion algebras with involution is either anisotropic or metabolic. We use this to define an invariant of such orthogonal involutions that completely determines the isotropy behaviour of the involution. We also give an example of a non-totally decomposable algebra with orthogonal involution that becomes totally decomposable over every splitting field of the algebra. 相似文献
95.
Logical theories for representing knowledge are often plagued by the so-called Logical Omniscience Problem. The problem stems from the clash between the desire to model rational agents, which should be capable of simple logical inferences, and the fact that any logical inference, however complex, almost inevitably consists of inference steps that are simple enough. This contradiction points to the fruitlessness of trying to solve the Logical Omniscience Problem qualitatively if the rationality of agents is to be maintained. We provide a quantitative solution to the problem compatible with the two important facets of the reasoning agent: rationality and resource boundedness. More precisely, we provide a test for the logical omniscience problem in a given formal theory of knowledge. The quantitative measures we use are inspired by the complexity theory. We illustrate our framework with a number of examples ranging from the traditional implicit representation of knowledge in modal logic to the language of justification logic, which is capable of spelling out the internal inference process. We use these examples to divide representations of knowledge into logically omniscient and not logically omniscient, thus trying to determine how much information about the reasoning process needs to be present in a theory to avoid logical omniscience. 相似文献
96.
In this paper we study the reverse mathematics of two theorems by Bonnet about partial orders. These results concern the structure and cardinality of the collection of initial intervals. The first theorem states that a partial order has no infinite antichains if and only if its initial intervals are finite unions of ideals. The second one asserts that a countable partial order is scattered and does not contain infinite antichains if and only if it has countably many initial intervals. We show that the left to right directions of these theorems are equivalent to ACA0 and ATR0, respectively. On the other hand, the opposite directions are both provable in WKL0, but not in RCA0. We also prove the equivalence with ACA0 of the following result of Erdös and Tarski: a partial order with no infinite strong antichains has no arbitrarily large finite strong antichains. 相似文献
97.
Summary The topic of iterative substructuring methods, and more generally domain decomposition methods, has been extensively studied over the past few years, and the topic is well advanced with respect to first and second order elliptic problems. However, relatively little work has been done on more general constrained least squares problems (or equivalent formulations) involving equilibrium equations such as those arising, for example, in realistic structural analysis applications. The potential is good for effective use of iterative algorithms on these problems, but such methods are still far from being competitive with direct methods in industrial codes. The purpose of this paper is to investigate an order reducing, preconditioned conjugate gradient method proposed by Barlow, Nichols and Plemmons for solving problems of this type. The relationships between this method and nullspace methods, such as the force method for structures and the dual variable method for fluids, are examined. Convergence properties are discussed in relation to recent optimality results for Varga's theory ofp-cyclic SOR. We suggest a mixed approach for solving equilibrium equations, consisting of both direct reduction in the substructures and the conjugate gradient iterative algorithm to complete the computations.Dedicated to R. S. Varga on the occasion of his 60th birthdayResearch completed while pursuing graduate studies sponsored by the Department of Mathematical Sciences, US Air Force Academy, CO, and funded by the Air Force Institute of Technology, WPAFB, OHResearch supported by the Air Force under grant no. AFOSR-88-0285 and by the National Science Foundation under grant no. DMS-89-02121 相似文献
98.
Summary Recently Eiermann, Marek, and Niethammer have shown how to applysemiiterative methods to a fixed point systemx=Tx+c which isinconsistent or in whichthe powers of the fixed point operator T have no limit, to obtain iterative methods which converge to some approximate solution to the fixed point system. In view of their results we consider here stipulations on apreconditioning QAx=Qb of the systemAx=b and, separately, on asplitting A=M–N which lead to fixed point systems such that, with the aid of a semiiterative method, the iterative scheme converges to a weighted Moore-Penrose solution to the systemAx=b. We show in several ways that to obtain a meaningful limit point from a semiiterative method requires less restrictions on the splittings or the reconditionings than those which have been required in the classical Picard iterative method (see, e.g., the works of Berman and Plemmons, Berman and Neumann, and Tanabe).We pay special attention to the case when the weighted Moore-Penrose solution which is sought is the minimal norm least squares solution toAx=b.Research supported by the Deutsche ForschungsgemeinschaftPartially supported by AFOSR research grant 88-0047 相似文献
99.
In this paper, the boundedness of all solutions of the oscillator
is discussed, where ω is a positive constant, f(x,y),?(x) and p(t) are smooth functions, and p(t)=p(t+2π). 相似文献
x″+f(x,x′)+ω2x+?(x)=p(t)
100.
We consider solving eigenvalue problems or model reduction problems for a quadratic matrix polynomial Iλ2 − Aλ − B with large and sparse A and B. We propose new Arnoldi and Lanczos type processes which operate on the same space as A and B live and construct projections of A and B to produce a quadratic matrix polynomial with the coefficient matrices of much smaller size, which is used to approximate the original problem. We shall apply the new processes to solve eigenvalue problems and model reductions of a second order linear input-output system and discuss convergence properties. Our new processes are also extendable to cover a general matrix polynomial of any degree. 相似文献