全文获取类型
收费全文 | 845篇 |
免费 | 32篇 |
国内免费 | 53篇 |
专业分类
化学 | 83篇 |
晶体学 | 2篇 |
力学 | 43篇 |
综合类 | 13篇 |
数学 | 714篇 |
物理学 | 75篇 |
出版年
2024年 | 1篇 |
2023年 | 15篇 |
2022年 | 19篇 |
2021年 | 7篇 |
2020年 | 22篇 |
2019年 | 29篇 |
2018年 | 34篇 |
2017年 | 19篇 |
2016年 | 15篇 |
2015年 | 16篇 |
2014年 | 19篇 |
2013年 | 124篇 |
2012年 | 32篇 |
2011年 | 36篇 |
2010年 | 31篇 |
2009年 | 68篇 |
2008年 | 47篇 |
2007年 | 66篇 |
2006年 | 50篇 |
2005年 | 40篇 |
2004年 | 29篇 |
2003年 | 21篇 |
2002年 | 38篇 |
2001年 | 24篇 |
2000年 | 17篇 |
1999年 | 23篇 |
1998年 | 19篇 |
1997年 | 8篇 |
1996年 | 16篇 |
1995年 | 10篇 |
1994年 | 11篇 |
1993年 | 7篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有930条查询结果,搜索用时 15 毫秒
1.
《Indagationes Mathematicae》2022,33(1):218-237
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic , and with coefficients in a field of odd characteristic ): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols. 相似文献
2.
3.
4.
A Generalization of Regular Left Acts 总被引:1,自引:0,他引:1
Liu Zhongkui 《东北数学》1997,(2)
AGeneralizationofRegularLeftActs*)LiuZhongkui(刘仲奎)(DepartmentofMathematics,NorthwestNormalUniversity,Lanzhou,730070)J.Ahsan(D... 相似文献
5.
蕴涵代数与BCK代数 总被引:6,自引:0,他引:6
系统研究 Fuzzy蕴涵代数与 BCK代数之间的关系 ,给出 MV代数与 BCK代数之间的联系 ,建立正则 FI代数和对合 BCK代数的对偶代数 相似文献
6.
Yan WANG Rong Quan FENG 《数学学报(英文版)》2005,21(4):773-778
A Cayley map is a Cayley graph embedded in an orientable surface such that. the local rotations at every vertex are identical. In this paper, balanced regular Cayley maps for cyclic groups, dihedral groups, and generalized quaternion groups are classified. 相似文献
7.
Quan Sen JIU Department of Mathematics Capital Normal University Beijing P.R.China Cheng HE Institute of Applied Mathematics Academy of Mathematics System Sciences Chinese Academy of Sciences Beijing P.R.China 《应用数学学报(英文版)》2004,(4)
In this paper we are interested in the sufficient conditions which guarantee the regularityof solutions of 3-D ideal magnetohydrodynamic equations in the arbitrary time interval [0,T].Fivesufficient conditions are given.Our results are motivated by two main ideas:one is to control theaccumulation of vorticity alone;the other is to generalize the corresponding geometric conditions of3-D Euler equations to 3-D ideal magnetohydrodynamic equations. 相似文献
8.
M.V. Devyaterikova 《Operations Research Letters》2006,34(2):149-154
In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed. 相似文献
9.
Alexandru V. Asimit 《Insurance: Mathematics and Economics》2007,41(1):53-61
This paper exploits a stochastic representation of bivariate elliptical distributions in order to obtain asymptotic results which are determined by the tail behavior of the generator. Under certain specified assumptions, we present the limiting distribution of componentwise maxima, the limiting upper copula, and a bivariate version of the classical peaks over threshold result. 相似文献
10.
Monique Laurent 《Mathematical Programming》2007,109(2-3):239-261
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras.
The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located
between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with
O(n
7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n
3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s
bound with the same computational complexity.
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203. 相似文献