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

A Quantum Secret Sharing Scheme Using Orbital Angular Momentum onto Multiple Spin States Based on Fibonacci Compression Encoding

引用

Communications in Theoretical Physics 2018年第10期70卷 384-390页

作者： Hong Lai Ming-Xing Luo Yong-Jian Xu Josef Pieprzyk Jun Zhang Lei Pan Mehmet A.Orgun School of Computer and Information Science and Centre for Research and Innovation in Software Engineering（RISE） Southwest UniversityChongqing 400715China Information Security and National Computing Grid Laboratory School of Information Science and TechnologySouthwest Jiaotong UniversityChengdu 610031China Data61 Commonwealth Scientific and Industrial Research OrganisationSydneyAustralia Institute of Computer Science Polish Academy of SciencesWarsaw01-248Poland School of Software and Electrical Engineering Swinburne University of TechnologyHawthornVIC3122Australia School of Information Technology Deakin UniversityGeelongVIC3220Australia Department of Computing Macquarie UniversitySydneyNSW 2109Australia Faculty of Information Technology Macao University of Science and TechnologyAvenida Wai LongTaipa999078Macao

Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-photon spin-orbit entanglement, we propose a quantum secret sharing scheme using orbital angular momentum onto multiple spin states based on Fibonacci compression encoding. In our proposed scheme, we can represent the frequency of any secret message which is typically collection of bits encodings of text or integers as a bitstring using the base Fibonacci sequence, which is encoded multiple spin states for secret shares transmitted to participants. We demonstrate that Fibonacci compression encoding carries excellent properties that enable us to achieve more robust quantum secret sharing schemes with fewer number of photons.

关键词： spin-orbit entanglement multiple spin states Fibonacci compression encoding quantum secretsharing

来源：评论

学校读者我要写书评

暂无评论

Energy efficiency optimization of generalized spatial modulation with sub-connected hybrid precoding 4

Energy efficiency optimization of generalized spatial modula...

引用

4th IEEE International Conference on Computer and Communications, ICCC 2018

作者： Chen, Kai Yang, Jing Ge, Xiaohu Li, Yonghui Tian, Lin Shi, Jinglin Huazhong University of Science and Technology School of Electronic Information and Communications Wuhan Hubei China School of Electrical and Information Engineering University of Sydney Sydney Australia Beijing Key Laboratory of Mobile Computing and Pervasive Devices Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

ISBN: (纸本)9781538683392

Energy efficiency (EE) optimization of millimeter wave (mm-Wave) massive multiple-input multiple-output (MI-MO) systems is emerging as an important challenge for the fifth generation (5G) mobile communication systems. However, the power of radio frequency (RF) chains increases sharply due to the high carrier frequency in mm-Wave massive MIMO systems. To overcome this issue, a new energy efficiency optimization solution is proposed based on the structure of the generalized spatial modulation (GSM) and sub-connected hybrid precoding (HP). Moreover, the computation power of mm-Wave massive MIMO systems is considered for optimizing the EE. Simulation results indicate that the EE of the GSM-HP scheme outperforms the full digital precoding (FDP) scheme in the mm-Wave massive MIMO scene, and 88% computation power can be saved by the proposed GSM-HP scheme. © 2018 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

computing resource allocation of mobile edge computing networks based on potential game theory 4

Computing resource allocation of mobile edge computing netwo...

引用

4th IEEE International Conference on Computer and Communications, ICCC 2018

作者： Liu, Heng Jia, Haoming Chen, Jiaqi Ge, Xiaohu Li, Yonghui Tian, Lin Shi, Jinglin School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan China School of Electrical and Information Engineering University of Sydney SydneyNSW2006 Australia Beijing Key Laboratory of Mobile Computing and Pervasive Devices Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

ISBN: (纸本)9781538683392

Mobile edge computing (MEC) networks are one of the key technologies for ultra-reliability and low-latency communications. The computing resource allocation solution needs to be carefully designed to guarantee the computing resource efficiency of MEC networks. Based on the potential game theory, a computing resource allocation solution is proposed to reduce energy consumption and improve computing resource efficiency in MEC networks. The computing resource allocation solution includes two parts: the first part is the power control scheme based on the potential game theory and the second part is the computing resource allocation scheme based on linear programming. The power control scheme is to find a set of the transmission powers of base stations (BSs) that maximizes the potential function of MEC networks. The computing resource allocation scheme is to maximize the average computing resource allocation coefficient of the MEC networks based on the results of the power control scheme. Compared with traditional solutions, simulation results indicate the computing resource utilization and energy efficiency of the proposed computing resource allocation solution are significantly improved. © 2018 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

AI-skin: Skin disease recognition based on self-learning and wide data collection through a closed loop framework

arXiv

引用

arXiv 2019年

作者： Chen, Min Zhou, Ping Wu, Di Hu, Long Hassan, Mohammad Mehedi Alamri, Atif School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Province Key Laboratory of Big Data Analysis and Processing Guangzhou China Chair of Pervasive and Mobile Computing Information Systems Department College of Computer and Information Sciences King Saud University Riyadh11543 Saudi Arabia Chair of Pervasive and Mobile Computing Software Engineering Department CCIS King Saud University Riyadh11543 Saudi Arabia

There are a lot of hidden dangers in the change of human skin conditions, such as the sunburn caused by long-time exposure to ultraviolet radiation, which not only has aesthetic impact causing psychological depression and lack of selfconfidence, but also may even be life-threatening due to skin canceration. Current skin disease researches adopt the auto-classification system for improving the accuracy rate of skin disease classification. However, the excessive dependence on the image sample database is unable to provide individualized diagnosis service for different population groups. To overcome this problem, a medical AI framework based on data width evolution and self-learning is put forward in this paper to provide skin disease medical service meeting the requirement of real time, extendibility and individualization. First, the wide collection of data in the close-loop information flow of user and remote medical data center is discussed. Next, a data set filter algorithm based on information entropy is given, to lighten the load of edge node and meanwhile improve the learning ability of remote cloud analysis model. In addition, the framework provides an external algorithm load module, which can be compatible with the application requirements according to the model selected. Three kinds of deep learning model, i.e. LeNet-5, AlexNet and VGG16, are loaded and compared, which have verified the universality of the algorithm load module. The experiment platform for the proposed real-time, individualized and extensible skin disease recognition system is built. And the system's computation and communication delay under the interaction scenario between tester and remote data center are analyzed. It is demonstrated that the system we put forward is reliable and effective. Copyright © 2019, The Authors. All rights reserved.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

High-rate and high-capacity measurement-deviceindependent quantum key distribution with Fibonacci matrix coding in free space

引用

Science China(information Sciences) 2018年第6期61卷 227-237页

作者： Hong LAI Mingxing LUO Josef PIEPRZYK Jun ZHANG Lei PAN Mehmet A.ORGUN School of Computer and Information Science and Centre for Research and Innovation in Software Engineering (RISE) Southwest University Information Security and National Computing Grid Laboratory School of Information Science and TechnologySouthwest Jiaotong University School of Electrical Engineering and Computer Science Queensland University of Technology Institute of Computer Science Polish Academy of Sciences School of Information Technology Deakin University Department of Computing Macquarie University Faculty of Information Technology Macau University of Science and Technology

This paper proposes a high-rate and high-capacity measurement-device-independent quantum key distribution(MDI-QKD) protocol with Fibonacci-valued and Lucas-valued orbital angular momentum(OAM) entangled states in free space. In the existing MDI-OAM-QKD protocols, the main encoding algorithm handles encoded numbers in a bit-by-bit manner. To design a fast encoding algorithm, we introduce a Fibonacci matrix coding algorithm, by which, encoded numbers are separated into segments longer than one bit. By doing so, when compared to the existing MDI-OAM-QKD protocols, the new protocol can effectively increase the key rate and the coding capacity. This is because Fibonacci sequences are used in preparing OAM entangled states, reducing the misattribution errors(which slow down the execution cycle of the entire QKD) in QKD protocols. Moreover, our protocol keeps the data blocks as small as possible, so as to have more blocks in a given time interval. Most importantly, our proposed protocol can distill multiple Fibonacci key matrices from the same block of data, thus reducing the statistical fluctuations in the sample and increasing the final QKD rate. Last but not the least, the sender and the receiver can omit classical information exchange and bit flipping in the secure key distillation stage.

关键词： measurement-device-independent quantum key distribution Fibonacci-matrix coding free space orbital angular momentum bit flipping misattribution errors

来源：评论

学校读者我要写书评

暂无评论

Likes and views: Investigating internet video content creators perceptions of popularity 2

Likes and views: Investigating internet video content creato...

引用

2nd International GamiFIN Conference, GamiFIN 2018

作者： Törhönen, Maria Sjöblom, Max Hamari, Juho Gamification Group Laboratory of Pervasive Computing Computing and Electrical Engineering Tampere University of Technology Finland Gamification Group Tampere Research Center for Information and Media Faculty of Communication Sciences University of Tampere Finland Aalto University School of Science Finland Gamification Group Digital media Faculty of Humanities University of Turku Finland

来源：评论

学校读者我要写书评

暂无评论

Efficient dynamic evolution of service composition

Efficient dynamic evolution of service composition

引用

作者： Lv, Chen Jiang, Wei Hu, Songlin Wang, Jiye Lu, Guoliang Liu, Zhiyong School of Information Science and Engineering Shandong Normal University China Greatwall Drilling Company R&D Academy of Well Logging CNPC Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China Department of Information Technology State Grid Corporation of China Beijing China School of Mechanical Engineering Shandong University China Institute of Computing Technology Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China

Current QoS-aware automatic service composition queries over a network of web services are often one-time in nature. After a network of web services is built, such queries are issued once, and answers are found from the scratch. The underlying assumption is that the participating web services are rather static, which means that their functional and non-functional parameters seldom change. However, such an assumption is often baseless. New services come and go, service APIs change gradually, and QoS values fluctuate in practice. Therefore, a support for efficiently adapting service composition is desired. In this paper, we propose an event driven continuous query algorithm to intelligently cope with different types of dynamic services, and thus enable evolution of service composition. Evaluation using both real QoS data and synthetic web service data shows its superior performance, compared with the state-of-the-art solution which won the performance championship of Web Service Challenge in 2009 and 2010. Moreover, we generalize a new graph problem: dynamic single-source optimal-Directed Acyclic Graphs (DAG) problem based on the above work. It is argued that API recommendation for framework evolution, as another typical application, could also be modeled and addressed efficiently using the proposed new graph approach. © 2017 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A cache-based pre-downloading scheme for HSR communication using C-RAN

A cache-based pre-downloading scheme for HSR communication u...

引用

IET 8th International Conference on Wireless, Mobile &Multimedia Networks

作者： Jiachi Zhang Liu Liu Kai Wang Zheyan Piao Tao Zhou School of Electronic and Information Engineering Beijing Jiaotong University Beijing P.R. China School of Rail Transportation Shandong Jiaotong University Jinan P.R. China Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology Chinese Academy of Sciences Beijing P.R. China School of Rail Transportation Shandong Jiaotong University Jinan P.R. China

ISBN: (纸本)9781839531637

The proliferation of the high-speed railway (HSR) promotes the rapid development of communication technology greatly. In this paper, we explore the application of the cloud radio access network (C-RAN) with the limited-capacity fronthaul in HSR scenarios. Moreover, a cache-based pre-downloading scheme for dynamic resource allocation is proposed to maximize the throughput of the HSR communication system. Specifically, the remote radio heads (RRH) are added with cache devices to store the resources in advance based on the pre-downloading scheme by using the predictable train trajectory information. The simulation result reveals that total network throughput based on the proposed scheme outperforms both the non-cache-based scheme and the conventional cache-based scheme, indicating that the proposed scheme provides some new insights on the enhancement of the HSRs network performance.

关键词： HIGH-SPEED RAILWAY WIRELESS COMMUNICATION C-RAN CACHE PRE-DOWNLOADING SCHEME CARRIER SYSTEM Cache memory Communication technology Resource utilization RRH gene Scheme Network throughput Simulation results

来源：评论

学校读者我要写书评

暂无评论

An efficient quantum blind digital signature scheme

引用

Science China(information Sciences) 2017年第8期60卷 226-239页

作者： Hong LAI Mingxing LUO Josef PIEPRZYK Zhiguo QU Shudong LI Mehmet A.ORGUN College of Computer and Information Science Southwest University Information Security and National Computing Grid Laboratory School of Information Science and TechnologySouthwest Jiaotong University School of Electrical Engineering and Computer Science Queensland University of Technology Institute of Computer Science Polish Academy of Sciences School of Computer and Software Nanjing University of Information Science and Technology College of Mathematics and Information Science Shandong Technology and Business University School of Computer Science National University of Defense Technology Department of Computing Macquarie University Faculty of Information Technology Macau University of Science and Technology

Recently, many quantum digital signature(QDS) schemes have been proposed to authenticate the integration of a message. However, these quantum signature schemes just consider the situation for bit messages,and the signing-verifying of one-bit modality. So, their signature efficiency is very low. In this paper, we propose a scheme based on an application of Fibonacci-, Lucas-and Fibonacci-Lucas matrix coding to quantum digital signatures based on a recently proposed quantum key distribution(QKD) system. Our scheme can sign a large number of digital messages every time. Moreover, these special matrices provide a method to verify the integration of information received by the participants, to authenticate the identity of the participants, and to improve the efficiency for signing-verifying. Therefore, our signature scheme is more practical than the existing schemes.

关键词： blind quantum digital signature Fibonacci- Lucas-and Fibonacci-Lucas matrix coding digital messages signing-verifying modality

来源：评论

学校读者我要写书评

暂无评论

Stable web scraping: An approach based on neighbour zone and path similarity of page elements

引用

International Journal of Web engineering and technology 2018年第4期13卷 301-333页

作者： Gao, Peng Han, Hao Guo, Junxia Saeki, Motoshi Laboratory of Information Security and Software Engineering NARI Group Corporation State Grid Electric Power Research Institute No. 8 Nanrui Road Gulou District Nanjing Jiangsu210003 China Konica Minolta Tokyo Japan College of Information Science and Technology Beijing University of Chemical Technology 4# 15 Beisanhuan East Road Chaoyang District Beijing100029 China School of Computing Tokyo Institute of Technology Ookayama 2-12-1-W8-71 Meguro Tokyo152-8552 Japan

Web scraping techniques based on XPath enable users to consistently extract information of interest from webpages that do not provide a structured interface. However, XPath-based extraction is likely to fail when encountering page variants, resulting in a high cost of repair. Countermeasures based on pattern matching or model learning often require careful pre-processing, which is not suitable for cases where the target data is frequently re-designated. In this paper, we present a new extraction method for the stable scraping of arbitrary designated data from webpages. Instead of attempting to find the desired data directly, we first determine its approximate location in the changed page, called the neighbour zone. Then we search for the precise location by ranking the path similarity of page elements within the neighbour zone. Experiments on a large set of real-world webpages show that our method has better stability for web scraping, compared with the XPath-based extraction. In the two datasets, 0.118 and 0.891 F1-score were increased respectively. Copyright © 2018 Inderscience Enterprises Ltd.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：