检索结果-内蒙古大学图书馆

IEEE Annual Conference on Decision and Control

作者： Tizar Rizano Daniele Fontanelli Luigi Palopoli Lucia Pallottino Paolo Salaris the Dep. of Information Engineering and Computer Science University of Trento Via Sommarive 5 Trento Italy Research Center "E. Piaggio" and the Dipartimento di Ingegneria dell'Informazione University of Pisa via Diotisalvi 2 Pisa Italy

ISBN: (纸本)9781467357159

In this paper, we consider the optimal motion planning problem for an autonomous race car. A competitive autonomous car must acquire environmental and opponent information to compute, in real time, the minimum time collision free path and the low level control to track the chosen path. To cope with those requirements, we first solve the problem for a car running in isolation considering the optimal sequence of manoeuvres to approach bends and straight stretches of track. We then propose a discrete abstraction to derive a problem of graph optimisation that has a very efficient, albeit suboptimal, solution. In this context, an overtake manoeuvre against a slower car will be obtained excluding from the path the arcs that could potentially generate a collision. Finally, a control algorithm is used to ensure that the car always remains close to the planned path.

关键词： Global Path Planning Competitive Robotic Cars planned path

来源：评论

学校读者我要写书评

暂无评论

Novel cloud service for improving world universities ranking

Novel cloud service for improving world universities ranking

引用

9th International Conference on information Technology, ITNG 2012

作者： Hsieh, Shu-Ming Lo, Suu-An Hsu, Chiun-Chieh Lin, Wei-Chao Dep. Computer Science and Information Engineering Hwa Hsia Institute of Technology Taipei Taiwan Dep. Information Management National Taiwan University of Science and Technology Taipei Taiwan

ISBN: (纸本)9780769546544

The Internet has emerged to be an effective platform for world universities to share their academic outcomes and to show their influence and contribution via constructing rich and easy-to-access web sites. At the same time, Webometrics Ranking of World Universities (WR), proposed by Centre for Scientific information and Documentation (CSIC), ranks the world universities by the quantity of digital documents available on their web sites and the quality of the web pages measured by the incoming hyperlinks. Therefore, WR is currently recognized as an important index and opportunity for universities willing to promote themselves by the Internet technology. In this paper, we propose a novel cloud-based information providing system for Webometrics Rankings which employs web mining techniques to gather the WR indices from the Internet automatically, and provides useful information in real time for the managers of university web sites. The proposed system is dep.oyed on Microsoft Azure cloud platform in order to give up-to-data and deeper insights of the WR ranking indicators for its users. It utilizes the scalable computation and storage capability of the cloud platform to continually gather the WR index data from the Internet. The proposed system is designed with architecture suitable for cloud-based application such that the period to thoroughly update the WR ranking data is shortened from six months to be within one week. The proposed service model provides a paradigm for constructing cloud-based service of information providing applications. © 2012 IEEE.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Applying web mining techniques for constructing webometrics ranking early warning system

引用

2012 2nd International Conference on Materials science and information Technology, MSIT 2012

作者： Hsieh, Shu-Ming Lo, Ssu-An Hsu, Chiun-Chieh Chen, Da-Ren Dep. Computer Science and Information Engineering Hwa Hsia Institute of Technology Taipei Taiwan Dep. Information Management National Taiwan University of Science and Technology Taiwan Dep. Information Management Hwa Hsia Institute of Technology Taipei Taiwan

ISBN: (纸本)9783037854389

The management of university web sites is becoming more critical than before due to the rapid growth of the population dep.ndent on the world wide web as the most important (if not the only) information source. A university can spread its research outcomes and education achievements through its web site, and consequently gain visibility and influence from the web population. Webometrics Ranking of World Universities (WR) proposed by Centre for Scientific information and Documentation (CINDOC-CSIC), which ranks the university web sites, has obtained much attention recently. The rankings of WR are well recognized as an important index for universities willing to promote themselves by the internet technology. In this paper, we proposed WRES as an early warning system for Webometrics Rankings. WRES gathers the WR indices from the WWW automatically in flexible periods, and provides useful information in real time for the managers of university web sites. If the WR ranking of an institution is below the expected position according to their academic performance, university authorities should reconsider their web policy, by promoting substantial increases of the volume and quality of their electronic publications. Besides, the web site manages may adopt effective approaches to promote their WR rankings according to the hints given by WRES. © (2012) Trans Tech Publications, Switzerland.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Nonminimum-phase Channel Equalization using All-Pass CMA

Nonminimum-phase Channel Equalization using All-Pass CMA

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

作者： Koen C.H. Blom Marco E.T. Gerards André B.J. Kokkeler Gerard J.M. Smit Dep. of Electrical Engineering Mathematics and Computer Science University of Twente P.O. Box 217 7500 AE Enschede The Netherlands

ISBN: (纸本)9781467362337

A nonminimum-phase channel can always be decomposed into a minimum-phase part and an all-pass part. In our approach, called all-pass CMA, the dimensionality of the CMA algorithm has been reduced to improve blind equalization of a nonminimum-phase channel's all-pass part. The dimensionality reduction has been performed by parameterizing the CMA cost function in terms of the nonminimum-phase zero location of the all-pass part to be compensated. Currently, all-pass CMA can only compensate a single nonminimum-phase zero. However, compared to CMA, it typically provides a faster and more accurate compensation of this zero.

关键词： CMA compensated zero

来源：评论

学校读者我要写书评

暂无评论

High-capacity DNA-based steganography

High-capacity DNA-based steganography

引用

2012 8th International Conference on Informatics and Systems, INFOS 2012

作者： Khalifa, Amal Atito, Ahmed Dep. of Scientific Computing Faculty of Computers and Information Sciences Ain Shams University Cairo Egypt Dep. of Mathematics and Computer Science Faculty of Science South Valley University Qena Egypt

ISBN: (纸本)9789774035067

In this paper, a Steganography algorithm is proposed to communicate data securely using basic concepts and properties of the Deoxyribonucleic Acid (DNA). The proposed method is implemented in two main levels: In level one, a DNA-based Playfair cipher is initially applied to encrypt the secret message. In level two;a substitution method is used to hide the encrypted secret message into some reference DNA. That is, the bases of the reference DNA are replaced with the encrypted DNA dep.nding on a generic two-by-two complementary rule. The performance of the presented algorithm is inspected with respect to the Hiding capacity as well as robustness against attacks. © 2012 Cairo University.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Addendum to ‘Measurement of the t t ¯ production cross-section using e μ events with b-tagged jets in pp collisions at s = 7 and 8 TeV with the ATLAS detector’

引用

The European Physical Journal C 2016年第11期76卷 1-14页

作者： Aad, G. Abbott, B. Abdallah, J. Abdel Khalek, S. Abdinov, O. Aben, R. Abi, B. Abolins, M. AbouZeid, O. S. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B. S. Adamczyk, L. Adams, D. L. Adelman, J. Adomeit, S. Adye, T. Agatonovic-Jovin, T. Aguilar-Saavedra, J. A. Agustoni, M. Ahlen, S. P. Ahmadov, F. Aielli, G. Akerstedt, H. Åkesson, T. P. A. Akimoto, G. Akimov, A. V. Alberghi, G. L. Albert, J. Albrand, S. Alconada Verzini, M. J. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexander, G. Alexandre, G. Alexopoulos, T. Alhroob, M. Alimonti, G. Alio, L. Alison, J. Allbrooke, B. M. M. Allison, L. J. Allport, P. P. Almond, J. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Altheimer, A. Alvarez Gonzalez, B. Alviggi, M. G. Amako, K. Amaral Coutinho, Y. Amelung, C. Amidei, D. Santos, S. P. Amor Dos Amorim, A. Amoroso, S. Amram, N. Amundsen, G. Anastopoulos, C. Ancu, L. S. Andari, N. Andeen, T. Anders, C. F. Anders, G. Anderson, K. J. Andreazza, A. Andrei, V. Anduaga, X. S. Angelidakis, S. Angelozzi, I. Anger, P. Angerami, A. Anghinolfi, F. Anisenkov, A. V. Anjos, N. Annovi, A. Antonaki, A. Antonelli, M. Antonov, A. Antos, J. Anulli, F. Aoki, M. Aperio Bella, L. Apolle, R. Arabidze, G. Aracena, I. Arai, Y. Araque, J. P. Arce, A. T. H. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A. J. Arnaez, O. Arnal, V. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Asai, S. Asbah, N. Ashkenazi, A. Åsman, B. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N. B. Auerbach, B. Augsten, K. Aurousseau, M. Avolio, G. Azuelos, G. Azuma, Y. Baak, M. A. Baas, A. Bacci, C. Bachacou, H. Bachas, K. Backes, M. Backhaus, M. Backus Mayes, J. Badescu, E. Bagiacchi, P. Bagnaia, P. Bai, Y. Bain, T. Baines, J. T. Baker, O. K. Balek, P. Balli, F. Banas, E. Banerjee, Sw. Bannoura, A. A. E. Bansal, V. Bansil, H. S. Barak, L. Baranov, S. P. Barberio, E. L. Barberis, D. Barbero, M. Barillari, T. Barisonzi, M. Barklow, T. Barlow, N. Barnett, B. M. Barnett, R. M. Barnovska, Z. Baroncelli, A. Barone, G. Barr, A. J. Barreiro, F. da CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman USA Institute of Physics Academia Sinica Taipei Taiwan LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam The Netherlands Department of Physics Oklahoma State University Stillwater USA Department of Physics and Astronomy Michigan State University East Lansing USA Department of Physics University of Toronto Toronto Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel CERN Geneva Switzerland Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden Particle Physics Department Rutherford Appleton Laboratory Didcot UK AGH University of Science and Technology Faculty of Physics and Applied Computer Science Kraków Poland Physics Department Brookhaven National Laboratory Upton USA Department of Physics Yale University New Haven USA Fakultät für Physik Ludwig-Maximilians-Universität München Munich Germany Institute of Physics University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas-LIP Lisbon Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern Bern Switzerland Department of Physics Boston University Boston USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Rome Italy Dipartimento di Fisica Università di Roma Tor Vergata Rome Italy Fysiska institutionen Lunds universitet Lund Sweden International Center for Elementary Particle Physics and Depa

The ATLAS measurement of the inclusive top quark pair ( $$t\bar{t}$$ ) cross-section $$\sigma _{t\bar{t}}$$ in proton–proton collisions at $$\sqrt{s}=8$$ $$\,\mathrm{TeV}$$ has been updated using the final 2012 luminosity calibration. The updated cross-section result is: $$\begin{aligned} \sigma _{t\bar{t}}= 242.9\pm 1.7\pm 5.5\pm 5.1\pm 4.2\,\mathrm pb, \end{aligned}$$ where the four uncertainties arise from data statistics, experimental and theoretical systematic effects, knowledge of the integrated luminosity and of the LHC beam energy. The result is consistent with theoretical QCD calculations at next-to-next-to-leading order. The measurement of the ratio of $$t\bar{t}$$ cross-sections at $$\sqrt{s}=8$$ $$\,\mathrm{TeV}$$ and $$\sqrt{s}=7$$ $$\,\mathrm{TeV}$$ , and the $$\sqrt{s}=8$$ $$\,\mathrm{TeV}$$ fiducial measurement corresponding to the experimental acceptance of the leptons, have also been updated.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Advanced Characterization of Microscopic Kidney Biopsies Utilizing Image Analysis Techniques

Advanced Characterization of Microscopic Kidney Biopsies Uti...

引用

34th Annual International Conference of the IEEE engineering-in-Medicine-and-Biology-Society (EMBS)

作者： Goudas, Theodosios Doukas, Charalampos Chatziioannou, Aristotle Maglogiannis, Ilias University of Central Greece Dep. of Computer Science and Biomedical Informatics Greece University of the Aegean Dep. of Information and Communication Systems Engineering Samos Greece National Hellenic Research Foundation Institute of Biological Research and Biotechnology Greece

ISBN: (纸本)9781457717871

Correct annotation and identification of salient regions in Kidney biopsy images can provide an estimation of pathogenesis in obstructive nephropathy. This paper presents a tool for the automatic or manual segmentation of such regions along with methodology for their characterization in terms of the exhibited pathology. The proposed implementation is based on custom code written in Java and the utilization of open source tools (i.e. RapidMiner, ImageJ). The corresponding implementation details along with the initial evaluation of the proposed integrated system are also presented in the paper.

关键词： Biopsy

来源：评论

学校读者我要写书评

暂无评论

A new SAT-solver based algorithm for the electronic engineering

A new SAT-solver based algorithm for the electronic engineer...

引用

2012 International Conference on Mechanical and Electronic engineering, ICMEE 2012

作者： Hai, Benzhai Xie, Ruiyun School of Information Engineering Wuhan University of Technology Wuhan China School of Computer Science AndTechnology Henan Normal University Xinxiang China Dep. of Computer Science and Technology Henan Mechanical and Electrical Engineering College Xinxiang China

ISBN: (纸本)9783642315152

Boolean satisfiability (SAT) solvers are used heavily in electronic engineering verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solvers are based on the DPLL algorithm and require the input formula to be in conjunctive normal form (CNF). We represent the vhpform of a given NNF formula in the form of two graphs called vpgraph and hpgraph. The input formula is translated into a 2-dimensional format called vertical-horizontal path form (vhpform). In this form disjuncts (operands of) are arranged orizontally and conjuncts (operands ofˆ) are arranged *** formula is satisfiable if and only if there exists a vertical path through this arrangement that does not contain two opposite literals (l and ¬l). The input formula is not required to be in CNF. This algorithm is very important both for the design of integrated circuit and the development of electronic engineering. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Mining sequential rules common to several sequences with the window size constraint

引用

25th Canadian Conference on Artificial Intelligence, AI 2012

作者： Fournier-Viger, Philippe Wu, Cheng-Wei Tseng, Vincent S. Nkambou, Roger Dept. of Computer Sciences University of Moncton Canada Dep. of Computer Science and Information Engineering National Cheng Kung University Taiwan Dept. of Computer Sciences University of Quebec Montreal QC Canada

ISBN: (纸本)9783642303524

We present an algorithm for mining sequential rules common to several sequences, such that rules have to appear within a maximum time span. Experimental results with real-life datasets show that the algorithm can reduce the execution time, memory usage and the number of rules generated by several orders of magnitude compared to previous algorithms. © 2012 Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Centrality, rapidity, and transverse momentum dep.ndence of isolated prompt photon production in lead-lead collisions at sNN=2.76 TeV measured with the ATLAS detector

引用

Physical Review C 2016年第3期93卷 034914-034914页

作者： G. Aad B. Abbott J. Abdallah S. Abdel Khalek O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams J. Adelman S. Adomeit T. Adye T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson G. Akimoto A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob G. Alimonti L. Alio J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport J. Almond A. Aloisio A. Alonso F. Alonso C. Alpigiani A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders K. J. Anderson A. Andreazza V. Andrei X. S. Anduaga S. Angelidakis I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi A. Antonaki M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai J. P. Araque A. T. H. Arce J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster O. Arnaez V. Arnal H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Asai N. Asbah A. Ashkenazi B. Åsman L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay B. Auerbach K. Augsten M. Aurousseau G. Avolio G. Azuelos Y. Azuma M. A. Baak A. E. Baas C. Bacci H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai T. Bain J. T. Baines O. K. Baker P. Balek F. Balli E. Banas Sw. Banerjee A. A. E. Bannoura V. Bansal H. S. Bansil L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett Z. Barnovska A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos V. Bartsch A. Bassalat A. Basye R. L. Bates J. R. Batley M. Battaglia M. Battistin F. Bauer H. S. Bawa M CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman OK United States of America Institute of Physics Academia Sinica Taipei Taiwan LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics Oklahoma State University Stillwater OK United States of America Department of Physics and Astronomy Michigan State University East Lansing MI United States of America Department of Physics University of Toronto Toronto ON Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel CERN Geneva Switzerland Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine ICTP Trieste Italy AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton NY United States of America Department of Physics Yale University New Haven CT United States of America Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Laboratório de Instrumentação e Física Experimental de Partículas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada (Spain) Portugal Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern Bern Switzerland Department of Physics Boston University Boston MA United States of America Joint Institute for Nuclear Research JINR Dub

Prompt photon production in sNN=2.76-TeV Pb+Pb collisions has been measured by the ATLAS experiment at the Large Hadron Collider using data collected in 2011 with an integrated luminosity of 0.14 nb−1. Inclusive photon yields, scaled by the mean nuclear thickness function, are presented as a function of collision centrality and transverse momentum in two pseudorapidity intervals, |η|<1.37 and 1.52≤|η|<2.37. The scaled yields in the two pseudorapidity intervals, as well as the ratios of the forward yields to those at midrapidity, are compared to the expectations from next-to-leading-order perturbative QCD (pQCD) calculations. The measured cross sections agree well with the predictions for proton-proton collisions within statistical and systematic uncertainties. Both the yields and the ratios are also compared to two other pQCD calculations, one which uses the isospin content appropriate to colliding lead nuclei and another which includes nuclear modifications to the nucleon parton distribution functions.

关键词： Hard scattering Photon, lepton & quark production Relativistic heavy-ion collisions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：