全文获取类型
收费全文 | 852篇 |
免费 | 27篇 |
国内免费 | 98篇 |
专业分类
化学 | 24篇 |
力学 | 9篇 |
综合类 | 13篇 |
数学 | 783篇 |
物理学 | 148篇 |
出版年
2024年 | 3篇 |
2023年 | 3篇 |
2022年 | 6篇 |
2021年 | 13篇 |
2020年 | 21篇 |
2019年 | 21篇 |
2018年 | 27篇 |
2017年 | 39篇 |
2016年 | 8篇 |
2015年 | 16篇 |
2014年 | 20篇 |
2013年 | 245篇 |
2012年 | 15篇 |
2011年 | 39篇 |
2010年 | 21篇 |
2009年 | 48篇 |
2008年 | 42篇 |
2007年 | 55篇 |
2006年 | 27篇 |
2005年 | 35篇 |
2004年 | 40篇 |
2003年 | 46篇 |
2002年 | 24篇 |
2001年 | 26篇 |
2000年 | 29篇 |
1999年 | 20篇 |
1998年 | 27篇 |
1997年 | 19篇 |
1996年 | 10篇 |
1995年 | 11篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 5篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1984年 | 1篇 |
1981年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有977条查询结果,搜索用时 375 毫秒
1.
2.
张志让 《数学年刊A辑(中文版)》2006,(2)
如果群 G 的所有真商群都是 FO-群,但是群 G 本身不是 FO-群,则称 G 为外 FO-群,本文将给出外 FO-群完全的结构描述. 相似文献
3.
INTERSECTION OF PRIME SUBMODULES AND DIMENSION OF MODULES 总被引:1,自引:0,他引:1
A.Azizi 《数学物理学报(B辑英文版)》2005,25(3):385-394
The aim of this paper is to study the conditions by which a P-prime submodule can be expressed as a finite intersection or union of P-prime submodules. Also corresponding to dimension and rank of modules, some equivalent conditions for a ring to be a Dedekind domain are given. 相似文献
4.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
5.
D. P. Zhelobenko 《Acta Appl Math》2004,81(1):347-354
A special class of associative algebras is introduced and studied. A criteria of semisimplicity for suitable category of modules is obtained. 相似文献
6.
A. Azizi 《Czechoslovak Mathematical Journal》2003,53(3):529-534
In this paper we characterize weak multiplication modules. 相似文献
7.
Foda Omar Leclerc Bernard Okado Masato Thibon Jean-Yves Welsh Trevor A. 《Letters in Mathematical Physics》1998,43(1):31-42
A special family of partitions occurs in two apparently unrelated contexts: the evaluation of one-dimensional configuration sums of certain RSOS models, and the modular representation theory of symmetric groups or their Hecke algebras Hm. We provide an explanation of this coincidence by showing how the irreducible Hm-modules which remain irreducible under restriction to Hm_1 (Jantzen–Seitz modules) can be determined from the decomposition of a tensor product of representations sln. 相似文献
8.
Steen Ryom-Hansen 《Journal of Algebraic Combinatorics》2006,23(1):5-20
We generalize Soergel's tilting algorithm to singular weights and deduce from this the validity of the Lascoux-Leclerc-Thibon
conjecture on the connection between the canonical basis of the basic submodule of the Fock module and the representation
theory of the Hecke-algebras at root of unity.
Supported in part by Programa Reticulados y Ecuaciones and by FONDECYT grant 1051024. 相似文献
9.
We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m2+loglogσ)logσ) in the best case and O((m2+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force. 相似文献
10.
In this paper, we study the homogenous quotient modules of the Hardy module on the bidisk. The essential normality of the
homogenous quotient modules is completely characterized. We also describe the essential spectrum for a general quotient module.
The paper also considers K-homology invariant defined in the case of the homogenous quotient modules on the bidisk.
This work is partially supported by the National Natural Science Foundation of China (Grant No. 10525106), the Young Teacher
Fund, the National Key Basic Research Project of China (Grant No. 2006CB805905) and the Specialized Research for the Doctoral
Program 相似文献