全文获取类型
收费全文 | 1349篇 |
免费 | 207篇 |
国内免费 | 88篇 |
专业分类
化学 | 125篇 |
力学 | 58篇 |
综合类 | 16篇 |
数学 | 746篇 |
物理学 | 163篇 |
无线电 | 536篇 |
出版年
2024年 | 5篇 |
2023年 | 25篇 |
2022年 | 46篇 |
2021年 | 37篇 |
2020年 | 74篇 |
2019年 | 56篇 |
2018年 | 53篇 |
2017年 | 54篇 |
2016年 | 61篇 |
2015年 | 53篇 |
2014年 | 87篇 |
2013年 | 107篇 |
2012年 | 75篇 |
2011年 | 77篇 |
2010年 | 58篇 |
2009年 | 78篇 |
2008年 | 87篇 |
2007年 | 68篇 |
2006年 | 76篇 |
2005年 | 41篇 |
2004年 | 59篇 |
2003年 | 53篇 |
2002年 | 54篇 |
2001年 | 45篇 |
2000年 | 36篇 |
1999年 | 29篇 |
1998年 | 22篇 |
1997年 | 33篇 |
1996年 | 12篇 |
1995年 | 12篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 4篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 4篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有1644条查询结果,搜索用时 15 毫秒
81.
§ 1 IntroductionA strong embeddingμ( G) of a graph G in a surface S is such an embedding thateachface boundary of the surface is a circuit.( A strong embedding is also sometimes called acircular embedding,see[1 ] orclosed2 -cell embedding[2 ] ) .Graphsconsidered here are sim-ple( that is,they have no loops or multiple edges) .Terminology here follows those in[3] .In[1 ] ,Richter,Seymour and Siran proved that every3-connected planar graph canbe strongly embedded on some non-orientable sur… 相似文献
82.
83.
We propose a domain embedding method to solve second order elliptic problems in arbitrary two-dimensional domains. The method is based on formulating the problem as an optimal distributed control problem inside a disc in which the arbitrary domain is embedded. The optimal distributed control problem inside the disc is solved rapidly using a fast algorithm developed by Daripa et al. [3,7,10–12]. The arbitrary domains can be simply or multiply connected and the proposed method can be applied, in principle, to a large number of elliptic problems. Numerical results obtained for Dirichlet problems associated with the Poisson equation in simply and multiply connected domains are presented. The computed solutions are found to be in good agreement with the exact solutions with moderate number of grid points in the domain. 相似文献
84.
It will be shown that a normed partially ordered vector space is linearly, norm, and order isomorphic to a subspace of a normed Riesz space if and only if its positive cone is closed and its norm p satisfies p(x)p(y) for all x and y with -yxy. A similar characterization of the subspaces of M-normed Riesz spaces is given. With aid of the first characterization, Krein's lemma on directedness of norm dual spaces can be directly derived from the result for normed Riesz spaces. Further properties of the norms ensuing from the characterization theorem are investigated. Also a generalization of the notion of Riesz norm is studied as an analogue of the r-norm from the theory of spaces of operators. Both classes of norms are used to extend results on spaces of operators between normed Riesz spaces to a setting with partially ordered vector spaces. Finally, a partial characterization of the subspaces of Riesz spaces with Riesz seminorms is given. 相似文献
85.
In this paper, we classify the regular embeddings of arc-transitive simple graphs of order pq for any two primes p and q (not necessarily distinct) into orientable surfaces. Our classification is obtained by direct analysis of the structure of arc-regular subgroups (with cyclic vertex-stabilizers) of the automorphism groups of such graphs. This work is independent of the classification of primitive permutation groups of degree p or degree pq for p q and it is also independent of the classification of the arc-transitive graphs of order pq for p q. 相似文献
86.
Hans Georg Schaathun 《Designs, Codes and Cryptography》2004,31(1):27-42
A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight e
r is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes. 相似文献
87.
求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性 总被引:1,自引:0,他引:1
对于一类非单调线性互补问题给出了一种新的算法——宽邻域内点算法,并讨论了其计算复杂性。 相似文献
88.
该文通过构造特殊形式的有效集来逼近KKT点处的有效集,给出了一个任意初始点下的序列线性方程组新算法,并证明了该算法在没有严格互补松驰条件的情况下具有全局收敛性和一步超线性收敛性。
相似文献
89.
设R是含非平凡幂等元P的素环,C∈R,C=PC.本文证明可加映射△:R→R在C可导,即△(AB)=△(A)B+A△(B),A,B∈R,AB=C当且仅当存在导子δ:R→R,使得△(A)=δ(A)+△(I)A,A∈R.没有I_1型中心直和项的von Neumann代数上的可导映射也有类似结论.利用该结论证明了,若非零算子C∈B(X),使得ran(C)或ker(C)在X中可补,则可加映射△:B(X)→B(X)在C可导当且仅当它是导子.特别地,证明了因子von Neumann代数上的可加映射在任意但固定的非零算子可导当且仅当它是导子. 相似文献
90.
《Journal of Graph Theory》2018,87(3):305-316
For a finite set V and a positive integer k with , letting be the set of all k‐subsets of V, the pair is called the complete k‐hypergraph on V, while each k‐subset of V is called an edge. A factorization of the complete k‐hypergraph of index , simply a ‐factorization of order n, is a partition of the edges into s disjoint subsets such that each k‐hypergraph , called a factor, is a spanning subhypergraph of . Such a factorization is homogeneous if there exist two transitive subgroups G and M of the symmetric group of degree n such that G induces a transitive action on the set and M lies in the kernel of this action. In this article, we give a classification of homogeneous factorizations of that admit a group acting transitively on the edges of . It is shown that, for and , there exists an edge‐transitive homogeneous ‐factorization of order n if and only if is one of (32, 3, 5), (32, 3, 31), (33, 4, 5), , and , where and q is a prime power with . 相似文献