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

arXiv 2024年

作者： Iyer, Kartheik G. Yunus, Mikaeel O’Neill, Charles Ye, Christine Hyk, Alina McCormick, Kiera Ciucă, Ioana Wu, John F. Accomazzi, Alberto Astarita, Simone Chakrabarty, Rishabh Cranney, Jesse Field, Anjalie Ghosal, Tirthankar Ginolfi, Michele Huertas-Company, Marc Jablońska, Maja Kruk, Sandor Liu, Huiling Marchidan, Gabriel Mistry, Rohit Naiman, J.P. Peek, J.E.G. Polimera, Mugdha Rodríguez Méndez, Sergio J. Schawinski, Kevin Sharma, Sanjib Smith, Michael J. Ting, Yuan-Sen Walmsley, Mike Columbia Astrophysics Laboratory Columbia University 550 West 120th Street New YorkNY10027 United States Department of Physics and Astronomy Johns Hopkins University 3400 N. Charles Street BaltimoreMD21218 United States School of Computing TheAustralian National University 108 North Rd ActonACT2601 Australia Stanford University 450 Jane Stanford Way StanfordCA94305 United States School of Electrical Engineering and Computer Science Oregon State University 1500 SW Jefferson Way CorvallisOR97331 United States Department of Engineering Loyola University Maryland 4501 North Charles Street BaltimoreMD21210 United States Research School of Astronomy & Astrophysics Australian National University Cotter Rd. WestonACT2611 Australia School of Computing Australian National University ActonACT2601 Australia Kavli Institute for Particle Astrophysics and Cosmology Department of Physics Stanford University StanfordCA94305 United States Space Telescope Science Institute 3700 San Martin Drive BaltimoreMD21218 United States Center for Astrophysics Harvard & Smithsonian CambridgeMA02138 United States Camino Bajo del Castillo s/n Villanueva de la Cañada Madrid28692 Spain Paris France Astralis-AITC - Stromlo RSAA Australian National University Cotter Road WestonACT2600 Australia Department of Computer Science Johns Hopkins University 3400 North Charles Street BaltimoreMD21218 United States National Center for Computational Sciences Oak Ridge National Laboratory Oak RidgeTN37831 United States Dipartimento di Fisica e Astronomia Universita di Firenze Via G. Sansone 1 Sesto Fiorentino Firenze50019 Italy INAF - Osservatorio Astrofisico di Arcetri Largo E. Fermi 5 FirenzeI-50125 Italy Instituto de Astrofisica de Canarias C. Via Lactea 1 Tenerife La LagunaE-38205 Spain Universidad de la Laguna dept. Astrofisica Tenerife La LagunaE-38206 Spain Universite Paris-Cite LERMA - Observatoire de Paris PSL Paris France SCIPP University of

The exponential growth of astronomical literature poses significant challenges for researchers navigating and synthesizing general insights or even domain-specific knowledge. We present pathfinder, a machine learning framework designed to enable literature review and knowledge discovery in astronomy, focusing on semantic searching with natural language instead of syntactic searches with key-words. Utilizing state-of-the-art large language models (LLMs) and a corpus of 350,000 peer-reviewed papers from the Astrophysics Data System (ADS), pathfinder offers an innovative approach to scientific inquiry and literature exploration. Our framework couples advanced retrieval techniques with LLM-based synthesis to search astronomical literature by semantic context as a complement to currently existing methods that use key-words or citation graphs. It addresses complexities of jargon, named entities, and temporal aspects through time-based and citation-based weighting schemes. We demonstrate the tool’s versatility through case studies, showcasing its application in various research scenarios. The system’s performance is evaluated using custom benchmarks, including single-paper and multi-paper tasks. Beyond literature review, pathfinder offers unique capabilities for reformatting answers in ways that are accessible to various audiences (e.g. in a different language or as simplified text), visualizing research landscapes, and tracking the impact of observatories and methodologies. This tool represents a significant advancement in applying AI to astronomical research, aiding researchers at all career stages in navigating modern astronomy literature. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Training a quantum annealing based restricted Boltzmann machine on cybersecurity data

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Online Internet Anomaly Detection With High Accuracy: A Fast Tensor Factorization Solution

Online Internet Anomaly Detection With High Accuracy: A Fast...

引用

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

作者： Xiaocan Li Kun Xie Xin Wang Gaogang Xie Jigang Wen Guangxing Zhang Zheng Qin Department of Electrical and Computer Engineering State University of New York at Stony Brook USA College of Computer Science and Electronics Engineering Hunan University Changsha China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences

Traffic anomaly detection is critical for advanced Internet management. Existing detection algorithms usually work off-line and cannot timely detect anomalies. They also suffer from high cost for storage and computation. Although online and accurate traffic anomaly detection is very important, it very difficult to achieve. We propose to utilize tensor model to well exploit the multi-dimensional information hidden in the traffic data for more accurate online Internet anomaly detection. We decouple the tensor recovery problem to iteratively solve two sub problems, a tensor factorization sub-problem and an anomaly detection sub-problem. To reduce the high cost for computation and storage involved in tensor factorization, we propose two lightweight techniques to effectively derive factor matrices of tensor in the current window and iteration, taking advantage of tensor decomposition results of the previous window and iteration. We have done extensive experiments using two real traffic traces to compare with three tensor based algorithms and three matrix based algorithms. The experiment results demonstrate that our online anomaly detection algorithm can achieve the same anomaly detection accuracy as that of the best offline tensor based algorithm, but at 6100 times faster speed and with very low storage cost.

关键词： Anomaly detection Monitoring Matrix decomposition Microsoft Windows Principal component analysis Data models

来源：评论

学校读者我要写书评

暂无评论

Semantic web technologies for health data management 1

Semantic web technologies for health data management

引用

1st International Workshop on Semantic Web Technologies for Health Data Management, SWH 2018

作者： Kondylakis, Haridimos Rao, Praveen Stefanidis, Kostas Computational BioMedicine Laboratory Institute of Computer Science FORTH Greece Department of Computer Science and Electrical Engineering School of Computing and Engineering University of Missouri Kansas City United States Faculty of Natural Sciences University of Tampere Finland

来源：评论

学校读者我要写书评

暂无评论

Filter sketch for network pruning

arXiv

引用

arXiv 2020年

作者： Lin, Mingbao Cao, Liujuan Li, Shaojie Ye, Qixiang Tian, Yonghong Liu, Jianzhuang Tian, Qi Ji, Rongrong The Media Analytics and Computing Laboratory Department of Artificial Intelligence School of Informatics Xiamen University Xiamen361005 China The Fujian Key Laboratory of Sensing and Computing for Smart City Computer Science Department School of Informatics Xiamen University Xiamen361005 China Institute of Artificial Intelligence Xiamen University Xiamen361005 China School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing101408 China The School of Electronics Engineering and Computer Science Peking University Beijing100871 China The Noah's Ark Lab Huawei Technologies Co. Ltd. Shenzhen518129 China Cloud BU Huawei Technologies Co. Ltd. Shenzhen518129 China

We propose a novel network pruning approach by information preserving of pre-trained network weights (filters). Network pruning with the information preserving is formulated as a matrix sketch problem, which is efficiently solved by the off-the-shelf Frequent Direction method. Our approach, referred to as FilterSketch, encodes the second-order information of pre-trained weights, which enables the representation capacity of pruned networks to be recovered with a simple fine-tuning procedure. FilterSketch requires neither training from scratch nor data-driven iterative optimization, leading to a several-orders-of-magnitude reduction of time cost in the optimization of pruning. Experiments on CIFAR-10 show that FilterSketch reduces 63.3% of FLOPs and prunes 59.9% of network parameters with negligible accuracy cost for ResNet-110. On ILSVRC-2012, it reduces 45.5% of FLOPs and removes 43.0% of parameters with only 0.69% accuracy drop for ResNet-50. Our code and pruned models can be found at https://***/lmbxmu/FilterSketch. Copyright © 2020, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Distributed resource scheduling for large-scale MEC systems: A multi-agent ensemble deep reinforcement learning with imitation acceleration

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

We consider the optimization of distributed resource scheduling to minimize the sum of task latency and energy consumption for all the Internet of things devices (IoTDs) in a large-scale mobile edge computing (MEC) system. To address this problem, we propose a distributed intelligent resource scheduling (DIRS) framework, which includes centralized training relying on the global information and distributed decision making by each agent deployed in each MEC server. More specifically, we first introduce a novel multi-agent ensemble-assisted distributed deep reinforcement learning (DRL) architecture, which can simplify the overall neural network structure of each agent by partitioning the state space and also improve the performance of a single agent by combining decisions of all the agents. Secondly, we apply action refinement to enhance the exploration ability of the proposed DIRS framework, where the near-optimal state-action pairs are obtained by a novel Lvy flight search. Finally, an imitation acceleration scheme is presented to pre-train all the agents, which can significantly accelerate the learning process of the proposed framework through learning the professional experience from a small amount of demonstration data. Extensive simulations are conducted to demonstrate that the proposed DIRS framework is efficient and outperforms the existing benchmark schemes. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

On information-theoretic characterizations of markov random fields and subfields

On information-theoretic characterizations of markov random ...

引用

作者： Yeung, Raymond W. Al-Bashabsheh, Ali Chen, Chao Chen, Qi Moulin, Pierre Institute of Network Coding Chinese University of Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong Big Data and Brain Computing Center Beihang University Beijing100191 China State Key Laboratory of Integrated Service Networks Xidian University Xi'an710071 China Department of Electrical and Computer Engineering University of Illinois UrbanaIL61801 United States Coordinated Science Laboratory University of Illinois UrbanaIL61801 United States

Let Xi, i ϵ V form a Markov random field (MRF) represented by an undirected graph G = (V,E) , and V′ be a subset of V. We determine the smallest graph that can always represent the subfield Xi, i ϵ V′ as an MRF. Based on this result, we obtain a necessary and sufficient condition for a subfield of a Markov tree to be also a Markov tree. When G is a path so that Xi, i ϵ V form a Markov chain, it is known that the I -Measure is always nonnegative (Kawabata and Yeung in 1992). We prove that Markov chain is essentially the only MRF such that the I -Measure is always nonnegative. By applying our characterization of the smallest graph representation of a subfield of an MRF, we develop a recursive approach for constructing information diagrams for MRFs. Our work is built on the set-theoretic characterization of an MRF (Yeung et al. in 2002). © 1963-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Stacked auto encoder based Deep Reinforcement Learning for online resource scheduling in large-scale MEC networks

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom University of Electronic Science and Technology of China Chengdu China

An online resource scheduling framework is proposed for minimizing the sum of weighted task latency for all the mobile users, by optimizing offloading decision, transmission power, and resource allocation in the mobile edge computing (MEC) system. Towards this end, a deep reinforcement learning (DRL) method is proposed to obtain an online resource scheduling policy. Firstly, a related and regularized stacked auto encoder (2r-SAE) with unsupervised learning is proposed to perform data compression and representation for high dimensional channel quality information (CQI) data, which can reduce the state space for DRL. Secondly, we present an adaptive simulated annealing based approach (ASA) as the action search method of DRL, in which an adaptive h-mutation is used to guide the search direction and an adaptive iteration is proposed to enhance the search efficiency during the DRL process. Thirdly, a preserved and prioritized experience replay (2p-ER) is introduced to assist the DRL to train the policy network and find the optimal offloading policy. Numerical results are provided to demonstrate that the proposed algorithm can achieve near-optimal performance while significantly decreasing the computational time compared with existing benchmarks. It also shows that the proposed framework is suitable for resource scheduling problem in large-scale MEC networks, especially in the dynamic environment. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Designing and Training of A Dual CNN for Image Denoising

arXiv

引用

arXiv 2020年

作者： Zuo, Wangmeng Zhang, David Lin, Chia-Wen Xu, Yong Tian, Chunwei Du, Bo Bio-Computing Research Center Harbin Institute of Technology Shenzhen China Shenzhen Key Laboratory of Visual Object Detection and Recognition ShenzhenGuangdong518055 China Peng Cheng Laboratory Shenzhen518055 China School of Computer Science and Technology Harbin Institute of Technology 150001 HarbinHeilongjiang China Peng Cheng Laboratory Shenzhen518055 China School of Computer Science Wuhan University 430072 WuhanHubei China Department of Electrical Engineering Institute of Communications Engineering National Tsing Hua University Hsinchu Taiwan 518172 ShenzhenGuangdong China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

Deep convolutional neural networks (CNNs) for image denoising have recently attracted increasing research interest. However, plain networks cannot recover fine details for a complex task, such as real noisy images. In this paper, we propose a Dual denoising Network (DudeNet) to recover a clean image. Specifically, DudeNet consists of four modules: a feature extraction block, an enhancement block, a compression block, and a reconstruction block. The feature extraction block with a sparse mechanism extracts global and local features via two sub-networks. The enhancement block gathers and fuses the global and local features to provide complementary information for the latter network. The compression block refines the extracted information and compresses the network. Finally, the reconstruction block is utilized to reconstruct a denoised image. The DudeNet has the following advantages: (1) The dual networks with a parse mechanism can extract complementary features to enhance the generalized ability of denoiser. (2) Fusing global and local features can extract salient features to recover fine details for complex noisy images. (3) A Small-size filter is used to reduce the complexity of denoiser. Extensive experiments demonstrate the superiority of DudeNet over existing current state-of-the-art denoising methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：