全文获取类型
收费全文 | 3137篇 |
免费 | 120篇 |
国内免费 | 12篇 |
专业分类
化学 | 2410篇 |
晶体学 | 32篇 |
力学 | 54篇 |
数学 | 367篇 |
物理学 | 406篇 |
出版年
2023年 | 13篇 |
2022年 | 43篇 |
2021年 | 63篇 |
2020年 | 56篇 |
2019年 | 66篇 |
2018年 | 38篇 |
2017年 | 36篇 |
2016年 | 86篇 |
2015年 | 78篇 |
2014年 | 80篇 |
2013年 | 143篇 |
2012年 | 205篇 |
2011年 | 262篇 |
2010年 | 133篇 |
2009年 | 88篇 |
2008年 | 207篇 |
2007年 | 196篇 |
2006年 | 205篇 |
2005年 | 158篇 |
2004年 | 147篇 |
2003年 | 120篇 |
2002年 | 130篇 |
2001年 | 47篇 |
2000年 | 41篇 |
1999年 | 28篇 |
1998年 | 25篇 |
1997年 | 26篇 |
1996年 | 35篇 |
1995年 | 21篇 |
1994年 | 24篇 |
1993年 | 36篇 |
1992年 | 33篇 |
1991年 | 20篇 |
1990年 | 22篇 |
1989年 | 18篇 |
1988年 | 19篇 |
1987年 | 20篇 |
1986年 | 17篇 |
1985年 | 16篇 |
1984年 | 18篇 |
1983年 | 15篇 |
1982年 | 17篇 |
1981年 | 22篇 |
1980年 | 19篇 |
1979年 | 13篇 |
1978年 | 15篇 |
1976年 | 18篇 |
1974年 | 13篇 |
1973年 | 18篇 |
1969年 | 13篇 |
排序方式: 共有3269条查询结果,搜索用时 0 毫秒
1.
Monomeric sarcosine oxidase (mSOx) fusion with the silaffin peptide, R5, designed previously for easy protein production in low resource areas, was used in a biosilification process to form an enzyme layer electrode biosensor. mSOx is a low activity enzyme (10–20 U/mg) requiring high amounts of enzyme to obtain an amperometric biosensor signal, in the clinically useful range <1 mM sarcosine, especially since the Km is >10 mM. An amperometric biosensor model was fitted to experimental data to investigate dynamic range. mSOx constructs were designed with 6H (6×histidine) and R5 (silaffin) peptide tags and compared with native mSOx. Glutaraldehyde (GA) cross‐linked proteins retained ~5 % activity for mSOx and mSOx‐6H and only 0.5 % for mSOx‐R5. In contrast R5 catalysed biosilification on (3‐mercaptopropyl) trimethoxysilane (MPTMS) and tetramethyl orthosilicate (TMOS) particles created a ‘self‐immobilisation’ matrix retaining 40 % and 76 % activity respectively. The TMOS matrix produced a thick layer (>500 μm) on a glassy carbon electrode with a mediated current due to sarcosine in the clinical range for sarcosinemia (0–1 mM). The mSOx‐R5 fusion protein was also used to catalyse biosilification in the presence of creatinase and creatininase, entrapping all three enzymes. A mediated GC enzyme linked current was obtained with dynamic range available for creatinine determination of 0.1–2 mM for an enzyme layer ~800 nm. 相似文献
2.
Elizabeth S. Senger 《School science and mathematics》1997,97(3):139-149
Thirteen fifth graders were given an assignment to invent their own numeration systems, following a unit on bases and a look at early events in the history of numbers. The task presented options that required the students to make decisions (such as whether to use a base, which base to use, design of symbols, etc.), and build a rationale for the elements of their system. Analyses of patterns embedded in their invented systems provided an assessment of student understanding of numeration. The progression of more and less complex thinking related to the student's choice of a base other than 10, consistency of logic throughout the system in words and symbols, rationale for change, and perception of real life examples that would change if the system was adopted. The invention task is presented as another way to make connections. 相似文献
3.
Accreditation and Quality Assurance - 相似文献
4.
5.
Elizabeth Wulcan 《Arkiv f?r Matematik》2007,45(1):157-178
With a given holomorphic section of a Hermitian vector bundle, one can associate a residue current by means of Cauchy–Fantappiè–Leray
type formulas. In this paper we define products of such residue currents. We prove that, in the case of a complete intersection,
the product of the residue currents of a tuple of sections coincides with the residue current of the direct sum of the sections. 相似文献
6.
7.
Douglas R. White Jason Owen-Smith James Moody Walter W. Powell 《Computational & Mathematical Organization Theory》2004,10(1):95-117
Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field. 相似文献
8.
Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional
random vectors with various types of symmetries. In particular, we obtain results for distributions which are coordinatewise
symmetric, uniform in a regular simplex, or spherically symmetric. Our proofs are based on Stein’s method of exchangeable
pairs; as far as we know, this approach has not previously been used in convex geometry. The spherically symmetric case is
treated by a variation of Stein’s method which is adapted for continuous symmetries.
This work was done while at Stanford University. 相似文献
9.
In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm. 相似文献
10.