首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   90篇
  免费   3篇
化学   31篇
数学   49篇
物理学   13篇
  2022年   3篇
  2019年   1篇
  2018年   2篇
  2017年   2篇
  2016年   1篇
  2015年   2篇
  2014年   3篇
  2013年   7篇
  2012年   3篇
  2011年   4篇
  2010年   4篇
  2009年   8篇
  2008年   6篇
  2007年   1篇
  2006年   6篇
  2005年   1篇
  2004年   4篇
  2003年   2篇
  2002年   1篇
  2001年   2篇
  2000年   3篇
  1999年   1篇
  1997年   4篇
  1996年   1篇
  1995年   3篇
  1994年   3篇
  1993年   1篇
  1992年   1篇
  1991年   5篇
  1990年   4篇
  1989年   1篇
  1982年   1篇
  1981年   1篇
  1978年   1篇
排序方式: 共有93条查询结果,搜索用时 282 毫秒
1.
Novel self-assembled monolayers were obtained on silver using 4,7-diazaheptyl-trimethoxy-silane (SiN) and vinyl-trialkoxy-silane (SiVA, where the alkyl group is 3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60-eicozaoxa- hexaheptaconan). It was shown that thus modified metal surface was protected against electrooxidation. A densely packed monolayer remained stable and did not desorb from the Ag electrode on the potential cycling. The structure of SiN and SiVA as well as their complexes with Li+ cations were calculated and visualised by the AM1d and PM5 semi-empirical methods.  相似文献   
2.
The n-dimensional cube Qn is the graph whose vertices are the subsets of {1,…n}, with two vertices adjacent if and only if their symmetric difference is a singleton. Clearly Qn has diameter and radious n. Write M = n2n-1 = e(Qn) for the size of Qn. Let Q = (Qt)oM be a random Qn-process. Thus Qt is a spanning subgraph of Qn of size t, and Qt is obtained from Qt–1 by the random addition of an edge of Qn not in Qt–1, Let t(k) = τ(Q;δ?k) be the hitting time of the property of having minimal degree at least k. We show that the diameter dt = diam (Qt) of Qt in almost every Q? behaves as follows: dt starts infinite and is first finite at time t(1), it equals n + 1 for t(1) ? t(2) and dt, = n for t ? t(2). We also show that the radius of Qt, is first finite for t = t(1), when it assumes the value n. These results are deduced from detailed theorems concerning the diameter and radius of the almost surely unique largest component of Qt, for t = Ω(M). © 1994 John Wiley & Sons, Inc.  相似文献   
3.
Two lactates and four new mixed ligand complexes with formulae Co(lact)2·2H2O, Ni(lact)2·3H2O, Co(4-bpy)(lact)2, Co(2,4'-bpy)2(lact)2, Ni(4-bpy)(lact)2·2H2O and Ni(2,4'-bpy)2(lact)2 (where 4-bpy=4,4'-bipyridine, 2,4'-bpy=2,4'-bipyridine, lact=CH3CH(OH)COO-) were isolated and investigated. The thermal behaviour of compounds was studied by thermal analysis (TG, DTG, DTA). In the case of hydrated complexes thermal decomposition starts with the release of water molecules. The compounds decompose at high temperature to metal(II) oxides in air. A coupled TG-MS system was used to analyse the principal volatile products of thermolysis and fragmentation processes of obtained complexes. This revised version was published online in July 2006 with corrections to the Cover Date.  相似文献   
4.
Electrooxidation of norepinephrine in the presence a nucleophile was investigated on a bare gold electrode. Electrochemically produced norepinephrinequinone undergoes an attack by morpholine as nucleophile via 1,4‐Michael addition. The reaction products were identified by electrospray ionization mass spectrometry. The procedure used was suitable for quantitative norepinephrine determination in the concentration range from 1×10?9 M to 8×10?4 M with a detection limit of 8.7×10?10 M in a samples containing an excess of ascorbic and uric acids. The proposed method is simple, green which means that it does not require the use of toxic compounds and solvents and thus is promising for detection of norepinephrine in physiological environment.  相似文献   
5.
6.
7.
Colorful flowers     
For a set A let k[A] denote the family of all k-element subsets of A. A function f:k[A]→C is a local coloring if it maps disjoint sets of A into different elements of C. A family Fk[A] is called a flower if there exists E∈[A]k−1 so that |FF|=E for all F,FF, FF. A flower is said to be colorful if f(F)≠f(F) for any two F,FF. In the paper we find the smallest cardinal γ such that there exists a local coloring of k[A] containing no colorful flower of size γ. As a consequence we answer a question raised by Pelant, Holický and Kalenda. We also discuss a few results and conjectures concerning a generalization of this problem.  相似文献   
8.
We show that every 3‐connected claw‐free graph which contains no induced copy of P11 is hamiltonian. Since there exist non‐hamiltonian 3‐connected claw‐free graphs without induced copies of P12 this result is, in a way, best possible. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 111–121, 2004  相似文献   
9.
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd?s‐Rényi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with m edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for m = 1, and there is some nonnegligible probability of symmetry for m = 2. It was conjectured that these graphs are asymmetric when m ≥ 3. We settle this conjecture in the affirmative, then use it to estimate the structural entropy of the model. To do this, we also give bounds on the number of ways that the given graph structure could have arisen by preferential attachment. These results have further implications for information theoretic problems of interest on preferential attachment graphs.  相似文献   
10.
Adsorptive behaviour of the methylamine molecules has been investigated by measuring changes in the differential capacitance of the double layer at the gold/solution interface by the tensammetric method. The differences in adsorption parameters at Θ < 0.8 and >0.8 have been explained by changes in arrangement of the adsorbate.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号