设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(160)
馆藏期刊(45)
Springer电子图书(122)
CNKI会议论文(61)
万方学位论文(23)
中国地质文献-英文(39)
馆藏书目(106)
院士团队服务(1)
CNKI学位论文(22852)
中国地质文献-中文(20)
地学标准(4)
综合电子资源(2)
CNKI期刊论文0611(89)
馆藏电子书[解放前](4)
地图图件(3)
万方学术会议(31)
知网期刊论文(24628)
在“
Elsevier电子期刊
”中,
命中:
7,591
条,耗时:小于0.01 秒
在所有数据库中总计命中:
48,190
条
1.
Rams
ey goodness of paths
作者:
Alexey Pokrovskiy
1
;
dr.alexey.pokrovskiy@gmail.com
;
Benny Sudakov
1
;
benjamin.sudakov@math.ethz.ch
关键词:
Rams
ey numbers
;
Rams
ey goodness
;
Paths in graphs
;
Expanders
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
2.
Ordered
Rams
ey numbers
作者:
David Conlon
a
;
1
;
david.conlon@maths.ox.ac.uk
;
Jacob Fox
b
;
2
;
jacobfox@stanford.edu
;
Choongbum Lee
c
;
3
;
cb_lee@math.mit.edu
;
Benny Sudakov
d
;
4
;
benjamin.sudakov@math.ethz.ch
关键词:
Rams
ey theory
;
Ordered graphs
;
Sparse graphs
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
3.
On the
Rams
ey-Turán number with small s-independence number
作者:
Patrick Bennett
patrick.bennett@wmich.edu
;
Andrzej Dudek
1
;
andrzej.dudek@wmich.edu
关键词:
Rams
ey
;
Turá
n ;
Finite geometries
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
4.
Fos expression in the olfactory pathway of high- and low-sexually performing
rams
exposed to urine from estrous or ovariectomized ewes
作者:
Amanda Jo Mirto
a
;
amirto@uwyo.edu
;
Kathleen Jeanette Austin
a
;
kaustin@uwyo.edu
;
Valerie Ann Uthlaut
a
;
Charles Eugene Roselli
b
;
rosellic@ohsu.edu
;
Brenda Mae Alexander
a
;
balex@uwyo.edu
关键词:
Rams
;
Sexual Behavior
;
Olfactory pathway
;
c-Fos
刊名:Applied Animal Behaviour Science
出版年:2017
5.
Star-critical
Rams
ey number of versus
作者:
Sh. Haghi
;
sh.haghi@yahoo.com
;
H.R. Maimani
maimani@ipm.ir
;
A. Seify
abbas.seify@gmail.com
关键词:
Rams
ey number
;
Star-critical
;
Fan
;
Complete graph
刊名:Discrete Applied Mathematics
出版年:2017
6.
Rams
ey-type theorems for sets satisfying a geometric regularity condition
作者:
P. Hagelstein
;
1
;
paul_hagelstein@baylor.edu" class="auth_mail" title="E-mail the corresponding author
;
D. Herden
daniel_herden@baylor.edu" class="auth_mail" title="E-mail the corresponding author
;
D. Young
2
;
daniel_young1@baylor.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
Rams
ey theory
;
Regularity condition
;
Maximal operators
刊名:Journal of Mathematical Analysis and Applications
出版年:2017
7.
Using Landsat images to quantify different human threats to the Shuangtai Estuary
Rams
ar site, China
作者:
Yanlin Tian
a
;
1
;
Ling Luo
a
;
1
;
Dehua Mao
a
;
maodehua@iga.ac.cn
;
Zongming Wang
a
;
zongmingwang@iga.ac.cn
;
Lin Li
b
;
Jianping Liang
a
关键词:
Remote sensing
;
Human threats
;
Wetland loss
;
Landscape metrics
;
The Shuangtai Estuary
Rams
ar site
刊名:Ocean & Coastal Management
出版年:2017
8.
Rams
ey numbers for degree monotone paths
作者:
Yair Caro
a
;
Raphael Yuster
b
;
Christina Zarb
c
;
christina.zarb@um.edu.mt
关键词:
Rams
ey
;
Degrees
;
Paths
刊名:Discrete Mathematics
出版年:2017
9.
Polarity graphs and
Rams
ey numbers for versus stars
作者:
Xuemei Zhang
a
;
b
;
Yaojun Chen
a
;
yaojunc@nju.edu.cn
;
T.C. Edwin Cheng
c
关键词:
Finite field
;
Polarity graph
;
Rams
ey number
;
Star
;
Quadrilateral
刊名:Discrete Mathematics
出版年:2017
10.
RAMS
ES: A new reference architecture for self-adaptive middleware in Wireless Sensor Networks
作者:
Jesú
;
s M.T. Portocarrero
a
Author Vitae
;
Flavia C. Delicato
a
;
Author Vitae
;
Paulo F. Pires
a
Author Vitae
;
Bruno Costa
a
Author Vitae
;
Wei Li
b
Author Vitae
;
Weisheng Si
c
Author Vitae
;
Albert Y. Zomaya
b
Author Vitae
关键词:
Wireless Sensor Networks
;
Middleware
;
Software architecture
;
Reference architecture
;
Autonomic computing
;
MAPE-K
;
Pi-ADL
刊名:Ad Hoc Networks
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(7591)
题名(892)
作者(4630)
关键词(682)
文摘(2540)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.