@article{Liu2011,
  abstract = {Vehicular Ad Hoc Networks (VANET) are the foundation of Intelligent Traffic System (ITS), and recently many MAC protocols for VANET are proposed, among which a reliable MAC protocol called ADHOC has aroused much attention. By investigating the details of ADHOC protocol, we have discovered several unsolved problems that might lead to network failure. In this paper, we provide a quantitative analysis of the success probability for contending nodes and prove that an adaptive frame length is quite necessary. We propose Adaptive-ADHOC (A-ADHOC) MAC protocol, which implements a robust mechanism supporting the adaptive frame length. Evaluation result shows that A-ADHOC can maintain a high contending success probability and obtain about 50% reduction of response time over original ADHOC protocol, while providing important enhancement on network scalability and robustness.},
  added-at = {2012-02-14T04:46:15.000+0100},
  af = {Liu, JiaEOLEOLRen, FengyuanEOLEOLMiao, LiminEOLEOLLin, Chuang},
  author = {Liu, J. and Ren, F. Y. and Miao, L. M. and Lin, C.},
  biburl = {http://www.bibsonomy.org/bibtex/2477a84ce5fe1ef6d96ff7968b081b3ae/atriana},
  c1 = {[Liu, Jia; Ren, Fengyuan; Miao, Limin; Lin, Chuang] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China.},
  citedreferences = {Papadimitratos P, 2009, IEEE COMMUN MAG, V47, P84, DOI 10.1109/MCOM.2009.5307471 ; NIU Z, 2007, NETW SENS CONTR 2007 ; Menouar H, 2006, IEEE WIREL COMMUN, V13, P30 ; CHEN Q, 2006, 3 INT WORKSH VEH AD ; PARNO B, 2005, WORKSH HOT TOP NETW ; Borgonovo F, 2004, WIREL NETW, V10, P359, DOI 10.1023/B:WINE.0000028540.96160.8a ; LUO J, 2004, SURVEY INTERVEHICLE ; BERGAMO P, 2003, P INT TEL C ITC LAS ; KATRAGADDA S, 2003, 57 IEEE VEH TECHN C ; BORGONOVO F, 2002, P MED HOC NET ; SINGH JP, 2002, VEH TECHN C VTC ; VERDONE R, 1997, IEEE T VEH TECHNOL, V46, P992, DOI 10.1109/25.653073},
  de = {VANET; MAC protocol; TDMA; adaptive frame length},
  doi = {10.1007/s11036-010-0246-6},
  em = {jliu@csnet1.cs.tsinghua.edu.cnEOLEOLrenfy@csnet1.cs.tsinghua.edu.cnEOLEOLmmpire@gmail.comEOLEOLclin@csnet1.cs.tsinghua.edu.cn},
  fu = {National Natural Science Foundation of China (NSFC)[60773138, 60971102];EOLEOLNational Grand Fundamental Research Program of China (973)[2009CB320504,EOLEOL2006CB303000]; National High-Tech Research and Development Plan of ChinaEOLEOL(863)[2008AA01Z212]; National Science and Technology Major Project ofEOLEOLChina (NSTMP)[2009ZX03006-001-003, 2009ZX03006-003-01]},
  fx = {This work is supported in part by the National Natural ScienceEOLEOLFoundation of China (NSFC) under Grant No. 60773138, 60971102; theEOLEOLNational Grand Fundamental Research Program of China (973) under GrantEOLEOLNo. 2009CB320504, 2006CB303000; the National High-Tech Research andEOLEOLDevelopment Plan of China (863) under Grant No. 2008AA01Z212, andEOLEOLNational Science and Technology Major Project of China (NSTMP) underEOLEOLGrant No. 2009ZX03006-001-003 and 2009ZX03006-003-01.},
  ga = {828WM},
  groups = {public},
  interhash = {c72b21e62ae3429149718c84d0c9b0e7},
  intrahash = {477a84ce5fe1ef6d96ff7968b081b3ae},
  j9 = {MOBILE NETW APPL},
  ji = {Mobile Netw. Appl.},
  journal = {Mobile Networks \& Applications},
  keywords = {},
  la = {English},
  month = {#oct#},
  nr = {12},
  number = 5,
  pa = {VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS},
  pages = {576--585},
  pg = {10},
  pi = {DORDRECHT},
  publisher = {Springer},
  rp = {Ren, FY (reprint author), Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China},
  sc = {Computer Science; Telecommunications},
  si = {SI},
  sn = {1383-469X},
  tc = {0},
  timestamp = {2012.02.05},
  title = {A-ADHOC: An Adaptive Real-time Distributed MAC Protocol for Vehicular Ad Hoc Networks},
  username = {atriana},
  ut = {WOS:000295534900006},
  volume = 16,
  wc = {Computer Science, Hardware & Architecture; Computer Science, InformationEOLEOLSystems; Telecommunications},
  year = 2011,
  z9 = {0}
}

@inproceedings{bgkmow-ptaag-06,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Benkert, Marc and Gudmundsson, Joachim and Knauer, Christian and Moet, Esther and van Oostrum, Ren{\'e} and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/26502c7b4595a2b7cbf32608423ae5bea/awolff},
  booktitle = {Proc. 12th Annu. Int. Comput. Combinatorics
                  Conf. (COCOON'06)},
  confmonth = {{15--18~}#aug},
  doi = {10.1007/11809678_19},
  editor = {Chen, Danny Z. and Lee, Der-Tsai},
  interhash = {9cae32b65678dcdd311be7f9c98fa3c3},
  intrahash = {6502c7b4595a2b7cbf32608423ae5bea},
  keywords = {myown},
  location = {Taipei},
  pages = {166--175},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bgkmow-ptaag-06.pdf},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {A Polynomial-Time Approximation Algorithm for a
                  Geometric Dispersion Problem},
  url = {http://dx.doi.org/10.1007/11809678_19},
  volume = 4112,
  year = 2006
}

@inproceedings{bgkmow-ptaag-06i,
  added-at = {2012-02-13T15:23:25.000+0100},
  address = {Delphi},
  author = {Benkert, Marc and Gudmundsson, Joachim and Knauer, Christian and Moet, Esther and van Oostrum, Ren{\'e} and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/28d4ebf6d54abd0a510e912fa5ce73de3/awolff},
  booktitle = {Proc. 22nd European Workshop on Computational
                  Geometry (EWCG'06)},
  cites = {bf-agdp-98, epy-onng-97, fpt-opcpn-81, f-dpecp-91,
                  hm-ascpp-85, mfp-nrpec-95, r-pc-64, t-pc-04,
                  zt-rf-99, ZZZ},
  confmonth = {{27--29~}#mar},
  interhash = {9cae32b65678dcdd311be7f9c98fa3c3},
  intrahash = {8d4ebf6d54abd0a510e912fa5ce73de3},
  keywords = {myown},
  pages = {141--144},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bgkmow-ptaag-06i.pdf},
  precedes = {bgkmow-ptaag-06t},
  title = {A Polynomial-Time Approximation Algorithm for a
                  Geometric Dispersion Problem},
  year = 2006
}

@techreport{bgkmow-ptaag-06t,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Benkert, Marc and Gudmundsson, Joachim and Knauer, Christian and Moet, Esther and van Oostrum, Ren{\'e} and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/29c69bc4eeb958bd4d0a24b88ad4e9841/awolff},
  institution = {Fakult{\"a}t f{\"u}r Informatik, 
                Universit{\"a}t Karlsruhe},
  interhash = {9cae32b65678dcdd311be7f9c98fa3c3},
  intrahash = {9c69bc4eeb958bd4d0a24b88ad4e9841},
  keywords = {myown},
  note = {Available at
                  \path|http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005162|},
  number = {2006-8},
  precedes = {bgkow-ptaag-08},
  ps = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3232},
  title = {A Polynomial-Time Approximation Algorithm for a
                  Geometric Dispersion Problem},
  type = {Technical report},
  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005162},
  year = 2006
}

@article{bgkow-ptaag-09,
  abstract = {We consider the following packing problem. Let
                  $\alpha$ be a fixed real in $(0,1]$. We are given a
                  bounding rectangle $\rho$ and a set $\cal R$ of $n$
                  possibly intersecting unit disks whose centers lie
                  in~$\rho$. The task is to pack a set $\cal B$ of $m$
                  disjoint disks of radius $\alpha$ into $\rho$ such
                  that no disk in $\cal B$ intersects a disk in $\cal
                  R$, where $m$ is the maximum number of \emph{unit}
                  disks that can be packed. In this paper we present a
                  polynomial-time algorithm for $\alpha = 2/3$. So far
                  only the case of packing squares has been
                  considered. For that case Baur and Fekete have given
                  a polynomial-time algorithm for $\alpha=2/3$ and
                  have shown that the problem cannot be solved in
                  polynomial time for any $\alpha > 13/14$ unless
                  ${\cal P}={\cal NP}$.},
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Benkert, Marc and Gudmundsson, Joachim and Knauer, Christian and van Oostrum, Ren{\'e} and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/20d7ff7eaa93ca6ab0d3b6b2cf2e4610b/awolff},
  doi = {10.1142/S0218195909002952},
  interhash = {ed2b3dae1ddeaf6c99ad03d74dfa4804},
  intrahash = {0d7ff7eaa93ca6ab0d3b6b2cf2e4610b},
  journal = {International Journal of Computational Geometry and Applications},
  keywords = {myown geometric_packing approximation_algorithm APX-hard},
  number = 3,
  pages = {267--288},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bgkow-ptaag-09.pdf},
  succeeds = {bgkmow-ptaag-06t},
  title = {A Polynomial-Time Approximation Algorithm for a
                  Geometric Dispersion Problem},
  url = {http://dx.doi.org/10.1142/S0218195909002952},
  volume = 19,
  year = 2009
}

@inproceedings{bnsww-tspus-10,
  added-at = {2012-02-13T15:23:25.000+0100},
  address = {Nancy},
  author = {de Berg, Marc and van Nijnatten, Fred and Sitters, Ren{\'e} and Woeginger, Gerhard J. and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/217f609430834dbeca98189fe354a37c2/awolff},
  booktitle = {Proc. 27th Int. Sympos. Theoretical Aspects
                  Comput. Sci. (STACS'10)},
  editor = {Marion, Jean-Yves and Schwentick, Thomas},
  interhash = {c56230a84fcf8c1d3a0c009c90d1e6ec},
  intrahash = {17f609430834dbeca98189fe354a37c2},
  keywords = {myown},
  pages = {239--250},
  pdf = {http://arxiv.org/abs/1001.0236},
  slides = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/slides/bnsww-tspus-10-slides.pdf},
  title = {The Traveling Salesman Problem Under Squared
                  {Euclidean} Distances},
  url = {http://arxiv.org/pdf/1001.0236v3},
  year = 2010
}

@article{journals/titb/RenRMSK12,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Ren, Hongliang and Rank, Denis and Merdes, Martin and Stallkamp, Jan and Kazanzides, Peter},
  biburl = {http://www.bibsonomy.org/bibtex/29bc7d3e412dfb610a8c7a6564e2ce497/dblp},
  ee = {http://dx.doi.org/10.1109/TITB.2011.2164088},
  interhash = {780d5e1480fc9286787a0bb870116947},
  intrahash = {9bc7d3e412dfb610a8c7a6564e2ce497},
  journal = {IEEE Transactions on Information Technology in Biomedicine},
  keywords = {dblp},
  number = 1,
  pages = {106-111},
  title = {Multisensor Data Fusion in an Integrated Tracking System for Endoscopic Surgery.},
  url = {http://dblp.uni-trier.de/db/journals/titb/titb16.html#RenRMSK12},
  volume = 16,
  year = 2012
}

@inproceedings{conf/nlpke/Ren11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Ren, Fuji},
  biburl = {http://www.bibsonomy.org/bibtex/2e63ab0587eef0b7b8c657dab8a3eb979/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6137767},
  interhash = {999f423c4b662ce0a723c48977fc4571},
  intrahash = {e63ab0587eef0b7b8c657dab8a3eb979},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {1-8},
  publisher = {IEEE},
  title = {Robotics cloud and robotics school.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#Ren11},
  year = 2011
}

@inproceedings{conf/nlpke/FujiDNYTR11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Fuji, Shoko and Date, Mai and Nagai, Yuko and Yasuhara, Yuko and Tanioka, Tetsuya and Ren, Fuji},
  biburl = {http://www.bibsonomy.org/bibtex/200749c92a3d3798ffda4d0022a38a25c/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138243},
  interhash = {290d9d9eac66d031c0418f30b5d1d25a},
  intrahash = {00749c92a3d3798ffda4d0022a38a25c},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {459-463},
  publisher = {IEEE},
  title = {Research on the possibility of humanoid robots to assist in medical activities in nursing homes and convalescent wards.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#FujiDNYTR11},
  year = 2011
}

@inproceedings{conf/nlpke/QuanR11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Quan, Changqin and Ren, Fuji},
  biburl = {http://www.bibsonomy.org/bibtex/204c4681b2c98e804a17e2e4512f69df6/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138193},
  interhash = {14912819549b1a723770c007d996ff7d},
  intrahash = {04c4681b2c98e804a17e2e4512f69df6},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {194-198},
  publisher = {IEEE},
  title = {Selecting clause emotion for sentence emotion recognition.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#QuanR11},
  year = 2011
}

@inproceedings{conf/nlpke/XueHRML11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Xue, Jingfeng and Hu, Changzhen and Ren, Hongyu and Ma, Rui and Li, Jian},
  biburl = {http://www.bibsonomy.org/bibtex/2a7e69aeac4bac187a148d3133152167e/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138200},
  interhash = {042e7ab6355feb00d0e2ff26f96995ab},
  intrahash = {a7e69aeac4bac187a148d3133152167e},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {233-237},
  publisher = {IEEE},
  title = {Memory errors prevention technology for C/C++ program based on probability.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#XueHRML11},
  year = 2011
}

@inproceedings{conf/nlpke/KangR11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Kang, Xin and Ren, Fuji},
  biburl = {http://www.bibsonomy.org/bibtex/2a8a942384c51745adb286974e5f94821/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138166},
  interhash = {8b40cda71119ebfa720ec2418ebacaa4},
  intrahash = {a8a942384c51745adb286974e5f94821},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {37-42},
  publisher = {IEEE},
  title = {Sampling latent emotions and topics in a hierarchical Bayesian network.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#KangR11},
  year = 2011
}

@inproceedings{conf/nlpke/MatsumotoKR11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Matsumoto, Kazuyuki and Kita, Kenji and Ren, Fuji},
  biburl = {http://www.bibsonomy.org/bibtex/25c4ee3ba026da5291b3d56147119c1e9/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138197},
  interhash = {724aadcbe035e1cfd558232486bc576b},
  intrahash = {5c4ee3ba026da5291b3d56147119c1e9},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {214-220},
  publisher = {IEEE},
  title = {Emotion estimation of Wakamono Kotoba based on distance of word emotional vector.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#MatsumotoKR11},
  year = 2011
}

@inproceedings{conf/nlpke/TangRSC11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Tang, Yiming and Ren, Fuji and Sun, Xiao and Chen, Yanxiang},
  biburl = {http://www.bibsonomy.org/bibtex/20f20c0c8a108c26316dd9da12236795c/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138164},
  interhash = {a586cae0b223c78871c3eeef01db0c6c},
  intrahash = {0f20c0c8a108c26316dd9da12236795c},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {23-30},
  publisher = {IEEE},
  title = {Reverse universal triple I method of (1, 1, 2) type for the Lukasiewicz implication.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#TangRSC11},
  year = 2011
}

@inproceedings{conf/nlpke/JiangRWZ11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Jiang, Peilin and Ren, Fuji and Wang, Fei and Zheng, Nanning},
  biburl = {http://www.bibsonomy.org/bibtex/21a1fd16d449b9df7e51181c523e95263/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138220},
  interhash = {6eb2523bc1a5adea3c480780ecd5146d},
  intrahash = {1a1fd16d449b9df7e51181c523e95263},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {334-339},
  publisher = {IEEE},
  title = {Complex emotion categorization and tagging for Chinese.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#JiangRWZ11},
  year = 2011
}

@inproceedings{conf/nlpke/MiRA11,
  added-at = {2012-02-13T00:00:00.000+0100},
  author = {Mi, Liping and Ren, Fuji and Araki, Hideo},
  biburl = {http://www.bibsonomy.org/bibtex/2abc6e4c0a10e3f5dd164757a34fd32c6/dblp},
  booktitle = {NLPKE},
  crossref = {conf/nlpke/2011},
  ee = {http://dx.doi.org/10.1109/NLPKE.2011.6138195},
  interhash = {71c410fe104f07840fefe9d5a4ee8912},
  intrahash = {abc6e4c0a10e3f5dd164757a34fd32c6},
  isbn = {978-1-61284-729-0},
  keywords = {dblp},
  pages = {205-208},
  publisher = {IEEE},
  title = {Differences of Japanese kanji and kana during the memory processing.},
  url = {http://dblp.uni-trier.de/db/conf/nlpke/nlpke2011.html#MiRA11},
  year = 2011
}

@article{journals/icl/RenLH05,
  added-at = {2012-02-11T00:00:00.000+0100},
  author = {Ren, Fengyuan and Lin, Chuang and Huang, Xiaomeng},
  biburl = {http://www.bibsonomy.org/bibtex/23ae89abc841039212d8c34f7d51850de/dblp},
  ee = {http://dx.doi.org/10.1109/LCOMM.2005.1431175},
  interhash = {b4d2e174620d7e08f9e79899d846b933},
  intrahash = {3ae89abc841039212d8c34f7d51850de},
  journal = {IEEE Communications Letters},
  keywords = {dblp},
  number = 5,
  pages = {471-473},
  title = {TCC: a two-category classifier for AQM routers supporting TCP flows.},
  url = {http://dblp.uni-trier.de/db/journals/icl/icl9.html#RenLH05},
  volume = 9,
  year = 2005
}

@article{journals/icl/GuoYZWR05,
  added-at = {2012-02-11T00:00:00.000+0100},
  author = {Guo, Zihua and Yao, Richard and Zhu, Wenwu and Wang, Xin and Ren, Yong},
  biburl = {http://www.bibsonomy.org/bibtex/2749e44b72be5d33603f2a3556b157f35/dblp},
  ee = {http://dx.doi.org/10.1109/LCOMM.2005.03023},
  interhash = {e36d24698863e3ba4c4d10b5fc39366f},
  intrahash = {749e44b72be5d33603f2a3556b157f35},
  journal = {IEEE Communications Letters},
  keywords = {dblp},
  number = 3,
  pages = {228-230},
  title = {Intra-superframe power management for IEEE 802.15.3 WPAN.},
  url = {http://dblp.uni-trier.de/db/journals/icl/icl9.html#GuoYZWR05},
  volume = 9,
  year = 2005
}

@article{journals/icl/RenYHL06,
  added-at = {2012-02-10T00:00:00.000+0100},
  author = {Ren, Fengyuan and Yin, Xunhe and Huang, Xiaomeng and Lin, Chuang},
  biburl = {http://www.bibsonomy.org/bibtex/2d6dd318fb283fd5b00863a71e89a43a5/dblp},
  ee = {http://dx.doi.org/10.1109/LCOMM.2006.060111},
  interhash = {73e7833250f85d7f642bd7c4798848b8},
  intrahash = {d6dd318fb283fd5b00863a71e89a43a5},
  journal = {IEEE Communications Letters},
  keywords = {dblp},
  number = 12,
  pages = {858-860},
  title = {Designing a binary controller to enhance end-to-end congestion control.},
  url = {http://dblp.uni-trier.de/db/journals/icl/icl10.html#RenYHL06},
  volume = 10,
  year = 2006
}

@article{journals/imm/PeartonR12,
  added-at = {2012-02-10T00:00:00.000+0100},
  author = {Pearton, S. J. and Ren, Fan},
  biburl = {http://www.bibsonomy.org/bibtex/26b779fabc64a0abb482b5a2ed154c9d0/dblp},
  ee = {http://dx.doi.org/10.1109/MIM.2012.6145256},
  interhash = {d8ca19985e2e4033a61c26b172609eff},
  intrahash = {6b779fabc64a0abb482b5a2ed154c9d0},
  journal = {IEEE Instrum. Meas. Mag.},
  keywords = {dblp},
  number = 1,
  pages = {16-21},
  title = {Gallium nitride-based gas, chemical and biomedical sensors.},
  url = {http://dblp.uni-trier.de/db/journals/imm/imm15.html#PeartonR12},
  volume = 15,
  year = 2012
}