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

computing Sparse GCD of Multivariate Polynomials via Polynomial Interpolation

Journal of Systems Science & Complexity 2018年第2期31卷 552-568页

作者： TANG Min LI Bingyu ZENG Zhenbing School of Mathematics and Computing Science Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin 541004 China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai 200062 China. Email: ***@***. School of Mathematics and Statistics Northeast Normal University Changchun 130024 China. Department of Mathematics Shanghai University Shanghai 200444 China

The problem of computing the greatest common divisor（GCD） of multivariate polynomials, as one of the most important tasks of computer algebra and symbolic computation in more general scope, has been studied extensively since the beginning of the interdisciplinary of mathematics with computer science. For many real applications such as digital image restoration and enhancement,robust control theory of nonlinear systems, L1-norm convex optimization in compressed sensing techniques, as well as algebraic decoding of Reed-Solomon and BCH codes, the concept of sparse GCD plays a core role where only the greatest common divisors with much fewer terms than the original polynomials are of interest due to the nature of problems or data structures. This paper presents two methods via multivariate polynomial interpolation which are based on the variation of Zippel＇s method and Ben-Or/Tiwari algorithm, respectively. To reduce computational complexity, probabilistic techniques and randomization are employed to deal with univariate GCD computation and univariate polynomial interpolation. The authors demonstrate the practical performance of our algorithms on a significant body of examples. The implemented experiment illustrates that our algorithms are efficient for a quite wide range of input.

关键词： Ben-Or/Tiwari algorithm multivariate polynomial interpolation sparse GCD Zippel＇s algorithm.

来源：评论

学校读者我要写书评

暂无评论

Onionchain: Towards balancing privacy and traceability of blockchain-based applications

arXiv

引用

arXiv 2019年

作者： Zhang, Yue Weng, Jian Weng, Jiasi Li, Ming Luo, Weiqi College of Informatin Science and Technology College of Cyber security National Joint Engineering Research Center of Network Security Detection and Protection Technology Guangdong Key Laboratory of Data Security and Privacy Preserving Jinan University Guangzhou510632 China

With the popularity of Blockchain comes grave security related concerns. Achieving privacy and traceability simultaneously remains an open question. Efforts have been made to address the issues, while they may subject to specific scenarios. This paper studies how to provide a more general solution for this open question. Concretely, we propose Onionchain, featuring a suite of protocols, offering both traceability and privacy. As the term implies, our Onionchain is inspired by Onion routing. We investigate the principles of Onion routing carefully and integrate its mechanism together with Blockchain technology. We advocate the Blockchain community to adopt Onionchain with the regards of privacy and traceability. To this end, a case-study of Onionchain, which runs in the context of Vehicular Ad Hoc networks (VANETs), is proposed, providing the community a guideline to follow. Systematic security analysis and extensive experiments are also conducted to validate our secure and cost-effective Onionchain. Copyright © 2019, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Monitoring an untrusted light source with single-photon detectors in measurement-device-independent quantum key distribution

引用

Physical Review A 2019年第5期99卷 052302-052302页

作者： Yucheng Qiao Gan Wang Zhengyu Li Bingjie Xu Hong Guo State Key Laboratory of Advanced Optical Communication System and Network School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Science and Technology on Security Communication Laboratory Institute of Southwestern Communication Chengdu 610041 China

Measurement-device-independent quantum key distribution (MDI-QKD) is proposed to close the loopholes of the detection part in QKD systems, while it still requires the light source to be trusted. This assumption is not guaranteed in practice, leading to practical secure issues. In this paper, we propose a light source monitoring scheme with single-photon detectors for MDI-QKD, which can guarantee the security of the system under the untrusted source condition with both common decoy state method and the newly proposed five-intensity decoy state method. Moreover, our monitoring scheme performs almost the same as the ideal MDI protocol even considering the imperfect factors in practical systems. Compared to the previous scheme, our work improves the secure key rate and the transmission distance of practical MDI-QKD systems significantly.

关键词： Quantum communication Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Fixed-state Log-MAP detection for intensity-modulation and direct-detection optical systems over dispersion-uncompensated links

arXiv

引用

arXiv 2020年

作者： Shuangyue, L.I.U. Zhou, Ji Wang, Haide Mengqi, G.U.O. Xuekai, X.U. Yueming, L.U. Qiao, Yaojun State Key Laboratory of Information Photonics and Optical Communications School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Department of Electronic Engineering College of Information Science and Technology Jinan University Guangzhou510632 China Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education School ofCyberspace Security Beijing University of Posts and Telecommunications Beijing100876 China

In this paper, an optimized detection using log-maximum a posteriori estimation with a fixed number of surviving states (fixed-state Log-MAP) is proposed for a C-band 64-Gbit/s intensity-modulation and direct-detection (IM/DD) on-off keying (OOK) system over a 100-km dispersion-uncompensated link. For dispersion-uncompensated links, maximum likelihood sequence estimation (MLSE) is usually employed to deal with the severe inter-symbol interference (ISI) caused by chromatic dispersion. However, MLSE has an exponential increase in computational complexity and state storage with an increase in memory length, which overloads the computing resources and internal storage space of the hardware. Compared to MLSE, the fixed-state Log-MAP decreases the computational complexity and state storage from an exponential order of memory length to a linear order of surviving states. The memory length of fixed-state Log-MAP is no longer limited by computing resources and storage resources of the hardware, which has the potential to compensate larger ISI. The experimental results show that the optimal receiver sensitivity using fixed-state Log-MAP detection has a 2-dB improvement compared to that using MLSE. In conclusion, the fixed-state Log-MAP detection shows potential for practical IM/DD optical systems over dispersion-uncompensated links. Copyright © 2020, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Optimizing Multi-Dimensional Packet Classification for Multi-Core Systems

引用

Journal of Computer Science & technology 2018年第5期33卷 1056-1071页

作者： Tong Shen Da-Fang Zhang Gao-Gang Xie Xin-Yi Zhang College of Computer Science and Electronic Engineering Hunan University Changsha 410082 China Network Technology Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China

Packet classification has been studied for decades; it classifies packets into specific flows based on a given rule set. As software-defined network was proposed, a recent trend of packet classification is to scale the five-tuple model to multi-tuple. In general, packet classification on multiple fields is a complex problem. Although most existing software-based algorithms have been proved extraordinary in practice, they are only suitable for the classic five-tuple model and difficult to be scaled up. Meanwhile, hardware-specific solutions are inflexible and expensive, and some of them are power consuming. In this paper, we propose a universal multi-dimensional packet classification approach for multi-core systems. In our approach, novel data structures and four decomposition-based algorithms are designed to optimize the classification and updating of rules. For multi-field rules, a rule set is cut into several parts according to the number of fields. Each part works independently. In this way, the fields are searched in parallel and all the partial results are merged together at last. To demonstrate the feasibility of our approach, we implement a prototype and evaluate its throughput and latency. Experimental results show that our approach achieves a 40% higher throughput than that of other decomposed-based algorithms and a 43% lower latency of rule incremental update than that of the other algorithms on average. Furthermore, our approach saves 39% memory consumption on average and has a good scalability.

关键词： multi-dimensional multi-core packet classification

来源：评论

学校读者我要写书评

暂无评论

GmFace: A mathematical model for face image representation using multi-gaussian

arXiv

引用

arXiv 2020年

作者： Zhang, Liping Li, Weijun Yu, Lina Dong, Xiaoli Sun, Linjun Ning, Xin Xu, Jian Qin, Hong Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China Center of Materials Science and Optoelectronics Engineering School of Microelectronics University of Chinese Academy of Sciences Beijing100049 China Beijing Key Laboratory of Semiconductor Neural Network Intelligent Sensing and Computing Technology Beijing100083 China

Establishing mathematical models is a ubiquitous and effective method to understand the objective world. Due to complex physiological structures and dynamic behaviors, mathematical representation of the human face is an especially challenging task. A mathematical model for face image representation called GmFace is proposed in the form of a multi-Gaussian function in this paper. The model utilizes the advantages of two-dimensional Gaussian function which provides a symmetric bell surface with a shape that can be controlled by parameters. The GmNet is then designed using Gaussian functions as neurons, with parameters that correspond to each of the parameters of GmFace in order to transform the problem of GmFace parameter solving into a network optimization problem of GmNet. The face modeling process can be described by the following steps: (1) GmNet initialization;(2) feeding GmNet with face image(s);(3) training GmNet until convergence;(4) drawing out the parameters of GmNet (as the same as GmFace);(5) recording the face model GmFace. Furthermore, using GmFace, several face image transformation operations can be realized mathematically through simple parameter computation. Copyright © 2020, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Construction of MDS Euclidean self-dual codes via two subsets

arXiv

引用

arXiv 2020年

作者： Fang, Weijun Xia, Shu-Tao Fu, Fang-Wei Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen518055 China PCL Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen518055 China Chern Institute of Mathematics and LPMC Nankai University Tianjin300071 China Tianjin Key Laboratory of Network and Data Security Technology Nankai University Tianjin300071 China

The parameters of a q-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a further study on the construction of MDS Euclidean self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The main idea of our construction is to choose suitable evaluation points such that the corresponding (extended) GRS codes are Euclidean self-dual. Firstly, we consider the evaluation set consists of two disjoint subsets, one of which is based on the trace function, the other one is a union of a subspace and its cosets. Then four new families of MDS Euclidean self-dual codes are constructed. Secondly, we give a simple but useful lemma to ensure that the symmetric difference of two intersecting subsets of finite fields can be taken as the desired evaluation set. Based on this lemma, we generalize our first construction and provide two new families of MDS Euclidean self-dual codes. Finally, by using two multiplicative subgroups and their cosets which have nonempty intersection, we present three generic constructions of MDS Euclidean self-dual codes with flexible parameters. Several new families of MDS Euclidean self-dual codes are explicitly *** Codes 94B05 Copyright © 2020, The Authors. All rights reserved.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

End-to-End AI-Based Point-of-Care Diagnosis System for Classifying Respiratory Illnesses and Early Detection of COVID-19

arXiv

引用

arXiv 2020年

作者： Belkacem, Abdelkader Nasreddine Ouhbi, Sofia Lakas, Abderrahmane Benkhelifa, Elhadj Chen, Chao Department of Computer and Network Engineering CIT UAEU UAE Department of Computer Science and Software Engineering CIT UAEU UAE Cloud Computing and Applications Reseach Lab Staffordshire University United Kingdom Key Laboratory of Complex System Control Theory and Application Tianjin University of Technology China

Respiratory symptoms can be a caused by different underlying conditions, and are often caused by viral infections, such as Influenza-like illnesses or other emerging viruses like the Coronavirus. These respiratory viruses, often, have common symptoms, including coughing, high temperature, congested nose, and difficulty breathing. However, early diagnosis of the type of the virus, can be crucial, especially in cases such as the recent COVID-19 pandemic. One of the factors that contributed to the spread of the pandemic, was the late diagnosis or confusing it with regular flu-like symptoms. Science has proved that one of the possible differentiators of the underlying causes of these different respiratory diseases is coughing, which comes in different types and forms. Therefore, a reliable lab-free tool for early and more accurate diagnosis that can differentiate between different respiratory diseases is very much needed. This paper proposes an end-to-end portable system that can record data from patients with symptom, including coughs (voluntary or involuntary) and translate them into health data for diagnosis, and with the aid of machine learning, classify them into different respiratory illnesses, including COVID-19. With the ongoing efforts to stop the spread of the COVID-19 disease everywhere today, and against similar diseases in the future, our proposed low cost and user-friendly solution can play an important part in the early diagnosis. Copyright © 2020, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

A Hole Repairing Method Based on Edge-Preserving Projection 12th

A Hole Repairing Method Based on Edge-Preserving Projection

引用

12th International Conference on e-Learning and Games, Edutainment 2018

作者： Wang, Yinghui Zhao, Yanni Wang, Ningna Ning, Xiaojuan Shi, Zhenghao Zhao, Minghua Lv, Ke Huang, Liangyi Institute of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory of Network Computing and Security Technology Xi’an China Department of Computer Science Shannxi Vocational and Technical College Xi’an China Booking B.V. Herengracht 597 Amsterdam1017 CE Netherlands Institute of Automation Chinese Academy of Sciences Beijing China School of Engineering and Applied Science George Washington University Washington D.C. United States

ISBN: (纸本)9783030237110

A point cloud hole repairing method based on edge-preserving projection is proposed in order to maintain sharp features of holes. First, the hole boundary points are acquired by quadrants and angles, then connections among 3D hole boundary points are projected onto the two-dimensional plane using the edge-preserving projection. Secondly, the two-dimensional region obtained from projection is subjected to point collectivization for obtaining filling points, at the same time, the radial-basis interpolation mapping technique is used to construct the hole surface according to the 3D hole boundary point. Finally, the two-dimensional filling points are reflected onto the surface of the constructed hole to complete hole repairing. Experimental results show that our method can effectively repair the hole of the point cloud and restore the sharp features of the hole. © 2019, Springer Nature Switzerland AG.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

A Hole Repairing Method Based on Slicing 12th

A Hole Repairing Method Based on Slicing

引用

12th International Conference on e-Learning and Games, Edutainment 2018

作者： Zhao, Yanni Wang, Yinghui Wang, Ningna Ning, Xiaojuan Shi, Zhenghao Zhao, Minghua Lv, Ke Huang, Liangyi Institute of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory of Network Computing and Security Technology Xi’an China Department of Computer Science Shannxi Vocational and Technical College Xi’an China Booking B.V. Herengracht 597 Amsterdam1017 CE Netherlands Institute of Automation Chinese Academy of Sciences Beijing China School of Engineering and Applied Science George Washington University Washington D.C. United States

ISBN: (纸本)9783030237110

The repairing of 3D point cloud holes has an important meaning to ensure the integrity of cloud data. We present a slice-based repairing method for 3D point cloud in this paper. Firstly, the model is horizontal sliced and each slice is projected on a two-dimensional plane, then the band-shaped points obtained during projection are clustered to select boundary points of the hole. Combined with optimal fitting points, the hole repairing point sets in the projection layer are re-sampled based on the cubic B-spline curve to fit boundary points. Finally, all hole repairing point sets in the projection layer are combined in 3D space to finish the entire hole recovery. The experimental results show that the proposed method can effectively repair complex holes for various point cloud models. © 2019, Springer Nature Switzerland AG.

关键词： Curve fitting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：