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

arXiv 2020年

作者： Dixit, Vivek Selvarajan, Raja Aldwairi, Tamer Koshka, Yaroslav Novotny, Mark A. Humble, Travis S. Alam, Muhammad A. Kais, Sabre Department of Chemistry Department of Physics and Astronomy Purdue Quantum Science and Engineering Institute Purdue University West LafayetteIN47907 United States Department of Electrical and Computer Engineering Purdue University West LafayetteIN47907 United States Quantum Computing Institute Oak Ridge National Laboratory Oak RidgeTN United States Department of Computer and Information Sciences Temple University PhiladelphiaPA19122 United States Department of Electrical and Computer Engineering HPC2 Center for Computational Sciences Mississippi State University Mississippi StateMS39762 United States Department of Physics and Astronomy HPC2 Center for Computational Sciences Mississippi State University Mississippi StateMS39762 United States

—A restricted Boltzmann machine (RBM) is a generative model that could be used in effectively balancing a cybersecurity dataset because the synthetic data a RBM generates follows the probability distribution of the training data. RBM training can be performed using contrastive divergence (CD) and quantum annealing (QA). QA-based RBM training is fundamentally different from CD and requires samples from a quantum computer. We present a real-world application that uses a quantum computer. Specifically, we train a RBM using QA for cybersecurity applications. The D-Wave 2000Q has been used to implement QA. RBMs are trained on the ISCX data, which is a benchmark dataset for cybersecurity. For comparison, RBMs are also trained using CD. CD is a commonly used method for RBM training. Our analysis of the ISCX data shows that the dataset is imbalanced. We present two different schemes to balance the training dataset before feeding it to a classifier. The first scheme is based on the undersampling of benign instances. The imbalanced training dataset is divided into five sub-datasets that are trained separately. A majority voting is then performed to get the result. Our results show the majority vote increases the classification accuracy up from 90.24% to 95.68%, in the case of CD. For the case of QA, the classification accuracy increases from 74.14% to 80.04%. In the second scheme, a RBM is used to generate synthetic data to balance the training dataset. We show that both QA and CD-trained RBM can be used to generate useful synthetic data. Balanced training data is used to evaluate several classifiers. Copyright © 2020, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Conceptual model of real-time IoT systems

引用

Frontiers of information Technology & Electronic engineering 2019年第11期20卷 1457-1464页

作者： Bo YUAN De-ji CHEN Dong-mei XU Ming CHEN Department of Computer Science and Technology Tongji UniversityShanghai 201804China School of Electronics and Information Engineering Jinggangshan UniversityJi'an 343009China MOE Key Laboratory of Embedded System and Service Computing Tongji UniversityShanghai 201804China China Electronics Standardization Institute Beijing 100007China Chinesisch-Deutsche Hochschule for Angewandte Wissenschaften Tongji UniversityShanghai 201804China

We address a special kind of Internet of Things (IoT) systems that are also real-time. We call them real-time IoT (RT-IoT) systems. An RT-IoT system needs to meet timing constraints of system delay, clock synchronization, deadline, and so on. The timing constraints turn to be more stringent as we get closer to the physical things. Based on the reference architecture of IoT (ISO/IEC 30141), the RT-IoT conceptual model is established. The idea of edge subsystem is introduced. The sensing & con-trolling domain is the basis of the edge subsystem, and the edge subsystem usually must meet the hard real-time constraints. The model includes four perspectives, the time view, computation view, communication view, and control view. Each view looks, from a different angle, at how the time parameters impact an RT-IoT system.

关键词： Internet of Things(IoT) Real-time system Conceptual model View Hard/Soft real-time

来源：评论

学校读者我要写书评

暂无评论

Multinomial distribution learning for effective neural architecture search

arXiv

引用

arXiv 2019年

作者： Zheng, Xiawu Ji, Rongrong Tang, Lang Zhang, Baochang Liu, Jianzhuang Tian, Qi Fujian Key Laboratory of Sensing and Computing for Smart City Department of Cognitive Science School of Information Science and Engineering Xiamen University Xiamen China Peng Cheng Laboratory Shenzhen China Beihang University China Huawei Noahs Ark Lab Department of Computer Science University of Texas at San Antonio

Architectures obtained by Neural Architecture Search (NAS) have achieved highly competitive performance in various computer vision tasks. However, the prohibitive computation demand of forward-backward propagation in deep neural networks and searching algorithms makes it difficult to apply NAS in practice. In this paper, we propose a Multinomial Distribution Learning for extremely effective NAS, which considers the search space as a joint multinomial distribution, i.e., the operation between two nodes is sampled from this distribution, and the optimal network structure is obtained by the operations with the most likely probability in this distribution. Therefore, NAS can be transformed to a multinomial distribution learning problem, i.e., the distribution is optimized to have high expectation of the performance. Besides, a hypothesis that the performance ranking is consistent in every training epoch is proposed and demonstrated to further accelerate the learning process. Experiments on CIFAR-10 and ImageNet demonstrate the effectiveness of our method. On CIFAR-10, the structure searched by our method achieves 2.4% test error, while being 6.0× (only 4 GPU hours on GTX1080Ti) faster compared with state-of-the-art NAS algorithms. On ImageNet, our model achieves 75.2% top-1 accuracy under MobileNet settings (MobileNet V1/V2), while being 1.2× faster with measured GPU latency. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Consensus with Voting Theory in Blockchain Environments

Consensus with Voting Theory in Blockchain Environments

引用

IEEE International Conference on Big Knowledge (ICBK)

作者： Lei Li Yongkang Jiang Guanfeng Liu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Computing Department Macquarie University Sydney Australia

A blockchain can be taken as a decentralized and distributed public database. In order to achieve data consistency of the system nodes, the execution of a consensus algorithm is necessary and required in the case of decentralized environments. Simply speaking, the consensus is that every node agrees on some record in the blockchain. There are many kinds of consensus algorithms in blockchain environments, and each consensus algorithm has its own proper application scenario. Here we firstly analysis and compare various popular consensus algorithms in blockchain environments, and then as voting theory has systematically studied the decision-making in a group, the traditional methods of voting theory is summarized and listed, including (Position) scoring rules, Copeland, Maximin, Ranked pairs, Voting trees, Bucklin, Plurality with runoff, Single transferable vote, Baldwin rule, and Nanson rule. Finally, we introduce the voting methods from voting theory to consensus algorithms in the blockchain to improve its performance.

关键词： Blockchain Consensus algorithm Bitcoin Voting Knowledge engineering computer science Decision making

来源：评论

学校读者我要写书评

暂无评论

ANDROIDOFF:Offloading android application based on cost estimation

引用

Journal of Systems and Software 2019年 158卷 110418-000页

作者： Chen, Xing Chen, Jiaqing Liu, Bichun Ma, Yun Zhang, Ying Zhong, Hao College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China School of Software Tsinghua University Beijing100084 China National Engineering Research Center of Software Engineering Peking University China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China

Computation offloading is a promising way of improving the performance and reducing the battery power consumption, since it moves some time-consuming computation activities to nearby servers. Although various approaches have been proposed to support computation offloading, we argue that there is still sufficient space for improvements, since existing approaches cannot accurately estimate the execution costs. As a result, we find that their offloading plans are less optimized. To handle the problem, in this paper, given an Android application, we propose a novel approach, called ANDROIDOFF, that supports offloading at the granularity of objects. Supporting such capability is challenging due to the two reasons: (1) through dynamic execution, it is feasible to collect the execution costs of only partial methods, and (2) it is difficult to accurately estimate the execution costs of the remaining methods. To overcome the challenges, given an Android application, ANDROIDOFF first combines static and dynamic analysis to predict the execution costs of all its methods. After all the costs are estimated, ANDROIDOFF synthesizes an offloading plan, in which determines the offloading details. We evaluate ANDROIDOFF on a real-world application, with two mobile devices. Our results show that, compared with other approaches, ANDROIDOFF saves the response time by 8%–49% and reduces the energy consumption by 12%–49% on average for computation-intensive applications. © 2019 Elsevier Inc.

关键词： computation offloading

来源：评论

学校读者我要写书评

暂无评论

Improved Lossless Data Hiding for JPEG Images Based on Histogram Modification

引用

computers, Materials & Continua 2018年第6期55卷 495-507页

作者： Yang Du Zhaoxia Yin Xinpeng Zhang Key Laboratory of Intelligent Computing&Signal Processing Ministry of EducationAnhui UniversityHefei230601P.R.China Department of Computer Science Purdue UniversityWest lafayette47906USA School of Communication and Information Engineering Shanghai UniversityShanghai 200072P.R.China

This paper proposes a lossless and high payload data hiding scheme for JPEG images by histogram *** most in JPEG bitstream consists of a sequence of VLCs(variable length codes)and the appended *** VLC has a corresponding RLV(run/length value)to record the AC/DC *** achieve lossless data hiding with high payload,we shift the histogram of VLCs and modify the DHT segment to embed *** we sort the histogram of VLCs in descending order,the filesize expansion is *** paper’s key contribution includes:Lossless data hiding,less filesize expansion in identical pay-load and higher embedding efficiency.

关键词： Lossless data hiding histogram VLC JPEG.

来源：评论

学校读者我要写书评

暂无评论

Reduction theorem for secrecy over linear network code for active attacks

arXiv

引用

arXiv 2020年

作者： Hayashi, Masahito Owari, Masaki Kato, Go Cai, Ning Graduate School of Mathematics Nagoya University Nagoya464-8602 Japan Shenzhen Institute for Quantum Science and Engineering Southern University of Science and Technology Shenzhen518055 China Center for Quantum Computing Peng Cheng Laboratory Shenzhen518000 China Centre for Quantum Technologies National University of Singapore 3 Science Drive 2 117542 Singapore Department of Computer Science Faculty of Informatics Shizuoka University Japan NTT Communication Science Laboratories NTT Corporation Japan School of Information Science and Technology ShanghaiTech University Middle Huaxia Road no 393 Pudong Shanghai201210 China

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot improve the power of eavesdropping by sequential error injection when the operations in the network are linear *** demonstrate the usefulness of this reduction theorem by applying a concrete example of network. Copyright © 2020, The Authors. All rights reserved.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Supervised Online Hashing via Similarity Distribution Learning

arXiv

引用

arXiv 2019年

作者： Lin, Mingbao Ji, Rongrong Chen, Shen Zheng, Feng Sun, Xiaoshuai Zhang, Baochang Cao, Liujuan Guo, Guodong Huang, Feiyue Fujian Key Laboratory of Sensing and Computing for Smart City School of Information Science and Engineering Xiamen University China Peng Cheng Laboratory China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China School of Automation Science and Electrical Engineering Beihang University China Baidu Research Institute of Deep Learning Co. Ltd China

Online hashing has attracted extensive research attention when facing streaming data. Most online hashing methods, learning binary codes based on pairwise similarities of training instances, fail to capture the semantic relationship, and suffer from a poor generalization in largescale applications due to large variations. In this paper, we propose to model the similarity distributions between the input data and the hashing codes, upon which a novel supervised online hashing method, dubbed as Similarity Distribution based Online Hashing (SDOH), is proposed, to keep the intrinsic semantic relationship in the produced Hamming space. Specifically, we first transform the discrete similarity matrix into a probability matrix via a Gaussianbased normalization to address the extremely imbalanced distribution issue. And then, we introduce a scaling Student t-distribution to solve the challenging initialization problem, and efficiently bridge the gap between the known and unknown distributions. Lastly, we align the two distributions via minimizing the Kullback-Leibler divergence (KL-diverence) with stochastic gradient descent (SGD), by which an intuitive similarity constraint is imposed to update hashing model on the new streaming data with a powerful generalizing ability to the past data. Extensive experiments on three widely-used benchmarks validate the superiority of the proposed SDOH over the state-of-the-art methods in the online retrieval task. Copyright © 2019, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Observing Geometry of Quantum States in a Three-Level System

引用

Physical Review Letters 2020年第15期125卷 150401-150401页

作者： Jie Xie Aonan Zhang Ningping Cao Huichao Xu Kaimin Zheng Yiu-Tung Poon Nung-Sing Sze Ping Xu Bei Zeng Lijian Zhang National Laboratory of Solid State Microstructures Key Laboratory of Intelligent Optical Sensing and Manipulation (Ministry of Education) College of Engineering and Applied Sciences and School of Physics Nanjing University Nanjing 210093 China Collaborative Innovation Center of Advanced Microstructures Nanjing University Nanjing 210093 China Department of Mathematics & Statistics University of Guelph Guelph N1G 2W1 Ontario Canada Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Ontario Canada Department of Mathematics Iowa State University Ames Iowa 50011 USA Department of Applied Mathematics The Hong Kong Polytechnic University 999077 Hong Kong China Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha 410073 China Department of Physics The Hong Kong University of Science and Technology Clear Water Bay Kowloon 999077 Hong Kong China

In quantum mechanics, geometry has been demonstrated as a useful tool for inferring nonclassical behaviors and exotic properties of quantum systems. One standard approach to illustrate the geometry of quantum systems is to project the quantum state space onto the Euclidean space via measurements of observables on the system. Despite the great success of this method in studying two-level quantum systems (qubits) with the celebrated Bloch sphere representation, it is still difficult to reveal the geometry of multidimensional quantum systems. Here we report the first experiment measuring the geometry of such projections beyond the qubit. Specifically, we observe the joint numerical ranges of a triple of observables in a three-level photonic system, providing a complete classification of these ranges. We further show that the geometry of different classes reveals ground-state degeneracies of a Hamiltonian as a linear combination of the observables, which is related to quantum phases in the thermodynamic limit. Our results offer a versatile geometric approach for exploring the properties of higher-dimensional quantum systems.

关键词： Geometric & topological phases Quantum foundations Quantum measurements Quantum phase transitions

来源：评论

学校读者我要写书评

暂无评论

Donut Modes in Space Wavelength Division Multiplexing: Multimode Optical Fiber Transmission based on Electrical Feedback Equalizer

引用

Journal of Physics: Conference Series 2021年第1期1755卷

作者： Alaan Ghazi S. A. Aljunid Syed Zulkarnain Syed Idrus R. Endut N. Ali Angela Amphawan Alaa Fareed Aras Al-dawoodi Awab Noori School of Human Development & Techno-communication University Malaysia Perlis Malaysia School of Computer and Communication Engineering University Malaysia Perlis Malaysia. Computer Technical Engineering Al-Qalam University College Iraq Advanced Communication Engineering (ACE) Centre of Excellence Universiti Malaysia Perlis Malaysia. School of Microelectronic Engineering (SCCE) Universiti Malaysia Perlis Perlis Malaysia Lightwave Laboratory School of Engineering and Technology Sunway University 47500 Petaling Jaya Selangor Malaysia. School of Computing University Utara Malaysia Malaysia. Computer Science Department College of Computer Science and Information Technology Kirkuk University Iraq Data Science Research Lab School of Computing Universiti Utara Malaysia Malaysia

This study demonstrates the implementation of multi-input-multi-output (MIMO) transmission donut modes in space wavelength division multiplexing (SWDM) over multi-mode optical fiber (MMOF) and simulating the effect of mode coupling of the transmitted signal. However, during the data transmitted over MMF by using SWDM an issue is encountered, which is the inter symbol interference (ISI) due to mode coupling. ISI has been recognized as a major obstacle to high-speed data transmission. The signal processing in SDM of donut modes over MMOF with electrical feedback equalizer is used to improve the performance for increasing the bandwidth. A data rate 80 Gbit/s up for a distance of 1600 meters is achieved. SWDM topology was designed emitted from a spatial vertical cavity surface-emitting laser (VCSEL) through MMOF in conjunction with the configurations of electrical feedback equalizer. The parameters and values used in Opt-Sim simulation topology were listed. The performance measurement of this study based on bit-error rates (BER) and eye diagram before and after electrical feedback equalization were analysed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：