全文获取类型
收费全文 | 137篇 |
免费 | 3篇 |
国内免费 | 7篇 |
专业分类
化学 | 60篇 |
晶体学 | 1篇 |
力学 | 2篇 |
数学 | 48篇 |
物理学 | 36篇 |
出版年
2023年 | 1篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 3篇 |
2014年 | 2篇 |
2013年 | 2篇 |
2012年 | 2篇 |
2011年 | 9篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2005年 | 2篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 3篇 |
2001年 | 9篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 1篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 11篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1976年 | 1篇 |
1974年 | 4篇 |
1972年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有147条查询结果,搜索用时 156 毫秒
81.
N. D. Lowhorn W. Wong-Ng W. Zhang Z. Q. Lu M. Otani E. Thomas M. Green T. N. Tran N. Dilley S. Ghamaty N. Elsner T. Hogan A. D. Downey Q. Jie Q. Li H. Obara J. Sharp C. Caylor R. Venkatasubramanian R. Willigan J. Yang J. Martin G. Nolas B. Edwards T. Tritt 《Applied Physics A: Materials Science & Processing》2009,94(2):231-234
A Standard Reference Material (SRM™) for the Seebeck coefficient is critical for inter-laboratory data comparison and for instrument calibration. To develop
this SRM™, we have conducted an international round-robin measurement survey of two candidate materials—undoped Bi2Te3 and constantan (55% Cu and 45% Ni alloy). Measurements were performed in two rounds by twelve laboratories involved in active
thermoelectric research using a number of commercial and custom-built measurement systems and techniques. We report the results
of these measurements and the statistical analysis performed. Based on this extensive study, we have selected Bi2Te3 as the prototype standard material. 相似文献
82.
83.
84.
In the following, we consider some cases where the point spectrum of an operator is either very stable or very unstable with respect to small perturbations of the operator. The main result is about the shift operator on whose point spectrum is what we will call strongly stable. We also give some general perturbation results, including a result about the size of the set of operators that have an eigenvalue.
85.
Anna A Herasimtschuk Samantha J Westrop Graeme J Moyle Jocelyn S Downey Nesrina Imami 《Journal of immune based therapies and vaccines》2008,6(1):7
Background
Efficacious immune-based therapy in treated chronic HIV-1 infection requires the induction of virus-specific CD4+ T cells and subsequent maturation and maintenance of specific memory CD8+ T cells. Concomitant daily administration of recombinant human growth hormone (rhGH) with highly active antiretroviral therapy (HAART) was used in chronically infected patients with lipodystrophy in an attempt to reconstitute these virus-specific T-cell responses. 相似文献86.
Infrared-to-visible wave-length conversion in the Yb3+−Er3+ doped phosphors system has been described by a simple three level model based on two ions mechanism. The excitation in the
range of 900–1000 nm of an IR-photon is first absorbed by Yb3+ ion as a sensitizer attributed to the resonant energy transition in Er3+ ion from 4
I
3/2 → 4
S
15/2 and 1
F
9/2 → 4
I
15/2, respectively for green and red emission. The essential energy transfer processes in this system i.e. upconversion from 4
I
11/2 and 1
I
13/2, cross-relaxation from 4
S
3/2 and 1
F
9/2 are taken into account. The limitations of the rate-equation approach are examined with a focus on the underlying dynamics
of this rare-earth system. 相似文献
87.
APPLICATION OF GENETIC ALGORITHM IN PARTICLE SIZE ANALYSIS BY MULTISPECTRAL EXTINCTION MEASUREMENTS 总被引:1,自引:0,他引:1
Gerard Grhan 《中国颗粒学报》2004,2(6):235-240
Both dependent and independent model algorithms are designed with genetic algorithm (GA) to retrieve aerosol size data from multispectral extinction measurements. Compared with the traditional dependent model algorithm, e.g., simplex, GA can locate the global optimized solution instead of local ones. As an independent model algonthm, when combined with B-splines, GA gives consistent results with Chahine and Phillip-Twomey-NNLS algorithms. Numerical simulations also show that GA has high stability and good resistance to relatively higher error levels. For a population size of 50 in the present paper, the feasible ranges for genetic operators Pc and pm are found to be [0.01, 0.5] and [0.01, 0.15], respectively, and the generation number Gen_Max should be larger than 250. 相似文献
88.
There are noncomputable c.e. sets, computable from every c.e. set relative to which ∅′ is strongly jump-traceable. This yields a natural pseudo-jump operator, increasing on all sets, which cannot be inverted back to a minimal pair or even avoiding an upper cone. 相似文献
89.
LI YingQiu HU YangLi & LIU QuanSheng College of Mathematics Computing Sciences Changsha University of Science Technology Changsha China College of Mathematics Computer Sciences Hunan Normal University Changsha LMAM University of Bretgne-Sud BP Vannes France 《中国科学 数学(英文版)》2011,(7)
Let W be the limit of the normalized population size of a supercritical branching process in a varying or random environment. By an elementary method, we find sufficient conditions under which W has finite weighted moments of the form EWpl(W), where p > 1, l 0 is a concave or slowly varying function. 相似文献
90.
Liming Cai Jianer Chen Rodney G. Downey Michael R. Fellows 《Archive for Mathematical Logic》1997,36(4-5):321-337
A completeness theory for parameterized computational complexity has been studied in a series of recent papers, and has been
shown to have many applications in diverse problem domains including familiar graph-theoretic problems, VLSI layout, games,
computational biology, cryptography, and computational learning [ADF,BDHW,BFH, DEF,DF1-7,FHW,FK]. We here study the parameterized
complexity of two kinds of problems: (1) problems concerning parameterized computations of Turing machines, such as determining
whether a nondeterministic machine can reach an accept state in steps (the Short TM Computation Problem), and (2) problems concerning derivations and factorizations, such as determining whether a word can be derived in a grammar in steps, or whether a permutation has a factorization of length over a given set of generators. We show hardness and completeness for these problems for various levels of the hierarchy. In particular, we show that Short TM Computation is complete for . This gives a new and useful characterization of the most important of the apparently intractable parameterized complexity
classes.
Received August 1, 1994 相似文献