全文获取类型
收费全文 | 652篇 |
免费 | 26篇 |
国内免费 | 3篇 |
专业分类
化学 | 391篇 |
晶体学 | 1篇 |
力学 | 31篇 |
数学 | 170篇 |
物理学 | 88篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 18篇 |
2021年 | 28篇 |
2020年 | 7篇 |
2019年 | 13篇 |
2018年 | 8篇 |
2017年 | 15篇 |
2016年 | 24篇 |
2015年 | 23篇 |
2014年 | 27篇 |
2013年 | 28篇 |
2012年 | 51篇 |
2011年 | 49篇 |
2010年 | 51篇 |
2009年 | 37篇 |
2008年 | 35篇 |
2007年 | 48篇 |
2006年 | 34篇 |
2005年 | 20篇 |
2004年 | 30篇 |
2003年 | 15篇 |
2002年 | 10篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 11篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 7篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 5篇 |
1978年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有681条查询结果,搜索用时 15 毫秒
101.
We show that a spiral surface M in E3 is of finite type if and only if M is minimal Also, the plane is the only spiral surface in E3 whose the Gauss map G is of finite type, or satisfies the condition ΔG = ΛG, where Λ ∈ R3×3. 相似文献
102.
Grammati E. Pantziou Paul G. Spirakis Christos D. Zaroliagis 《BIT Numerical Mathematics》1992,32(2):215-236
Efficient parallel algorithms are presented, on the CREW PRAM model, for generating a succinct encoding of all pairs shortest path information in a directed planar graphG with real-valued edge costs but no negative cycles. We assume that a planar embedding ofG is given, together with a set ofq faces that cover all the vertices. Then our algorithm runs inO(log2
n) time and employsO(nq+M(q)) processors (whereM(t) is the number of processors required to multiply twot×t matrices inO(logt) time). Let us note here that wheneverq<n then our processor bound is better than the best previous one (M(n)).O(log2
n) time,n-processor algorithms are presented for various subproblems, including that of generating all pairs shortest path information in a directedouterplanar graph. Our work is based on the fundamental hammock-decomposition technique of G. Frederickson. We achieve this decomposition inO(logn log*n) parallel time by usingO(n) processors. The hammock-decomposition seems to be a fundamental operation that may help in improving efficiency of many parallel (and sequential) graph algorithms.This work was partially supported by the EEC ESPRIT Basic Research Action No. 3075 (ALCOM) and by the Ministry of Industry, Energy and Technology of Greece. 相似文献
103.
Misbah Ul Hasan Christos P. Tsonis 《Journal of polymer science. Part A, Polymer chemistry》1984,22(6):1349-1355
13C-NMR Spectroscopy has been used for the structural characterization of polybenzyls synthesized from the polymerization of benzyl chloride catalyzed by arene chromium tricarbonyls. The 13C-chemical shifts for various mono-, di-, tri-, and tetrasubstituted phenyl groups in a polybenzyl have been calculated by the use of additivity parameters and compared with their observed shifts. Although from a theroetical point of view, polysubstitution on a phenyl ring gives rise to a number of isomers, the results indicate the preferential formation of only a few of them due to steric and electronic considerations. Based on quantitative 13C-NMR data, several important structural parameters including the percentage of mono-, di-, tri-, and tetrasubstituted phenyl rings in the polybenzyl can be calculated. The extent of branching in a number of polybenzyls prepared under different experimental conditions was determined. The results indicate an increase in branching with the increase in reaction temperature. 相似文献
104.
We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than
when the edge lengths are allowed to be asymmetric and
when the edge lengths are symmetric, unless P=NP. The best previous lower bounds were
and
respectively. The reduction is from H?stad’s maximum satisfiability of linear equations modulo 2, and is nonconstructive.
* Supported in part by NSF ITR Grant CCR-0121555.
† Supported by NSF award CCR-0307536 and a Sloan foundation fellowship. 相似文献
105.
Christos A. Athanasiadis 《Order》2018,35(1):47-56
The symmetric group \(\mathfrak {S}_{n}\) acts naturally on the poset of injective words over the alphabet {1, 2,…,n}. The induced representation on the homology of this poset has been computed by Reiner and Webb. We generalize their result by computing the representation of \(\mathfrak {S}_{n}\) on the homology of all rank-selected subposets, in the sense of Stanley. A further generalization to the poset of r-colored injective words is given. 相似文献
106.
Simone Mastrogiovanni Christos Karathanasis Jonathan Gair Gregory Ashton Stefano Rinaldi Hsiang-Yu Huang Gergely Dálya 《Annalen der Physik》2024,536(2):2200180
Standard sirens have been the central paradigm in gravitational-wave cosmology so far. From the gravitational wave signature of compact star binaries, it is possible to measure the luminosity distance of the source directly, and if additional information on the source redshift is provided, a measurement of the cosmological expansion can be performed. This review article discusses several methodologies that have been proposed to use gravitational waves for cosmological studies. Methods that use only gravitational-wave signals and methods that use gravitational waves in conjunction with additional observations such as electromagnetic counterparts and galaxy catalogs will be discussed. The review also discusses the most recent results on gravitational-wave cosmology, starting from the binary neutron star merger GW170817 and its electromagnetic counterpart and finishing with the population of binary black holes, observed with the third Gravitational-wave Transient Catalog GWTC–3. 相似文献
107.
We study the graphs G for which their toric ideals I G are complete intersections. In particular, we prove that for a connected graph G such that I G is a complete intersection all of its blocks are bipartite except for at most two. We prove that toric ideals of graphs which are complete intersections are circuit ideals. In this case, the generators of the toric ideal correspond to even cycles of G except of at most one generator, which corresponds to two edge disjoint odd cycles joint at a vertex or with a path. We prove that the blocks of these graphs satisfy the odd cycle condition. Finally, we characterize all complete intersection toric ideals of graphs which are normal. 相似文献
108.
In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k?×?k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing. 相似文献
109.
Sanchez-Prado L Barro R Garcia-Jares C Llompart M Lores M Petrakis C Kalogerakis N Mantzavinos D Psillakis E 《Ultrasonics sonochemistry》2008,15(5):689-694
The sonochemical degradation of 5 μg l−1 triclosan, a priority micro-pollutant, in various environmental samples (seawater, urban runoff and influent domestic wastewater) as well as in model solutions (pure and saline water) was investigated. Experiments were conducted with a horn-type sonicator operating at 80 kHz frequency and a nominal applied power of 135 W, while solid-phase microextraction coupled with gas chromatography–electron capture detector (SPME/GC–ECD) was employed to monitor triclosan degradation. The latter followed pseudo-first order kinetics with the rate constant being (min−1): 0.2284 for seawater > 0.1051 for 3.5% NaCl in deionised water > 0.0597 for centrifuged urban runoff 0.0523 for untreated urban runoff > 0.0272 for deionised water > 0.0063 for wastewater influent. SPME/GC–ECD and SPME coupled with gas chromatography–mass spectrometry (SPME/GC–MS) were also used to check for the formation of chlorinated and other toxic by-products; at the conditions in question, the presence of such compounds was not confirmed. 相似文献
110.
Christoph Spahn Florian Hurter Mathilda Glaesmann Christos Karathanasis Marko Lampe Mike Heilemann 《Angewandte Chemie (International ed. in English)》2019,58(52):18835-18838
Photobleaching is a major challenge in fluorescence microscopy, in particular if high excitation light intensities are used. Signal‐to‐noise and spatial resolution may be compromised, which limits the amount of information that can be extracted from an image. Photobleaching can be bypassed by using exchangeable labels, which transiently bind to and dissociate from a target, thereby replenishing the destroyed labels with intact ones from a reservoir. Here, we demonstrate confocal and STED microscopy with short, fluorophore‐labeled oligonucleotides that transiently bind to complementary oligonucleotides attached to protein‐specific antibodies. The constant exchange of fluorophore labels in DNA‐based STED imaging bypasses photobleaching that occurs with covalent labels. We show that this concept is suitable for targeted, two‐color STED imaging of whole cells. 相似文献