全文获取类型
收费全文 | 364篇 |
免费 | 14篇 |
国内免费 | 2篇 |
专业分类
化学 | 199篇 |
晶体学 | 3篇 |
力学 | 10篇 |
数学 | 125篇 |
物理学 | 43篇 |
出版年
2023年 | 3篇 |
2022年 | 15篇 |
2021年 | 9篇 |
2020年 | 9篇 |
2019年 | 12篇 |
2018年 | 11篇 |
2017年 | 9篇 |
2016年 | 22篇 |
2015年 | 7篇 |
2014年 | 23篇 |
2013年 | 25篇 |
2012年 | 35篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 20篇 |
2008年 | 15篇 |
2007年 | 17篇 |
2006年 | 13篇 |
2005年 | 22篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 4篇 |
2001年 | 1篇 |
2000年 | 7篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 5篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1976年 | 2篇 |
1974年 | 1篇 |
排序方式: 共有380条查询结果,搜索用时 109 毫秒
21.
Evgenija A. Djurendić Olivera R. Klisurić Mihály Szécsi Marija N. Sakač Suzana S. Jovanović-Šanta Imre Ignáth Vesna V. Kojić Aleksandar M. Oklješa Marina P. Savić Katarina M. Penov-Gaši 《Structural chemistry》2014,25(6):1747-1758
Tetrakis-, tris-, bis-, and mono salicylic acid derivatives 1–4 were synthesized by reaction of methyl 2-hydroxy benzoate (methyl salicylate) with 2,2-bis (hydroxymethyl) propane-1,3-diol (pentaerythritol) in the presence of sodium. Yields of different salicyloyloxy derivatives were changed by varying the molar ratios of reactants. For compounds 2 and 3, X-ray structure analysis was performed, as well as molecular energy minimization, to define their conformation in terms of their energy minima. Comparison of crystal and energy minimized structures for these two compounds (2 and 3) revealed that the intramolecular hydrogen bonds play an important role, stabilizing conformation of the most part of the molecule. The antioxidant activity and cytotoxicity of the synthesized derivatives were evaluated in a series of in vitro tests, as well as 17β-hydroxysteroid dehydrogenase type 2 inhibition potency. Tetrakis salicyloyloxy derivative 1 expressed the highest antioxidant potency, tris salicyloyloxy derivative 2 was the best inhibitor of 17βHSD2 enzyme, while bis salicyloyloxy derivative 3 showed strong cytotoxicity against prostate and breast cancer cells with no cytotoxicity against healthy cells. 相似文献
22.
Electrochemical Oxidation of Donepezil and Its Voltammetric Determination at Gold Electrode
下载免费PDF全文
![点击此处可从《Electroanalysis》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Aleksandar R. Mladenović Dušan Ž. Mijin Saša Ž. Drmanić Vlatka E. Vajs Vladislava M. Jovanović Slobodan D. Petrović Milka L. Avramov Ivić 《Electroanalysis》2014,26(5):893-897
The oxidative ability of donepezil, a frequently prescribed drug for the treatment of Alzheimer’s disease is reported for the first time at a gold electrode. It was oxidized by cyclic voltammetry and determined by square wave voltammetry in phosphate buffer electrolyte. Electrochemical degradation of donepezil was carried out by long term potential cycling. The identification and characterization of the major product, isolated by preparative high performance liquid chromatography, was performed by high resolution mass spectrometry and 1D and 2D nuclear magnetic resonance spectroscopy. Donepezil hydroxy derivative was identified as the major electrochemical oxidation product from donepezil. 相似文献
23.
24.
25.
Aleksandar Donev Vasily V. Bulatov Tomas Oppelstrup George H. Gilmer Babak Sadigh Malvin H. Kalos 《Journal of computational physics》2010,229(9):3214-3236
We develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorithm presented here is based on the method introduced in Oppelstrup et al. [10] and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage hops sampled from exact time-dependent Green’s functions, without sacrificing accuracy. We describe in detail the key components of the algorithm, including the event-loop and the sampling of first-passage probability distributions, and demonstrate the accuracy of the new method. We apply the FPKMC algorithm to the challenging problem of simulation of long-term irradiation of metals, relevant to the performance and aging of nuclear materials in current and future nuclear power plants. The problem of radiation damage spans many decades of time-scales, from picosecond spikes caused by primary cascades, to years of slow damage annealing and microstructure evolution. Our implementation of the FPKMC algorithm has been able to simulate the irradiation of a metal sample for durations that are orders of magnitude longer than any previous simulations using the standard Object KMC or more recent asynchronous algorithms. 相似文献
26.
Aleksandar Ivić 《Central European Journal of Mathematics》2005,3(2):203-214
Let Δ(x) denote the error term in the Dirichlet divisor problem, and E(T) the error term in the asymptotic formula for the mean square of
. If E
*(t)=E(t)-2πΔ*(t/2π) with
, then we obtain
and
It is also shown how bounds for moments of | E
*(t)| lead to bounds for moments of
. 相似文献
27.
We computationally study jammed disordered hard-sphere packings as large as a million particles. We show that the packings are saturated and hyperuniform, i.e., that local density fluctuations grow only as a logarithmically augmented surface area rather than the volume of the window. The structure factor shows an unusual nonanalytic linear dependence near the origin, S(k) approximately |k|. In addition to exponentially damped oscillations seen in liquids, this implies a weak power-law tail in the total correlation function, h(r) approximately -r(-4), and a long-ranged direct correlation function c(r). 相似文献
28.
Let be a graph with diameter d 2. Recall is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of the distance partition{{z V() | (z, y) = i, (x, z) = j} | 0 i, j d}is equitable and its parameters do not depend on the edge xy. Let be 1-homogeneous. Then is distance-regular and also locally strongly regular with parameters (v,k,,), where v = k, k = a
1, (v – k – 1) = k(k – 1 – ) and c
2 + 1, since a -graph is a regular graph with valency . If c
2 = + 1 and c
2 1, then is a Terwilliger graph, i.e., all the -graphs of are complete. In [11] we classified the Terwilliger 1-homogeneous graphs with c
2 2 and obtained that there are only three such examples. In this article we consider the case c
2 = + 2 3, i.e., the case when the -graphs of are the Cocktail Party graphs, and obtain that either = 0, = 2 or is one of the following graphs: (i) a Johnson graph J(2m, m) with m 2, (ii) a folded Johnson graph J¯(4m, 2m) with m 3, (iii) a halved m-cube with m 4, (iv) a folded halved (2m)-cube with m 5, (v) a Cocktail Party graph K
m × 2 with m 3, (vi) the Schläfli graph, (vii) the Gosset graph. 相似文献
29.
Aleksandar Juri
i 《European Journal of Combinatorics》2000,21(8):1039
We find an inequality involving the eigenvalues of a regular graph; equality holds if and only if the graph is strongly regular. We apply this inequality to the first subconstituents of a distance-regular graph and obtain a simple proof of the fundamental bound for distance-regular graphs, discovered by Juri
i
, Koolen and Terwilliger. Using this we show that for distance-regular graphs with certain intersection arrays, the first subconstituent graphs are strongly regular. From these results we prove the nonexistence of distance-regular graphs associated to 20 feasible intersection arrays from the book Distance-Regular Graphs by Brouwer, Cohen and Neumaier . 相似文献
30.
Aleksandar Jurišić Jack Koolen Paul Terwilliger 《Journal of Algebraic Combinatorics》2000,12(2):163-197
We consider a distance-regular graph with diameter d 3 and eigenvalues k = 0 > 1 > ... >
d
. We show the intersection numbers a
1, b
1 satisfy
We say is tight whenever is not bipartite, and equality holds above. We characterize the tight property in a number of ways. For example, we show is tight if and only if the intersection numbers are given by certain rational expressions involving d independent parameters. We show is tight if and only if a
1 0, a
d = 0, and is 1-homogeneous in the sense of Nomura. We show is tight if and only if each local graph is connected strongly-regular, with nontrivial eigenvalues –1 – b
1(1 + 1)–1 and –1 – b
1(1 +
d
)–1. Three infinite families and nine sporadic examples of tight distance-regular graphs are given. 相似文献