BibSonomyburst/author/RenBibSonomy RSS feed for /author/Ren2012-02-15T01:06:00+01:00http://www.bibsonomy.org/bibtex/2477a84ce5fe1ef6d96ff7968b081b3ae/atrianaatriana2012-02-14T04:46:15+01:00<span class="authorEditorList"><a href="/author/Liu">J. Liu</a>, <a href="/author/Ren">F. Y. Ren</a>, <a href="/author/Miao">L. M. Miao</a>, and <a href="/author/Lin">C. Lin</a> </span><em>Mobile Networks \&amp; Applications</em> <em>16(5):576--585</em> (<em>October 2011</em>)Tue Feb 14 04:46:15 CET 2012Mobile Networks \& Applications#oct#5576--585A-ADHOC: An Adaptive Real-time Distributed MAC Protocol for Vehicular Ad Hoc Networks162011Vehicular 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.http://www.bibsonomy.org/bibtex/26502c7b4595a2b7cbf32608423ae5bea/awolffawolff2012-02-13T15:23:25+01:00myown <span class="authorEditorList"><a href="/author/Benkert">Marc Benkert</a>, <a href="/author/Gudmundsson">Joachim Gudmundsson</a>, <a href="/author/Knauer">Christian Knauer</a>, <a href="/author/Moet">Esther Moet</a>, <a href="/author/van Oostrum">René van Oostrum</a>, and <a href="/author/Wolff">Alexander Wolff</a> </span><em>Proc. 12th Annu. Int. Comput. Combinatorics Conf. COCOON&#039;06, </em><em>volume 4112 of Lecture Notes in Computer Science, </em><em>page 166--175. </em><em>Springer-Verlag, </em>(<em>2006</em>)Mon Feb 13 15:23:25 CET 2012Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON'06)166--175Lecture Notes in Computer ScienceA Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem41122006myown http://www.bibsonomy.org/bibtex/28d4ebf6d54abd0a510e912fa5ce73de3/awolffawolff2012-02-13T15:23:25+01:00myown <span class="authorEditorList"><a href="/author/Benkert">Marc Benkert</a>, <a href="/author/Gudmundsson">Joachim Gudmundsson</a>, <a href="/author/Knauer">Christian Knauer</a>, <a href="/author/Moet">Esther Moet</a>, <a href="/author/van Oostrum">René van Oostrum</a>, and <a href="/author/Wolff">Alexander Wolff</a> </span><em>Proc. 22nd European Workshop on Computational Geometry EWCG&#039;06, </em><em>page 141--144. </em><em>Delphi, </em>(<em>2006</em>)Mon Feb 13 15:23:25 CET 2012DelphiProc. 22nd European Workshop on Computational Geometry (EWCG'06)141--144A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem2006myown http://www.bibsonomy.org/bibtex/29c69bc4eeb958bd4d0a24b88ad4e9841/awolffawolff2012-02-13T15:23:25+01:00myown <span class="authorEditorList"><a href="/author/Benkert">Marc Benkert</a>, <a href="/author/Gudmundsson">Joachim Gudmundsson</a>, <a href="/author/Knauer">Christian Knauer</a>, <a href="/author/Moet">Esther Moet</a>, <a href="/author/van Oostrum">René van Oostrum</a>, and <a href="/author/Wolff">Alexander Wolff</a> </span><em>Technical report, </em><em>2006-8. </em><em>Fakultät für Informatik, Universität Karlsruhe, </em>(<em>2006</em>)Mon Feb 13 15:23:25 CET 2012Available at \path|http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005162|2006-8A Polynomial-Time Approximation Algorithm for a Geometric Dispersion ProblemTechnical report2006myown http://www.bibsonomy.org/bibtex/20d7ff7eaa93ca6ab0d3b6b2cf2e4610b/awolffawolff2012-02-13T15:23:25+01:00myown geometric_packing approximation_algorithm APX-hard <span class="authorEditorList"><a href="/author/Benkert">Marc Benkert</a>, <a href="/author/Gudmundsson">Joachim Gudmundsson</a>, <a href="/author/Knauer">Christian Knauer</a>, <a href="/author/van Oostrum">René van Oostrum</a>, and <a href="/author/Wolff">Alexander Wolff</a> </span><em>International Journal of Computational Geometry and Applications</em> <em>19(3):267--288</em> (<em>2009</em>)Mon Feb 13 15:23:25 CET 2012International Journal of Computational Geometry and Applications3267--288A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem192009myown geometric_packing approximation_algorithm APX-hard 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}$.http://www.bibsonomy.org/bibtex/217f609430834dbeca98189fe354a37c2/awolffawolff2012-02-13T15:23:25+01:00myown <span class="authorEditorList"><a href="/author/de Berg">Marc de Berg</a>, <a href="/author/van Nijnatten">Fred van Nijnatten</a>, <a href="/author/Sitters">René Sitters</a>, <a href="/author/Woeginger">Gerhard J. Woeginger</a>, and <a href="/author/Wolff">Alexander Wolff</a> </span><em>Proc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. STACS&#039;10, </em><em>page 239--250. </em><em>Nancy, </em>(<em>2010</em>)Mon Feb 13 15:23:25 CET 2012NancyProc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS'10)239--250The Traveling Salesman Problem Under Squared {Euclidean} Distances2010myown http://www.bibsonomy.org/bibtex/29bc7d3e412dfb610a8c7a6564e2ce497/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Ren">Hongliang Ren</a>, <a href="/author/Rank">Denis Rank</a>, <a href="/author/Merdes">Martin Merdes</a>, <a href="/author/Stallkamp">Jan Stallkamp</a>, and <a href="/author/Kazanzides">Peter Kazanzides</a> </span><em>IEEE Transactions on Information Technology in Biomedicine</em> <em>16(1):106-111</em> (<em>2012</em>)Mon Feb 13 00:00:00 CET 2012IEEE Transactions on Information Technology in Biomedicine1106-111Multisensor Data Fusion in an Integrated Tracking System for Endoscopic Surgery.162012dblp http://www.bibsonomy.org/bibtex/2e63ab0587eef0b7b8c657dab8a3eb979/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Ren">Fuji Ren</a> </span><em>NLPKE, </em><em>page 1-8. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/20111-8Robotics cloud and robotics school.2011dblp http://www.bibsonomy.org/bibtex/200749c92a3d3798ffda4d0022a38a25c/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Fuji">Shoko Fuji</a>, <a href="/author/Date">Mai Date</a>, <a href="/author/Nagai">Yuko Nagai</a>, <a href="/author/Yasuhara">Yuko Yasuhara</a>, <a href="/author/Tanioka">Tetsuya Tanioka</a>, and <a href="/author/Ren">Fuji Ren</a> </span><em>NLPKE, </em><em>page 459-463. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/2011459-463Research on the possibility of humanoid robots to assist in medical activities in nursing homes and convalescent wards.2011dblp http://www.bibsonomy.org/bibtex/204c4681b2c98e804a17e2e4512f69df6/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Quan">Changqin Quan</a>, and <a href="/author/Ren">Fuji Ren</a> </span><em>NLPKE, </em><em>page 194-198. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/2011194-198Selecting clause emotion for sentence emotion recognition.2011dblp http://www.bibsonomy.org/bibtex/2a7e69aeac4bac187a148d3133152167e/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Xue">Jingfeng Xue</a>, <a href="/author/Hu">Changzhen Hu</a>, <a href="/author/Ren">Hongyu Ren</a>, <a href="/author/Ma">Rui Ma</a>, and <a href="/author/Li">Jian Li</a> </span><em>NLPKE, </em><em>page 233-237. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/2011233-237Memory errors prevention technology for C/C++ program based on probability.2011dblp http://www.bibsonomy.org/bibtex/2a8a942384c51745adb286974e5f94821/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Kang">Xin Kang</a>, and <a href="/author/Ren">Fuji Ren</a> </span><em>NLPKE, </em><em>page 37-42. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/201137-42Sampling latent emotions and topics in a hierarchical Bayesian network.2011dblp http://www.bibsonomy.org/bibtex/25c4ee3ba026da5291b3d56147119c1e9/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Matsumoto">Kazuyuki Matsumoto</a>, <a href="/author/Kita">Kenji Kita</a>, and <a href="/author/Ren">Fuji Ren</a> </span><em>NLPKE, </em><em>page 214-220. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/2011214-220Emotion estimation of Wakamono Kotoba based on distance of word emotional vector.2011dblp http://www.bibsonomy.org/bibtex/20f20c0c8a108c26316dd9da12236795c/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Tang">Yiming Tang</a>, <a href="/author/Ren">Fuji Ren</a>, <a href="/author/Sun">Xiao Sun</a>, and <a href="/author/Chen">Yanxiang Chen</a> </span><em>NLPKE, </em><em>page 23-30. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/201123-30Reverse universal triple I method of (1, 1, 2) type for the Lukasiewicz implication.2011dblp http://www.bibsonomy.org/bibtex/21a1fd16d449b9df7e51181c523e95263/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Jiang">Peilin Jiang</a>, <a href="/author/Ren">Fuji Ren</a>, <a href="/author/Wang">Fei Wang</a>, and <a href="/author/Zheng">Nanning Zheng</a> </span><em>NLPKE, </em><em>page 334-339. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/2011334-339Complex emotion categorization and tagging for Chinese.2011dblp http://www.bibsonomy.org/bibtex/2abc6e4c0a10e3f5dd164757a34fd32c6/dblpdblp2012-02-13T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Mi">Liping Mi</a>, <a href="/author/Ren">Fuji Ren</a>, and <a href="/author/Araki">Hideo Araki</a> </span><em>NLPKE, </em><em>page 205-208. </em><em>IEEE, </em>(<em>2011</em>)Mon Feb 13 00:00:00 CET 2012NLPKEconf/nlpke/2011205-208Differences of Japanese kanji and kana during the memory processing.2011dblp http://www.bibsonomy.org/bibtex/23ae89abc841039212d8c34f7d51850de/dblpdblp2012-02-11T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Ren">Fengyuan Ren</a>, <a href="/author/Lin">Chuang Lin</a>, and <a href="/author/Huang">Xiaomeng Huang</a> </span><em>IEEE Communications Letters</em> <em>9(5):471-473</em> (<em>2005</em>)Sat Feb 11 00:00:00 CET 2012IEEE Communications Letters5471-473TCC: a two-category classifier for AQM routers supporting TCP flows.92005dblp http://www.bibsonomy.org/bibtex/2749e44b72be5d33603f2a3556b157f35/dblpdblp2012-02-11T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Guo">Zihua Guo</a>, <a href="/author/Yao">Richard Yao</a>, <a href="/author/Zhu">Wenwu Zhu</a>, <a href="/author/Wang">Xin Wang</a>, and <a href="/author/Ren">Yong Ren</a> </span><em>IEEE Communications Letters</em> <em>9(3):228-230</em> (<em>2005</em>)Sat Feb 11 00:00:00 CET 2012IEEE Communications Letters3228-230Intra-superframe power management for IEEE 802.15.3 WPAN.92005dblp http://www.bibsonomy.org/bibtex/2d6dd318fb283fd5b00863a71e89a43a5/dblpdblp2012-02-10T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Ren">Fengyuan Ren</a>, <a href="/author/Yin">Xunhe Yin</a>, <a href="/author/Huang">Xiaomeng Huang</a>, and <a href="/author/Lin">Chuang Lin</a> </span><em>IEEE Communications Letters</em> <em>10(12):858-860</em> (<em>2006</em>)Fri Feb 10 00:00:00 CET 2012IEEE Communications Letters12858-860Designing a binary controller to enhance end-to-end congestion control.102006dblp http://www.bibsonomy.org/bibtex/26b779fabc64a0abb482b5a2ed154c9d0/dblpdblp2012-02-10T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Pearton">S. J. Pearton</a>, and <a href="/author/Ren">Fan Ren</a> </span><em>IEEE Instrum. Meas. Mag.</em> <em>15(1):16-21</em> (<em>2012</em>)Fri Feb 10 00:00:00 CET 2012IEEE Instrum. Meas. Mag.116-21Gallium nitride-based gas, chemical and biomedical sensors.152012dblp