全文获取类型
收费全文 | 589篇 |
免费 | 2篇 |
国内免费 | 7篇 |
专业分类
化学 | 14篇 |
晶体学 | 3篇 |
力学 | 186篇 |
综合类 | 2篇 |
数学 | 337篇 |
物理学 | 56篇 |
出版年
2023年 | 5篇 |
2022年 | 9篇 |
2021年 | 8篇 |
2020年 | 13篇 |
2019年 | 14篇 |
2018年 | 12篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2014年 | 20篇 |
2013年 | 60篇 |
2012年 | 9篇 |
2011年 | 41篇 |
2010年 | 29篇 |
2009年 | 64篇 |
2008年 | 71篇 |
2007年 | 25篇 |
2006年 | 40篇 |
2005年 | 17篇 |
2004年 | 22篇 |
2003年 | 15篇 |
2002年 | 13篇 |
2001年 | 14篇 |
2000年 | 8篇 |
1999年 | 10篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 7篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有598条查询结果,搜索用时 31 毫秒
1.
2.
《Discrete Mathematics》2021,344(12):112589
Let be the set of positive integers. For a nonempty set A of integers and every integer u, denote by the number of with such that . For a sequence S of positive integers, let be the counting function of S. The set is called a perfect difference set if for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let be an increasing function satisfying for any positive integer n, then for every Sidon set B and every function , there exists a set such that for every positive integer u and for all . 相似文献
3.
4.
本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。 相似文献
5.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
6.
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. 相似文献
7.
Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model. 相似文献
8.
Statics of elasto-plastic media is stated in terms of eigenstrains acting upon a background elastic problem with fixed (initial) stiffness. In order to minimize the number of unknowns and to provide computationally cheap algorithms plastic multipliers are used as main driving variables. Fixed-point type iterations are suggested for computing plastic multipliers within the load increment. Numerical experiments results are shown to be in good correlation with other software results. A range of problems is outlined where the usage of the proposed algorithms can be advantageous. 相似文献
9.
Perfect information two-person zero-sum markov games with imprecise transition probabilities 总被引:1,自引:0,他引:1
Hyeong Soo Chang 《Mathematical Methods of Operations Research》2006,64(2):335-351
Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model. 相似文献
10.
Frédéric Mynard 《Topology and its Applications》2007,154(4):953-968
Two results on product of compact filters are shown to be the common principle behind a surprisingly large number of theorems. 相似文献