全文获取类型
收费全文 | 2304篇 |
免费 | 134篇 |
国内免费 | 93篇 |
专业分类
化学 | 1518篇 |
晶体学 | 21篇 |
力学 | 111篇 |
数学 | 216篇 |
物理学 | 665篇 |
出版年
2023年 | 19篇 |
2022年 | 32篇 |
2021年 | 36篇 |
2020年 | 35篇 |
2019年 | 29篇 |
2018年 | 35篇 |
2017年 | 31篇 |
2016年 | 54篇 |
2015年 | 72篇 |
2014年 | 96篇 |
2013年 | 114篇 |
2012年 | 179篇 |
2011年 | 201篇 |
2010年 | 132篇 |
2009年 | 136篇 |
2008年 | 150篇 |
2007年 | 144篇 |
2006年 | 134篇 |
2005年 | 117篇 |
2004年 | 88篇 |
2003年 | 83篇 |
2002年 | 51篇 |
2001年 | 50篇 |
2000年 | 49篇 |
1999年 | 28篇 |
1998年 | 26篇 |
1997年 | 22篇 |
1996年 | 34篇 |
1995年 | 34篇 |
1994年 | 23篇 |
1993年 | 28篇 |
1992年 | 29篇 |
1991年 | 25篇 |
1990年 | 17篇 |
1989年 | 23篇 |
1988年 | 23篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 13篇 |
1984年 | 10篇 |
1983年 | 15篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 10篇 |
1976年 | 9篇 |
1975年 | 11篇 |
1974年 | 11篇 |
1973年 | 10篇 |
排序方式: 共有2531条查询结果,搜索用时 15 毫秒
1.
2.
Chi-Kwong Li Ming-Cheng Tsai Ya-Shu Wang Ngai-Ching Wong 《Journal of Mathematical Analysis and Applications》2022,505(2):125522
Let L be an additive map between (real or complex) matrix algebras sending Hermitian idempotent matrices to Hermitian idempotent matrices. We show that there are nonnegative integers with and an unitary matrix U such that We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism. 相似文献
3.
Chin‐Ping Yang Sheng‐Huei Hsiao Che‐Yu Tsai Guey‐Sheng Liou 《Journal of polymer science. Part A, Polymer chemistry》2004,42(10):2416-2431
Two series of fluorinated polyimides were prepared from 2,2′‐bis(4‐amino‐2‐trifluoromethylphenoxy)biphenyl ( 2 ) and 2,2′‐bis(4‐amino‐2‐trifluoromethylphenoxy)‐1,1′‐binaphthyl ( 4 ) with various aromatic dianhydrides via a conventional, two‐step procedure that included a ring‐opening polyaddition to give poly(amic acid)s, followed by chemical or thermal cyclodehydration. The inherent viscosities of the polyimides ranged from 0.54 to 0.73 and 0.19 to 0.36 dL/g, respectively. All the fluorinated polyimides were soluble in many polar organic solvents, such as N,N‐dimethylacetamide and N‐methylpyrrolidone, and afforded transparent and light‐colored films via solution‐casting. These polyimides showed glass‐transition temperatures in the ranges of 222–280 and 257–351 °C by DSC, softening temperatures in the range of 264–301 °C by thermomechanical analysis, and a decomposition temperature for 10% weight loss above 520 °C both in nitrogen and air atmospheres. The polyimides had low moisture absorptions of 0.23–0.58%, low dielectric constants of 2.84–3.61 at 10 kHz, and an ultraviolet–visible absorption cutoff wavelength at 351–434 nm. Copolyimides derived from the same dianhydrides with an equimolar mixture of 4,4′‐oxydianiline and diamine 2 or 4 were also prepared and characterized. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2416–2431, 2004 相似文献
4.
Yen-Shung TSAI 《中国科学A辑(英文版)》2007,50(7):1026-1034
By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper. 相似文献
5.
Zi‐Cai Li Tzon‐Tzer Lu Hung‐Tsai Huang Alexander H.‐D. Cheng 《Numerical Methods for Partial Differential Equations》2007,23(1):93-144
In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007 相似文献
6.
本文在Larson的“键长涨落模型”的基础上提出了模拟高浓度多链体系的新算法。本算法具有如下特征:(1)除通常的微松弛模式外,还直接引入了链的Reptation运动;(2)提出了空穴扩散算法使体系随时间演化。由于本算法的这些新特征,克服了前人的算法不能运用于两维体系以及高浓度多链体系的缺点,同时也大大缩短了计算耗时。应用本文的算法,在44×44的元胞中模拟了链长为21,浓度为0.9545的体系的动力学行为。所得结果与Rouse理论的预言相符合。 相似文献
7.
Jürg Fröhlich Tai-Peng Tsai Horng-Tzer Yau 《Communications in Mathematical Physics》2002,225(2):223-274
We consider the nonlinear Hartree equation describing the dynamics of weakly interacting non-relativistic Bosons. We show
that a nonlinear M?ller wave operator describing the scattering of a soliton and a wave can be defined. We also consider the dynamics of a
soliton in a slowly varying background potential W(ɛx). We prove that the soliton decomposes into a soliton plus a scattering wave (radiation) up to times of order ɛ−1. To leading order, the center of the soliton follows the trajectory of a classical particle in the potential W(ɛx).
Received: 30 June 2000 / Accepted: 25 June 2001 相似文献
8.
Tung-Yang Ho Ting-Yi Sung Lih-Hsing Hsu Chang-Hsiung Tsai Jeng-Yan Hwang 《Journal of Algorithms in Cognition, Informatics and Logic》1998,28(2):216-257
Given a series-parallel network (network, for short)N, its dual networkN′ is given by interchanging the series connection and the parallel connection of networkN. We usually use a series-parallel graph to represent a network. LetG[N] andG[N′] be graph representations ofNandN′, respectively. A sequence of edgese1, e2,…,ekis said to form a common trail on (G[N], G[N′]) if it is a trail on bothG[N] andG[N′]. If a common trail covers all of the edges inG[N] andG[N′], it is called adouble Euler trail.However, there are many different graph representations for a network. We say that a networkNhas a double Euler trail (DET) if there is a common Euler trail for someG[N] and someG[N′]. Finding a DET in a network is essential for optimizing the layout area of a complementary CMOS functional cell. Maziasz and Hayes (IEEE Trans. Computer-Aided Design9(1990), 708–719) gave a linear time algorithm for solving the layout problem in fixedG[N] andG[N′] and an exponential algorithm for finding the optimal cover in a network without fixing graph representations. In this paper, we study properties of subnetworks of a DET network. According to these properties, we propose an algorithm that automatically generates the rules for composition of trail cover classes. On the basis of these rules, a linear time algorithm for recognizing DET networks is presented. Furthermore, we also give a necessary and sufficient condition for the existence of a double Euler circuit in a network. 相似文献
9.
10.
Nano-sized oxide structures resulted from localized electrochemical oxidation induced by a negatively biased atomic force microscopy (AFM) tip operated with the non-contact mode were fabricated on p-GaAs(1 0 0) surface. The geometrical characteristics of the oxide patterns and their dependences on various fabrication parameters, e.g., the anodization time, the biased voltages, the tip scanning rates, as well as the formation mechanism and relevant growth kinetics are investigated. Results indicate that the height of the protruded oxide dots grow exponentially as a function of time in the initial stage of oxidation and soon reaches a maximum height depending linearly with the anodized voltages, in according with the behaviors predicted by space charge limited local oxidation mechanism. In addition, selective micro-Auger analysis of the anodized region reveals the formation of Ga(As)Ox, indicating the prominent role played by the field-induced nanometer-size water meniscus in producing the nanometer-scale oxide dots and bumps on p-GaAs(1 0 0) surface. 相似文献