全文获取类型
收费全文 | 702篇 |
免费 | 92篇 |
国内免费 | 41篇 |
专业分类
化学 | 79篇 |
力学 | 30篇 |
综合类 | 14篇 |
数学 | 639篇 |
物理学 | 73篇 |
出版年
2024年 | 4篇 |
2023年 | 4篇 |
2022年 | 12篇 |
2021年 | 15篇 |
2020年 | 10篇 |
2019年 | 22篇 |
2018年 | 14篇 |
2017年 | 17篇 |
2016年 | 30篇 |
2015年 | 20篇 |
2014年 | 37篇 |
2013年 | 54篇 |
2012年 | 21篇 |
2011年 | 31篇 |
2010年 | 30篇 |
2009年 | 46篇 |
2008年 | 52篇 |
2007年 | 44篇 |
2006年 | 44篇 |
2005年 | 36篇 |
2004年 | 35篇 |
2003年 | 23篇 |
2002年 | 27篇 |
2001年 | 35篇 |
2000年 | 26篇 |
1999年 | 31篇 |
1998年 | 29篇 |
1997年 | 16篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 8篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1974年 | 2篇 |
排序方式: 共有835条查询结果,搜索用时 15 毫秒
1.
Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated. 相似文献
2.
关于惠斯登电桥测电阻倍率与检流计灵敏度关系的研究 总被引:1,自引:0,他引:1
在相同的设备条件下,电桥临近平衡时灵敏度最高的最佳倍率是:组成倍率的两个电阻的数量级与待测电阻数量级相等,且比值为1的倍率。 相似文献
3.
Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λmin=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λmin≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009 相似文献
4.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
5.
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal
constant composition codes meeting the upper bound given by [13]. 相似文献
6.
The notion of a fuzzy retract was introduced by Rodabaugh (1981). The notion of a fuzzy pairwise retract was introduced in 2001. Some weak forms and some strong forms of α-continuous mappings were introduced in 1988 and 1997. The authors extend some of these forms to the L-fuzzy bitopological setting and construct various α-fuzzy pairwise retracts. The concept of weakly induced spaces in the case L = [0,1] was introduced by Martin (1980). Liu and Luo (1987) generalized this notion to the case that L is an arbitrary F-lattice and introduced the notion of induced L-fts. Several results are obtained, especially, for L-valued pairwise stratification spaces. 相似文献
7.
In this article, a kind of auxiliary design BSA* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007 相似文献
8.
In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (aij), for all i and j it holds that aij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007 相似文献
9.
Bram van Asch Henk Hollmann Henk van Tilborg 《Journal of Combinatorial Theory, Series A》2006,113(8):1594-1613
When Jack van Lint was appointed as full professor at the Eindhoven University of Technology at the age of 26 he combined a PhD in number theory with a very open scientific mind. It took a sabbatical visit to Bell Laboratories in 1966 to make him understand that a new and fascinating field of applied mathematics was emerging: discrete mathematics. It fascinated and inspired him for the rest of his life. When he passed away on September 28, 2004, he left behind a legacy of 18 books and 177 articles, covering many aspects of coding theory, combinatorics, and finite geometry.van Lint was also a strong international advocate of the role that discrete mathematics ought to play in modern applied mathematics curricula. Quite a few departments sought his advice. Years later, four different universities showed their appreciation by awarding him an honorary degree.This overview is an homage to van Lint's academic achievements and can serve as an introduction to his work for younger generations. 相似文献
10.