全文获取类型
收费全文 | 812篇 |
免费 | 29篇 |
国内免费 | 50篇 |
专业分类
化学 | 32篇 |
力学 | 28篇 |
综合类 | 5篇 |
数学 | 791篇 |
物理学 | 35篇 |
出版年
2024年 | 2篇 |
2023年 | 13篇 |
2022年 | 18篇 |
2021年 | 9篇 |
2020年 | 28篇 |
2019年 | 29篇 |
2018年 | 27篇 |
2017年 | 21篇 |
2016年 | 9篇 |
2015年 | 16篇 |
2014年 | 16篇 |
2013年 | 122篇 |
2012年 | 30篇 |
2011年 | 36篇 |
2010年 | 31篇 |
2009年 | 66篇 |
2008年 | 50篇 |
2007年 | 65篇 |
2006年 | 49篇 |
2005年 | 36篇 |
2004年 | 30篇 |
2003年 | 23篇 |
2002年 | 29篇 |
2001年 | 21篇 |
2000年 | 19篇 |
1999年 | 15篇 |
1998年 | 18篇 |
1997年 | 5篇 |
1996年 | 18篇 |
1995年 | 8篇 |
1994年 | 11篇 |
1993年 | 7篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1983年 | 2篇 |
1982年 | 3篇 |
排序方式: 共有891条查询结果,搜索用时 62 毫秒
1.
2.
3.
A Generalization of Regular Left Acts 总被引:1,自引:0,他引:1
Liu Zhongkui 《东北数学》1997,(2)
AGeneralizationofRegularLeftActs*)LiuZhongkui(刘仲奎)(DepartmentofMathematics,NorthwestNormalUniversity,Lanzhou,730070)J.Ahsan(D... 相似文献
4.
蕴涵代数与BCK代数 总被引:6,自引:0,他引:6
系统研究 Fuzzy蕴涵代数与 BCK代数之间的关系 ,给出 MV代数与 BCK代数之间的联系 ,建立正则 FI代数和对合 BCK代数的对偶代数 相似文献
5.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
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.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献