全文获取类型
收费全文 | 200篇 |
免费 | 23篇 |
国内免费 | 8篇 |
专业分类
化学 | 104篇 |
晶体学 | 5篇 |
力学 | 22篇 |
数学 | 55篇 |
物理学 | 45篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 10篇 |
2017年 | 11篇 |
2016年 | 11篇 |
2015年 | 13篇 |
2014年 | 11篇 |
2013年 | 7篇 |
2012年 | 10篇 |
2011年 | 7篇 |
2010年 | 10篇 |
2009年 | 8篇 |
2008年 | 10篇 |
2007年 | 6篇 |
2006年 | 12篇 |
2005年 | 3篇 |
2004年 | 5篇 |
2003年 | 3篇 |
2002年 | 6篇 |
2001年 | 12篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1987年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
排序方式: 共有231条查询结果,搜索用时 15 毫秒
21.
Nader Noroozi Pesyan Marziyeh Bagheri Ertan Şahin Tuncay Tunç 《Journal of the Iranian Chemical Society》2014,11(5):1429-1437
The use of DCC, triethylamine and 4-dimethylaminopyridine in dichloromethane provides a general and standard one-pot procedure for the O-acylation of cyclic β-dicarbonyl compound derivatives (1) with palmitic and stearic acids which have long hydrocarbon tails, to synthesis of new type of fatty acid derivative in good to excellent yields. Structure elucidation was carried out by FT-IR, 1H NMR and 13C NMR spectroscopy techniques. The acyl migration was also found in results and the corresponding structure was characterized by X-ray crystallography. A proposed mechanism was discussed for the formation of products. 相似文献
22.
Regioselective One‐pot Synthesis of New Unsymmetric Spiro Dihydrofurans in the Reaction of Mixed Two Different Cyclic β‐Dicarbonyl Compounds with BrCN and Aldehydes in the Presence of Et3N 下载免费PDF全文
Crossed one‐pot reaction of mixed cyclic β‐dicarbonyl with various aldehydes in the presence of cyano gen bromide and triethylamine leads to the selective and efficient formation of crossed new unsymmetri cal spiro dihydrofurans at room temperature. The products were obtained in good to excellent yields. Structure elucidation was carried out by 1H NMR, 13C NMR, FT‐IR spectroscopy, Mass analyses and X‐ray crystallography technique. A proposed mechanism was discussed for the formation of products. 相似文献
23.
Kwati Leonard Junichi Kurawaki Katumitu Hayakawa Myint Thein Tun Yoshihumi Kusumoto 《Colloid and polymer science》2009,287(7):773-778
Laser irradiation of copper(II) tetrasulfonated phthalocyanine (CuTsPc) microcrystals in poor organic solvents such as methanol,
2-methyl-2-propanol, ethanol, tetrahydrofuran, and acetone has produced CuTsPc nanoparticles with 15–112 nm in diameter. Field
emission scanning electron microscopy (FESEM) images have shown the formation of CuTsPc nanoparticles in poor organic solvents
used in this work. The mean diameters of CuTsPc nanoparticles obtained from transmission electron microscopy (TEM) images
in methanol, 2-methyl-2-propanol, ethanol, tetrahydrofuran, and acetone were determined to be 26, 36, 35, 86, and 78 nm, respectively.
A correlation between the size of CuTsPc nanoparticles and a solvent polarity could be found in this work. 相似文献
24.
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the approximation is moderate) self-concordant barriers. This approach extends the reach of the modern theory of interior-point methods, and lays the foundation for new ways to treat structured convex optimization problems with a very large number of constraints. Moreover, our approach provides a strong connection from the theory of self-concordant barriers to the combinatorial optimization literature on solving packing and covering problems. 相似文献
25.
26.
对多自由度带支撑Maxwell阻尼器减震结构的等效阻尼比进行了系统研究。构建了耗能结构一般微分和积分混合地震响应方程组;基于与多自由度随机平均法分析完全相同的等效准则,建立了耗能结构各振型等效阻尼比的一般解析计算式。与一些典型问题的模态应变能法的计算精度进行对比分析,结果显示:本文方法的计算结果在特定条件下与精确解完全相同;在一个二自由度系统中相对位移响应方差的误差分别为0.99%和0.45%,优于应变能法的8%和5.4%,表明了本文方法的有效性。从而为建立此类耗能结构等效阻尼分析的完备解析解法、直接应用反应谱法进行实际工程设计提供了依据。 相似文献
27.
We propose minimum volume ellipsoids (MVE) clustering as an alternative clustering technique to k-means for data clusters with ellipsoidal shapes and explore its value and practicality. MVE clustering allocates data points
into clusters in a way that minimizes the geometric mean of the volumes of each cluster’s covering ellipsoids. Motivations
for this approach include its scale-invariance, its ability to handle asymmetric and unequal clusters, and our ability to
formulate it as a mixed-integer semidefinite programming problem that can be solved to global optimality. We present some
preliminary empirical results that illustrate MVE clustering as an appropriate method for clustering data from mixtures of
“ellipsoidal” distributions and compare its performance with the k-means clustering algorithm as well as the MCLUST algorithm (which is based on a maximum likelihood EM algorithm) available
in the statistical package R.
Research of the first author was supported in part by a Discovery Grant from NSERC and a research grant from Faculty of Mathematics,
University of Waterloo. Research of the second author was supported in part by a Discovery Grant from NSERC and a PREA from
Ontario, Canada. 相似文献
28.
Lovász theta function and the related theta body of graphs have been in the center of the intersection of four research areas: combinatorial optimization, graph theory, information theory, and semidefinite optimization. In this paper, utilizing a modern convex optimization viewpoint, we provide a set of minimal conditions (axioms) under which certain key, desired properties are generalized, including the main equivalent characterizations of the theta function, the theta body of graphs, and the corresponding antiblocking duality relations. Our framework describes several semidefinite and polyhedral relaxations of the stable set polytope of a graph as generalized theta bodies. As a by-product of our approach, we introduce the notion of “Schur Lifting” of cones which is dual to PSD Lifting (more commonly used in SDP relaxations of combinatorial optimization problems) in our axiomatic generalization. We also generalize the notion of complements of graphs to diagonally scaling-invariant polyhedral cones. Finally, we provide a weighted generalization of the copositive formulation of the fractional chromatic number by Dukanovic and Rendl from 2010. 相似文献
29.
C.J. Tun C.H. Kuo Y.K. Fu C.W. Kuo Mitch M.C. Chou G.C. Chi 《Journal of Crystal Growth》2009,311(14):3726-3730
This study demonstrates a pure c-plane AlGaN epilayer grown on a γ-LiAlO2 (1 0 0) (LAO) substrate with an AlN nucleation layer grown at a relatively low temperature (LT-AlN) by metal-organic chemical vapor deposition (MOCVD). The AlGaN film forms polycrystalline film with m- and c-plane when the nucleation layer grows at a temperature ranging from 660 to 680 °C. However, a pure c-plane AlGaN film with an Al content of approximately 20% can be obtained by increasing the LT-AlN nucleation layer growth temperature to 700 °C. This is because the nuclei density of AlN increases as the growth temperature increases, and a higher nuclei density of AlN deposited on LAO substrate helps prevent the deposition of m-plane AlGaN. Therefore, high-quality and crack-free AlGaN films can be obtained with a (0 0 0 2) ω-rocking curve FWHM of 547 arcsec and surface roughness of 0.79 nm (root-mean-square) using a 700-°C-grown LT-AlN nucleation layer. 相似文献
30.
We study the lift-and-project procedures for solving combinatorial optimization problems, as described by Lovász and Schrijver, in the context of the stable set problem on graphs. We investigate how the procedures' performances change as we apply fundamental graph operations. We show that the odd subdivision of an edge and the subdivision of a star operations (as well as their common generalization, the stretching of a vertex operation) cannot decrease the N0-, N-, or N+-rank of the graph. We also provide graph classes (which contain the complete graphs) where these operations do not increase the N0- or the N-rank. Hence we obtain the ranks for these graphs, and we also present some graph-minor like characterizations for them. Despite these properties we give examples showing that in general most of these operations can increase these ranks. Finally, we provide improved bounds for N+-ranks of graphs in terms of the number of nodes in the graph and prove that the subdivision of an edge or cloning a vertex can increase the N+-rank of a graph.Research of these authors was supported in part by a PREA from Ontario, Canada and research grants from NSERC.Mathematics Subject Classification (2000): 0C10, 90C22, 90C27, 47D20 相似文献