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

Cryptanalysis of fair quantum blind signatures

Chinese Physics B 2012年第3期21卷 63-66页

作者：何立宝黄刘生杨威许瑞 National High Performance Computing Center Department of Computer Science and TechnologyUniversity of Science and Technology of China Suzhou Institute for Advanced Study University of Science and Technology of China

We investigate the fair quantum blind signature scheme proposed by Wang and Wen [Wang T Y and Wen Q Y 2010 Chin. Phys. B 19 060307], which uses the fundamental properties of quantum mechanics and the availability of a trusted arbitrator. However, in this paper, we find that the protocol cannot satisfy the property of non-forgeability even under the condition that the trusted arbitrator is totally credible. Moreover, a simple feasible suggestion for improving the protocol is proposed.

关键词： fair blind signature single photons hash function

来源：评论

学校读者我要写书评

暂无评论

A genealogy of information spreading on microblogs: A Galton-Watson-based explicative model

A genealogy of information spreading on microblogs: A Galton...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Dong Wang Hosung Park Gaogang Xie Sue Moon Mohamed-Ali Kaafar Kave Salamatian INRIA France Graduate School of Chinese Academy of Sciences China Institute of Computing Technology Chinese Academy of Sciences China Department of Computer Science Korea Advanced Institute of Science and Technology South Korea LISTIC Laboratory Universite de Savoie France

ISBN: (纸本)9781467359443

In this paper, we study the process of information diffusion in a microblog service developing Galton-Watson with Killing (GWK) model. Microblog services offer a unique approach to online information sharing allowing microblog users to forward messages to others. We describe an information propagation as a discrete GWK process based on Galton-Watson model which models the evolution of family names. Our model explains the interaction between the topology of the social graph and the intrinsic interest of the message. We validate our model on dataset collected from Sina Weibo and Twitter microblog. Sina Weibo is a Chinese microblog web service which reached over 100 million users as for January 2011. Our Sina Weibo dataset contains over 261 thousand tweets which have retweets and 2 million retweets from 500 thousand users. Twitter dataset contains over 1.1 million tweets which have retweets and 3.3 million retweets from 4.3 million users. The results of the validation show that our proposed GWK model fits the information diffusion of microblog service very well in terms of the number of message receivers. We show that our model can be used in generating tweets load and also analyze the relationships between parameters of our model and popularity of the diffused information. To the best of our knowledge, this paper is the first to give a systemic and comprehensive analysis for the information diffusion on microblog services, to be used in tweets-like load generators while still guaranteeing popularity distribution characteristics.

关键词： Twitter Integrated circuit modeling Analytical models Load modeling Predictive models Media

来源：评论

学校读者我要写书评

暂无评论

HIGH BIT RATE DATA TRANSMISSION USING COLORED SOLITON MULTIPLEXING SYSTEM

HIGH BIT RATE DATA TRANSMISSION USING COLORED SOLITON MULTIP...

引用

2013 5th IEEE International Conference On Broadband Network & Multimedia Technology

作者： T.Phattaraworamet S.Mitatha J.Visessamit P.P.Yupapin Hybrid Computing Research Laboratory Department of Computer EngineeringFaculty of EngineeringKing Mongkut’s Institute of Technology Ladkrabang Bangkok 10520Thailand Advanced Studies Center Department of PhysicsFaculty of ScienceKing Mongkut’s Institute of Technology Ladkrabang Bangkok (KMITL)Thailand

This paper presents the use of multi-wavelength solitons(colored solitons) generated by light in a modified add-drop optical filter. It is made by InG aA sP /InP and known as a PANDA ring circuit. The

ISBN: (纸本)9781479900961

关键词： Random encoding High bit rate Data transmission data transmission MULTIPLEXOR Solitons Drill bits OPTICAL FILTER digital equipment Bit rate BORON INJECTION TANK

来源：评论

学校读者我要写书评

暂无评论

Correction: An analytical model and ANN simulation for carbon nanotube based ammonium gas sensors

引用

RSC Advances 2014年第80期4卷 42581-42581页

作者： Elnaz Akbari Zolkafle Buntat Aria Enzevaee Seyed Javad Mirazimiabarghouei Mahdi Bahadoran Ali Shahidi Ali Nikoukar Institute of High Voltage & High Current Faculty of Electrical Engineering Universiti Teknologi Malaysia Johor Bahru Malaysia Faculty of Mechanical Engineering Universiti Teknologi Malaysia Johor Bahru 81310 Malaysia School of Mechanical and Electrical Engineering USQ Faculty of Health Engineering and Sciences Toowoomba Queensland Australia Institute of Advanced Photonics Science Nanotechnology Research Alliance Universiti Teknologi Malaysia Johor Bahru 81310 Malaysia RWTH Aachen Department of Computer Science 4 Ahornstr. 55 52056 Aachen Germany Faculty of Computing Universiti Teknologi Malaysia Johor Bahru 81310 Malaysia

Correction for ‘An analytical model and ANN simulation for carbon nanotube based ammonium gas sensors’ by Elnaz Akbari et al., RSC Adv., 2014, 4, 36896–36904.

Correction for ‘An analytical model and ANN simulation for carbon nanotube based ammonium gas sensors’ by Elnaz Akbari et al., RSC Adv., 2014, 4, 36896–36904.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

Approximation algorithms for deployment of sensors for line ...

引用

2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012

作者： Dash, Dinesh Bishnu, Arijit Gupta, Arobinda Nandy, Subhas C. Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

ISBN: (纸本)9781467302982

The coverage problem in wireless sensor network deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments with minimum number of sensors. A line segment is said to be 1-covered if it intersects the sensing region of at least one among the sensors distributed in a bounded rectangular region R. We assume that the sensing radius of each sensor is uniform. The problem of finding the minimum number of sensors needed to 1-cover each member in a given set of line segments in R is NP-hard. We propose two constant factor approximation algorithms and a PTAS (Polynomial Time Approximation Scheme) for the problem for 1-covering a set of axis-parallel line segments. We also show that a PTAS exists for 1-covering a set of arbitrarily oriented line segments in R where the length of the line segments are bounded within a constant factor of the sensing radius of each sensor. © 2012 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

HRI Pioneers Workshop 2013 13

HRI Pioneers Workshop 2013

引用

ACM/IEEE International Conference on Human-Robot Interaction (HRI)

作者： Solace Shen Henny Admoni Caroline Harriott Yunkyung Kim Matt Marge Marynel Vázquez Astrid Rosenthal-von der Pütten Matt Beane Yasuhiko Hato Daniel Lazewatsky Robin Read Steve Vozar Department of Psychology University of Washington Seattle USA Department of Social Psychology University of Duisburg-Essen Duisburg Germany Department of Computer Science Yale University New Haven USA Sloan School of Management Massachusetts Institute of Technology Cambridge USA Department of Electrical Engineering & Computer Science Vanderbilt University Nashville USA Graduate School of Science & Technology Keio University Yokohama Japan Department of Industrial Design Korea Advanced Institute of Science and Technology Daejeon South Korea Industrial & Manufacturing Engineering Oregon State University Corvallis USA Language Technologies Institute Carnegie Mellon University Pittsburgh USA Centre for Robotics & Neural Systems University of Plymouth Plymouth UK Robotics Institute Carnegie Mellon University Pittsburgh USA Department of Mechanical Engineering University of Michigan Ann Arbor USA

ISBN: (纸本)9781467330558

The 2013 Human-Robot Interaction (HRI) Pioneers Workshop, which will be held in conjunction with the 8 th ACM/IEEE International Conference on Human-Robot Interaction, is the premiere venue for student research in the field. This highly selective workshop seeks to foster creativity, communication, and collaboration between the world's top student researchers in the field of human-robot interaction. Pioneers Workshop participants will have the opportunity to learn about the current state of HRI, to present their research, and to network with one another and with select senior researchers in a setting that is less formal and more interactive then the main conference. The theme for this year is Re-envisioning HRI: Dealing With the Elephants in Our Room. The workshop aims to bring forward difficult to discuss issues to help the field achieve more balanced perspectives and a clearer picture of what sort of future we are building.

关键词： Educational institutions Conferences Human-robot interaction Psychology computer science Service robots

来源：评论

学校读者我要写书评

暂无评论

Erratum: Search for new phenomena in final states with large jet multiplicities and missing transverse momentum at = 8 TeV proton-proton collisions using the ATLAS experiment

引用

Journal of High Energy Physics 2014年第1期2014卷 1-18页

作者： G. Aad T. Abajyan B. Abbott J. Abdallah S. Abdel Khalek O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams T. N. Addy J. Adelman S. Adomeit T. Adye S. Aefsky T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen A. Ahmad M. Ahsan G. Aielli T. P. A. Åkesson G. Akimoto A. V. Akimov M. A. Alam J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti L. Alio J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport S. E. Allwood-Spiers J. Almond A. Aloisio R. Alon A. Alonso F. Alonso A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako Y. Amaral Coutinho C. Amelung V. V. Ammosov S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram 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 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 A. T. H. Arce S. Arfaoui J.-F. Arguin S. Argyropoulos E. Arik M. Arik A. J. Armbruster O. Arnaez V. Arnal O. Arslan A. Artamonov G. Artoni D. Arutinov S. Asai N. Asbah S. Ask B. Åsman L. Asquith K. Assamagan R. Astalos A. Astbury M. Atkinson N. B. Atlay B. Auerbach E. Auge K. Augsten M. Aurousseau G. Avolio D. Axen G. Azuelos Y. Azuma M. A. Baak C. Bacci A. M. Bach H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker S. Baker P. Balek F. Balli E. Banas Sw. Banerjee D. Banfi A. Bangert V. Bansal H. S. Bansil L. Barak S. P. Baranov T. Barber E. L. Barberio D. Barberis M. Barbero D. Y. Bardin T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton V. Bartsch A. B Fakultät für Mathematik und Physik Albert-Ludwigs-Universität Freiburg Germany Physikalisches Institut University of Bonn Bonn Germany Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States of America Institut de Física d’Altes Energies and Departament de Física de la Universitat Autònoma de Barcelona Barcelona Spain 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 United States of America Department of Physics and Astronomy Michigan State University East Lansing United States of America Department of Physics University of Toronto Toronto Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel DSM/IRFU (Institut de Recherches sur les Lois Fondamentales de l’Univers) CEA Saclay (Commissariat à l’Energie Atomique et aux Energies Alternatives) Gif-sur-Yvette France Department of Physics Stockholm University Stockholm Sweden INFN Gruppo Collegato di Udine Udine Italy Department of Physics King’s College London London United Kingdom AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton United States of America Department of Physics Hampton University Hampton United States of America Department of Physics Yale University New Haven 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 Department of Physics Brandeis University Waltham United States of America Vinca Institute of Nuclear Sciences University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP Lisboa Portug

来源：评论

学校读者我要写书评

暂无评论

Representing reaction systems by trees

Representing reaction systems by trees

引用

International Workshop on Theoretical computer science, WTCS 2012

作者： Brijder, R. Ehrenfeucht, A. Rozenberg, G. Hasselt University and Transnational University of Limburg Belgium Department of Computer Science University of Colorado Boulder CO United States Leiden Institute of Advanced Computer Science Leiden Center for Natural Computing Leiden University Netherlands

ISBN: (纸本)9783642276538

Reaction systems formally model the functioning of the living cell. By representing sets of reactions by trees, we obtain a useful tool to investigate the state spaces of reaction systems. In particular, we give an upper bound on the fraction of inactive states within a subspace of the state space. This subspace represents partial knowledge of the (unknown) state under consideration. © 2012 Springer-Verlag.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

On finding shortest isothetic path inside a digital object

On finding shortest isothetic path inside a digital object

引用

15th International Workshop on Combinatorial Image Analysis, IWCIA 2012

作者： Dutt, Mousumi Biswas, Arindam Bhowmick, Partha Bhattacharya, Bhargab B. Department of Information Technology Bengal Engineering and Science University Shibpur Howrah India Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783642347313

Shortest path algorithms are finding interesting applications in recent times in various emerging areas of image analysis and computer vision. Such algorithms are designed to solve shortest path problems with variegated need-based constraints. We present here an efficient combinatorial algorithm to find a/the shortest isothetic path (SIP) between two grid points in a digital object such that the SIP lies entirely inside the object. The algorithm first obtains the inner isothetic cover (simple and without holes) of the object and then applies certain combinatorial rules to construct the SIP and its constituent monotone sub-paths. For a given grid size, the entire algorithm runs in O(n logn) time, n being the number of grid points on the border of the cover. Experimental results show the effectiveness of the algorithm and its further prospects in shape analysis. © 2012 Springer-Verlag.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Circle formation by asynchronous fat robots with limited visibility

Circle formation by asynchronous fat robots with limited vis...

引用

8th International Conference on Distributed computing and Internet Technologies, ICDCIT 2012

作者： Dutta, Ayan Gan Chaudhuri, Sruti Datta, Suparno Mukhopadhyaya, Krishnendu Computer Science and Engineering Department Heritage Institute of Technology Kolkata 700107 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B.T. Road Kolkata 700108 India

ISBN: (纸本)9783642280726

This paper proposes a distributed algorithm for circle formation by multiple autonomous mobile robots. The vision of each robot is limited to a maximum distance. The robots do not store past actions or records of past data. They are anonymous and cannot be distinguished by their appearances. All robots agree on a common origin and axes. Earlier works report algorithms for gathering of multiple autonomous mobile robots in limited visibility considering the robots to be dimensionless or points. This paper models a robot as a unit disc (fat robot). The algorithm presented in this paper also assures that there is no collision among the robots. The robots do not share a common clock. They execute the algorithm asynchronously. © 2012 Springer-Verlag.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：