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

7th International Conference on Computational Data and Social Networks, CSoNet 2018

作者： Li, Jinzhong Liu, Guanjun Department of Computer Science and Technology College of Electronic and Information Engineering Jinggangshan University Ji’an343009 China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu610054 China Department of Computer Science and Technology College of Electronic and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

ISBN: (纸本)9783030046477

Most existing approaches of learning to rank treat the effectiveness of each query equally which results in a relatively lower ratio of queries with high effectiveness (i.e. rich queries) in the produced ranking model. Such ranking models need to be further optimized to increase the number of rich queries. In this paper, queries with different effectiveness are distinguished, and the queries with higher effectiveness are given higher weights. We modify the gradient in the LambdaMART algorithm based on a new perspective of Matthew effect to highlight the optimization of the rich queries and to produce the rich ranking model, and we present a consistency theorem for the modified optimization objective. Based on the effectiveness evaluation criteria for information retrieval, we introduce the Gini coefficient, mean-variance and quantity statistics to measure the performances of the ranking models. Experimental results show that the ranking models produced by the gradient-modified LambdaMART algorithm based on Matthew effect exhibit a stronger Matthew effect compared to the original LambdaMART algorithm. © Springer Nature Switzerland AG 2018.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Impossible meet-in-the-middle fault analysis on the LED lightweight cipher in VANETs

引用

Science China(Information Sciences) 2018年第3期61卷 118-130页

作者： Wei LI Vincent RIJMEN Zhi TAO Qingju WANG Hua CHEN Yunwen LIU Chaoyun LI Ya LIU School of Computer Science and Technology Donghua University imec-COSIC KU Leuven Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Applied Mathematics and Computer Science Technical University of Denmark Trusted Computing and Information Assurance Laboratory Institute of SoftwareChinese Academy of Sciences College of Science National University of Defense Technology Department of Computer Science and Engineering University of Shanghai for Science and Technology

With the expansion of wireless technology, vehicular ad-hoc networks(VANETs) are emerging as a promising approach for realizing smart cities and addressing many serious traffic problems, such as road safety, convenience, and efficiency. To avoid any possible rancorous attacks, employing lightweight ciphers is most effective for implementing encryption/decryption, message authentication, and digital signatures for the security of the VANETs. Light encryption device(LED) is a lightweight block cipher with two basic keysize variants: LED-64 and LED-128. Since its inception, many fault analysis techniques have focused on provoking faults in the last four rounds to derive the 64-bit and 128-bit secret keys. It is vital to investigate whether injecting faults into a prior round enables breakage of the LED. This study presents a novel impossible meet-in-the-middle fault analysis on a prior round. A detailed analysis of the expected number of faults is used to uniquely determine the secret key. It is based on the propagation of truncated differentials and is surprisingly reminiscent of the computation of the complexity of a rectangle attack. It shows that the impossible meet-in-the-middle fault analysis could successfully break the LED by fault injections.

关键词： VANETs LED lightweight cipher impossible meet-in-the-middle fault analysis

来源：评论

学校读者我要写书评

暂无评论

An improved convex programming model for the inverse problem in intensity-modulated radiation therapy

引用

International Journal of Performability engineering 2018年第5期14卷 871-884页

作者： Lan, Yihua Zhang, Xingang Zhang, Jianyang Wang, Yang Hung, Chih-Cheng School of Computer and Information Technology Nanyang Normal University Nanyang473061 China Institute of Image Processing and Pattern Recognition Nanyang Normal University Nanyang473061 China Radiology Department Central Hospital of Nanyang Nanyang473061 China Laboratory for Machine Vision and Security Research College of Computing and Software Engineering Kennesaw State University - Marietta Campus 1100 South Marietta Parkway MariettaGA30067-2896 United States

Intensity modulated radiation therapy technology (IMRT) is one of the main approaches in cancer treatment because it can guarantee the killing of cancer cells while optimally protecting normal tissue from complications. Inverse planning, which is the core component of the entire IMRT system, is mainly based on accurate mathematical modeling and associated fast solving methods. In inverse planning, the fluence map optimization, which considers the multi-leaf collimator (MLC) modulation, is the current research focus. Although the hitting constrain problem with the unidirectional movement of leaf-sweeping has been solved, our goal is to solve the hitting constrain problem with the bidirectional movement of leaf-sweeping. In this study, we propose a non-synchronized type to solve the hitting constrain problem with the bidirectional movement of leaf-sweeping schemes for IMRT. In solving this problem, a new mathematical model is proposed under the framework of convex programming. The advantage of the convex model is to avoid the uncertainty and inaccuracy that occurs in the non-convex programming solving process. Experimental results for two clinical testing cases show that under the same condition of total number of monitoring units, the new proposed model produces better dose distribution than those of the total variance and quadratic models. © 2018 Totem Publisher, Inc. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Cryptography Theory-Based Generating Method for Secure ECs

引用

Tsinghua Science and Technology 2017年第5期22卷 499-510页

作者： Chao Wang Feng Hu Huanguo Zhang Jie Wu the Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information EngineeringShanghai University the Department of Computer and Information Sciences Temple University the Key Lab of Aerospace Information Security and Trusted Computing Wuhan University

Ant Colony Optimization （AGO） has the character of positive feedback, distributed searching, and greedy searching. It is applicable to optimization grouping problems. Traditional cryptographic research is mainly based on pure mathematical methods which have complicated theories and algorithm. It seems that there is no relationship between cryptography and ACO. Actually, some problems in cryptography are due to optimization grouping problems that could be improved using an evolutionary algorithm. Therefore, this paper presents a new method of solving secure curve selection problems using ACO. We improved Complex Multiplication （CM） by combining Evolutionary Cryptography Theory with Weber polynomial solutions. We found that ACO makes full use of valid information generated from factorization and allocates computing resource reasonably. It greatly increases the performance of Weber polynomial solutions. Compared with traditional CM, which can only search one root once time, our new method searches all roots of the polynomial once, and the average time needed to search for one root reduces rapidly. The more roots are searched, the more ECs are obtained.

关键词： ECs Weber polynomial evolutionary algorithm ant algorithm complex multiplication

来源：评论

学校读者我要写书评

暂无评论

Simple Method for Realizing Weil Theorem in Secure ECC Generation

引用

Tsinghua Science and Technology 2017年第5期22卷 511-519页

作者： Feng Hu Chao Wang Huanguo Zhang Jie Wu the Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information EngineeringShanghai University the Department of Computer and Information Sciences Temple University the Key Lab of Aerospace Information Security and Trusted Computing Wuhan University

How to quickly compute the number of points on an Elliptic Curve （EC） has been a longstanding challenge. The computational complexity of the algorithm usually employed makes it highly inefficient. Unlike the general EC, a simple method called the Weil theorem can be used to compute the order of an EC characterized by a small prime number, such as the Kobltiz EC characterized by two. The fifteen secure ECs recommended by the National Institute of Standards and Technology （NIST） Digital Signature Standard contain five Koblitz ECs whose maximum base domain reaches 571 bits. Experimental results show that the computation speed decreases for base domains exceeding 600 bits. In this paper, we propose a simple method that combines the Weil theorem with Pascals triangle, which greatly reduces the computational complexity. We have validated the performance of this method for base fields ranging from 2l^100 to 2^1000. Furthermore, this new method can be generalized to any ECs characterized by any small prime number.

关键词： Elliptic Curves （ECs） Pascal＇s triangle Weil theorem

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Event Timeline Extraction Method Based on News Corpus 2

An Event Timeline Extraction Method Based on News Corpus

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Yaguang Wu Haichun Sun Chungang Yan Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Tongji University College of Police Information Engineering People's Public Security University of China

ISBN: (纸本)9781509036202

Event extraction is an important research point in information extraction area, and news event extraction has a greater practical significance. The existing methods of extracting news event, which starts from the time element, is to identify the date sentences hold by Natural Language Processing and extract the event on the date by Text Clustering. However, they only process the news that holds a time-tag and gives up the news that has no accurate date, which easily leads an extraction deviation of significant events and reduces the accuracy of ordering the significant events. In this paper, improvement for this defect is to calculate the similarities between sentences to put part of the non-time-tag sentences into the right date container, thereby the accuracy of ordering the significant event is *** experiments and compared with the existing methods,the accuracy of ordering the significant events in this paper is improved by 14.6%.

关键词： event extraction text information mining sentence similarity timeline

来源：评论

学校读者我要写书评

暂无评论

$\textsf{LoPub}$ : High-Dimensional Crowdsourced Data Publication With Local Differential Privacy

引用

IEEE Transactions on Information Forensics and security 2018年第9期13卷 2151-2166页

作者： Xuebin Ren Chia-Mu Yu Weiren Yu Shusen Yang Xinyu Yang Julie A. McCann Philip S. Yu School of Electronic and Information Engineering Xi’an Jiaotong University Xi’an China Taiwan Information Security Center Taipei Taiwan Department of Computer Science and Engineering National Chung Hsing University Taichung Taiwan Department of Computing Imperial College London London U.K. School of Engineering and Applied Science Aston University Birmingham U.K. Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China Department of Computer Science University of Illinois at Chicago Chicago IL USA

High-dimensional crowdsourced data collected from numerous users produces rich knowledge about our society; however, it also brings unprecedented privacy threats to the participants. Local differential privacy (LDP), a variant of differential privacy, is recently proposed as a state-of-the-art privacy notion. Unfortunately, achieving LDP on high-dimensional crowdsourced data publication raises great challenges in terms of both computational efficiency and data utility. To this end, based on the expectation maximization (EM) algorithm and Lasso regression, we first propose efficient multi-dimensional joint distribution estimation algorithms with LDP. Then, we develop a local differentially private high-dimensional data publication algorithm (LoPub) by taking advantage of our distribution estimation techniques. In particular, correlations among multiple attributes are identified to reduce the dimensionality of crowdsourced data, thus speeding up the distribution learning process and achieving high data utility. Extensive experiments on real-world datasets demonstrate that our multivariate distribution estimation scheme significantly outperforms existing estimation schemes in terms of both communication overhead and estimation speed. Moreover, LoPub can keep, on average, 80% and 60% accuracy over the released datasets in terms of support vector machine and random forest classification, respectively.

关键词： Privacy Data privacy Servers Correlation Estimation Frequency estimation Sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：