全文获取类型
收费全文 | 8539篇 |
免费 | 253篇 |
国内免费 | 62篇 |
专业分类
化学 | 5795篇 |
晶体学 | 84篇 |
力学 | 250篇 |
综合类 | 1篇 |
数学 | 1313篇 |
物理学 | 1411篇 |
出版年
2022年 | 82篇 |
2021年 | 82篇 |
2020年 | 156篇 |
2019年 | 112篇 |
2018年 | 84篇 |
2017年 | 94篇 |
2016年 | 186篇 |
2015年 | 151篇 |
2014年 | 194篇 |
2013年 | 395篇 |
2012年 | 456篇 |
2011年 | 558篇 |
2010年 | 281篇 |
2009年 | 223篇 |
2008年 | 495篇 |
2007年 | 457篇 |
2006年 | 443篇 |
2005年 | 447篇 |
2004年 | 429篇 |
2003年 | 285篇 |
2002年 | 308篇 |
2001年 | 89篇 |
2000年 | 84篇 |
1999年 | 64篇 |
1998年 | 79篇 |
1997年 | 99篇 |
1996年 | 139篇 |
1995年 | 85篇 |
1994年 | 69篇 |
1993年 | 96篇 |
1992年 | 68篇 |
1991年 | 81篇 |
1990年 | 77篇 |
1989年 | 58篇 |
1988年 | 71篇 |
1987年 | 62篇 |
1986年 | 54篇 |
1985年 | 114篇 |
1984年 | 132篇 |
1983年 | 92篇 |
1982年 | 113篇 |
1981年 | 108篇 |
1980年 | 92篇 |
1979年 | 82篇 |
1978年 | 108篇 |
1977年 | 93篇 |
1976年 | 81篇 |
1975年 | 68篇 |
1974年 | 68篇 |
1973年 | 58篇 |
排序方式: 共有8854条查询结果,搜索用时 15 毫秒
1.
Pengjin Qin Li-An Wang Prof. Joseph M. O'Connor Prof. Kim K. Baldridge Yifan Li Burak Tufekci Jiyue Chen Prof. Arnold L. Rheingold 《Angewandte Chemie (Weinheim an der Bergstrasse, Germany)》2020,132(41):18114-18121
Triene 6π electrocyclization, wherein a conjugated triene undergoes a concerted stereospecific cycloisomerization to a cyclohexadiene, is a reaction of great historical and practical significance. In order to circumvent limitations imposed by the normally harsh reaction conditions, chemists have long sought to develop catalytic variants based upon the activating power of metal–alkene coordination. Herein, we demonstrate the first successful implementation of such a strategy by utilizing [(C5H5)Ru(NCMe)3]PF6 as a precatalyst for the disrotatory 6π electrocyclization of highly substituted trienes that are resistant to thermal cyclization. Mechanistic and computational studies implicate hexahapto transition-metal coordination as responsible for lowering the energetic barrier to ring closure. This work establishes a foundation for the development of new catalysts for stereoselective electrocyclizations. 相似文献
2.
Optics and Spectroscopy - Scattering of light by disordered structures is normally detrimental to their applicability in many optoelectronic devices. However, some micro and nanostructures are... 相似文献
3.
In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself. 相似文献
4.
Summary Consider the solution of one-dimensional linear initial-boundary value problems by a finite element method of lines using a piecewiseP
th
-degree polynomial basis. A posteriori estimates of the discretization error are obtained as the solutions of either local parabolic or local elliptic finite element problems using piecewise polynomial corrections of degreep+1 that vanish at element ends. Error estimates computed in this manner are shown to converge in energy under mesh refinement to the exact finite element discretization error. Computational results indicate that the error estimates are robust over a wide range of mesh spacings and polynomial degrees and are, furthermore, applicable in situations that are not supported by the analysis.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 90-0194; by the U.S. Army Research Office under Contract Number DAAL03-91-G-0215; and by the National Science Foundation under Institutional Infrastructure Grant Number CDA-8805910 相似文献
5.
A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps. 相似文献
6.
Charles J. Colbourn Sosina S. Martirosyan Gary L. Mullen Dennis Shasha George B. Sherwood Joseph L. Yucas 《组合设计杂志》2006,14(2):124-138
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006 相似文献
7.
Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties)
polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with
the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes
for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken
into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional
case provides interesting classes of groups.
Received: 13 December 2001 / Revised version: 24 June 2002
The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107
Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20 相似文献
8.
9.
Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis. 相似文献
10.
Naus Joseph I. Wallenstein Sylvan 《Methodology and Computing in Applied Probability》2004,6(4):389-400
Researchers apply scan statistics to test for unusually large clusters of events within a time window of specified length w, or alternatively an unusually small window w that contains a specified number of events. In some cases, the researcher is interested in testing for a range of specified window lengths, or a set of several specified number of events k (cluster sizes). In this paper, we derive accurate approximations for the joint distributions of scan statistics for a range of values of w, or of k, that can be used to set an experiment-wide level of significance that takes into account the multiple comparisons involved. We use these methods to compare different ways of choosing the window sizes for the different cluster sizes. One special case is a multiple comparison procedure based on a generalized likelihood ratio test (GLRT) for a range of window sizes. We compare the power of the GLRT with another method for allocating the window sizes. We find that the GLRT is sensitive for very small window sizes at the expense of moderate and larger window sizes. We illustrate these results on two examples, one involving clustering of translocation breakpoints in DNA, and the other involving disease clusters. 相似文献