全文获取类型
收费全文 | 277篇 |
免费 | 22篇 |
国内免费 | 2篇 |
专业分类
化学 | 157篇 |
力学 | 5篇 |
数学 | 101篇 |
物理学 | 38篇 |
出版年
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 6篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 18篇 |
2013年 | 11篇 |
2012年 | 22篇 |
2011年 | 28篇 |
2010年 | 15篇 |
2009年 | 9篇 |
2008年 | 29篇 |
2007年 | 18篇 |
2006年 | 18篇 |
2005年 | 15篇 |
2004年 | 12篇 |
2003年 | 10篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1984年 | 4篇 |
1982年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有301条查询结果,搜索用时 15 毫秒
11.
We demonstrate that both oxyhemoglobin and deoxyhemoglobin have sequential two-color, two-photon absorption properties that can serve as endogenous contrasts in microvasculature imaging. Using a sensitive modulation transfer technique, we are able to image hemoglobin in red blood cells with micrometer resolution, both in vitro and in vivo. We show that excellent contrast from hemoglobin without any labeling can be obtained in tissue. 相似文献
12.
Dr. Koushik Chandra Dr. Tapta Kanchan Roy Dr. Deborah E. Shalev Prof. Abraham Loyter Prof. Chaim Gilon Prof. R. Benny Gerber Prof. Assaf Friedler 《Angewandte Chemie (International ed. in English)》2014,53(36):9450-9455
We present a new approach for peptide cyclization during solid phase synthesis under highly acidic conditions. Our approach involves simultaneous in situ deprotection, cyclization and trifluoroacetic acid (TFA) cleavage of the peptide, which is achieved by forming an amide bond between a lysine side chain and a succinic acid linker at the peptide N‐terminus. The reaction proceeds via a highly active succinimide intermediate, which was isolated and characterized. The structure of a model cyclic peptide was solved by NMR spectroscopy. Theoretical calculations support the proposed mechanism of cyclization. Our new methodology is applicable for the formation of macrocycles in solid‐phase synthesis of peptides and organic molecules. 相似文献
13.
Prof. Ashok R. Patel Nick Cludts Mohd Dona Bin Sintang Benny Lewille Ans Lesaffer Prof. Koen Dewettinck 《Chemphyschem》2014,15(16):3435-3439
The preparation and characterization of oleogels structured by using a combination of a surface‐active and a non‐surface‐active polysaccharide through an emulsion‐templated approach is reported. Specifically, the oleogels were prepared by first formulating a concentrated oil‐in‐water emulsion, stabilized with a combination of cellulose derivatives and xanthan gum, followed by the selective evaporation of the continuous water phase to drive the network formation, resulting in an oleogel with a unique microstructure and interesting rheological properties, including a high gel strength, G′>4000 Pa, shear sensitivity, good thixotropic recovery, and good thermostability. 相似文献
14.
15.
Béla?BollobásEmail author David?Gamarnik Oliver?Riordan Benny?Sudakov? 《Combinatorica》2004,24(2):187-207
Consider a complete graph on n vertices with edge weights chosen randomly and independently from an exponential distribution with parameter 1. Fix k vertices and consider the minimum weight Steiner tree which contains these vertices. We prove that with high probability the weight of this tree is (1+o(1))(k-1)(log n-log k)/n when k =o(n) and n.* Research supported in part by NSF grant DSM9971788 Research supported in part by NSF grants DMS-0106589, CCR-9987845 and by the State of New Jersey. Part of this research was done while visiting IBM T. J. Watson Research Center. 相似文献
16.
The Number of Edge Colorings with no Monochromatic Cliques 总被引:1,自引:0,他引:1
Alon Noga; Balogh Jozsef; Keevash Peter; Sudakov Benny 《Journal London Mathematical Society》2004,70(2):273-288
Let F(n,r,k) denote the maximum possible number of distinctedge-colorings of a simple graph on n vertices with r colorswhich contain no monochromatic copy of Kk. It is shown thatfor every fixed k and all n>n0(k), and , where tk1(n)is the maximum possible number of edges of a graph on n verticeswith no Kk (determined by Turán's theorem). The caser=2 settles an old conjecture of Erds and Rothschild, whichwas also independently raised later by Yuster. On the otherhand, for every fixed r>3 and k>2, the function F(n,r,k)is exponentially bigger than . The proofs are based on Szemerédi's regularity lemmatogether with some additional tools in extremal graph theory,and provide one of the rare examples of a precise result provedby applying this lemma. 相似文献
17.
In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a d‐regular graph G on n vertices satisfies and n is large enough, then G is Hamiltonian. We also show how our main result can be used to prove that for every c >0 and large enough n a Cayley graph X (G,S), formed by choosing a set S of c log5 n random generators in a group G of order n, is almost surely Hamiltonian. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 17–33, 2003 相似文献
18.
Mitchell J. Feigenbaum Itamar Procaccia Benny Davidovich 《Journal of statistical physics》2001,103(5-6):973-1007
We study the dynamics of “finger” formation in Laplacian growth without surface tension in a channel geometry (the Saffman–Taylor problem). We present a pedagogical derivation of the dynamics of the conformal map from a strip in the complex plane to the physical channel. In doing so we pay attention to the boundary conditions (no flux rather than periodic) and derive a field equation of motion for the conformal map. We first consider an explicit analytic class of conformal maps that form a basis for solutions in infinitely long channels, characterized by meromorphic derivatives. The great bulk of these solutions can lose conformality due to finite time singularities. By considerations of the nature of the analyticity of these solutions, we show that those solutions which are free of such singularities inevitably result in a single asymptotic “finger” whose width is determined by initial conditions. This is in contradiction with the experimental results that indicate selection of a finger of width 1/2. In the last part of this paper we show that such a solution might be determined by the boundary conditions of a finite body of fluid, e.g. finiteness can lead to pattern selection. 相似文献
19.
Poem E Kenneth O Kodriano Y Benny Y Khatsevich S Avron JE Gershoni D 《Physical review letters》2011,107(8):087401
We demonstrate control over the spin state of a semiconductor quantum dot exciton using a polarized picosecond laser pulse slightly detuned from a biexciton resonance. The control pulse follows an earlier pulse, which generates an exciton and initializes its spin state as a coherent superposition of its two nondegenerate eigenstates. The control pulse preferentially couples one component of the exciton state to the biexciton state, thereby rotating the exciton's spin direction. We detect the rotation by measuring the polarization of the exciton spectral line as a function of the time difference between the two pulses. We show experimentally and theoretically how the angle of rotation depends on the detuning of the second pulse from the biexciton resonance. 相似文献
20.
Let n, k, and t be integers satisfying . A Steiner system with parameters t, k, and n is a k‐uniform hypergraph on n vertices in which every set of t distinct vertices is contained in exactly one edge. An outstanding problem in Design Theory is to determine whether a nontrivial Steiner system exists for . In this note we prove that for every and sufficiently large n, there exists an almost Steiner system with parameters t, k, and n; that is, there exists a k‐uniform hypergraph on n vertices such that every set of t distinct vertices is covered by either one or two edges. 相似文献