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

arXiv 2021年

作者： Yang, Xuan Zhang, S.-B. Wang, J.-S. Hobbs, G. Sun, T.-R. Manchester, R.N. Geng, J.-J. Russell, C.J. Luo, R. Tang, Z.-F. Wang, C. Wei, J.-J. Staveley-Smith, L. Dai, S. Li, Y. Yang, Y.-Y. Wu, X.-F. Purple Mountain Observatory Chinese Academy of Sciences Nanjing210023 China School of Astronomy and Space Sciences University of Science and Technology of China Hefei230026 China Tsung-Dao Lee Institute Shanghai Jiao Tong University Shanghai200240 China CSIRO Space and Astronomy Australia Telescope National Facility PO Box 76 EppingNSW1710 Australia CSIRO Scientific Computing Services Australian Technology Park Locked Bag 9013 AlexandriaNSW1435 Australia CSIRO Data61 Australian Technology Park Locked Bag 9013 AlexandriaNSW1435 Australia International Centre for Radio Astronomy Research University of Western Australia CrawleyWA6009 Australia Western Sydney University Locked Bag 1797 Penrith South DCNSW1797 Australia School of Physics and Electronic Science Guizhou Education University Guiyang550018 China

We have searched for weak fast radio burst (FRB) events using a database containing 568,736,756 transient events detected using the Parkes radio telescope between 1997 and 2001. In order to classify these pulses, and to identify likely FRB candidates, we used a machine learning algorithm based on ResNet. We identified 81 new candidate FRBs and provide details of their positions, event times, and dispersion measures. These events were detected in only one beam of the Parkes multibeam receiver. We used a relatively low S/N cutoff threshold when selecting these bursts and some have dispersion measures only slightly exceeding the expected Galactic contribution. We therefore present these candidate FRBs as a guide for follow-up observations in the search for repeating FRBs. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Design of Gesture Recognition System Based on Multi-Channel Myoelectricity Correlation

Design of Gesture Recognition System Based on Multi-Channel ...

引用

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Di Wu Huiyong Li Xuefeng Liu Jianwei Niu State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing (BDBC) Beihang University Hangzhou Innovation Research Institute Beihang University

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

Gesture recognition systems based on myoelectric signal have raised more and more attention from researchers. Traditional gesture recognition methods are susceptible to multiple types of noise and require a large number of features, which increase overhead and decrease recognition efficiency. Fully utilizing the characteristics of the signal to recognize gestures is a big challenge. This paper proposes an improved empirical mode decomposition method (XB-EMD) based on autocorrelation function to denoise myoelectric signal. In addition, a novel deep neural network (CRNet) which combines the CNN and RNN layers together is trained for classifying the gestures based on denoised myoelectric signal. Experimental results show that the proposed gesture recognition system can improve recognition effectiveness at 97.4\% with 10 typical gestures, and 72.55\% with 16 complicated gestures.

关键词： Correlation Gesture recognition Feature extraction Empirical mode decomposition Recurrent neural networks Sensors

来源：评论

学校读者我要写书评

暂无评论

Computational Approaches to Explainable Artificial Intelligence: Advances Intheory, Applications and Trends

SSRN

引用

SSRN 2023年

作者： Górriz, Juan Manuel Álvarez-Illán, I. Álvarez-Marquina, A. Arco, J.E. Atzmueller, M. Ballarini, F. Barakova, E. Bologna, G. Bonomini, P. Castellanos-Dominguez, G. Castillo-Barnes, D. Cho, S.B. Contreras, R. Cuadra, J.M. Domínguez, E. Domínguez-Mateos, F. Duro, R.J. Elizondo, D. Fernández-Caballero, A. Fernandez-Jover, E. Formoso, M.A. Gallego-Molina, N.J. Gamazo, J. García González, J. Garcia-Rodriguez, J. Garre, C. Garrigós, J. Gómez-Rodellar, A. Gómez-Vilda, P. Graña, M. Guerrero-Rodriguez, B. Hendrikse, S.C.F. Jimenez-Mesa, C. Jodra-Chuan, M. Julian, V. Kotz, G. Kutt, K. Leming, M. de Lope, J. Macas, B. Marrero-Aguiar, V. Martinez, J.J. Martinez-Murcia, F.J. Martínez-Tomás, R. Mekyska, J. Nalepa, G.J. Novais, P. Orellana, D. Ortiz, A. Palacios-Alonso, D. Palma, J. Pereira, A. Pinacho-Davidson, P. Pinninghoff, M.A. Ponticorvo, M. Psarrou, A. Ramírez, J. Rincón, M. Rodellar-Biarge, V. Rodríguez-Rodríguez, I. Roelofsma, P.H.M.P. Santos, J. Salas-Gonzalez, D. Salcedo-Lagos, P. Segovia, F. Shoeibi, A. Silva, M. Simic, D. Suckling, J. Treur, J. Tsanas, A. Varela, R. Wang, S.H. Wang, W. Zhang, Y.D. Zhu, H. Zhu, Z. Ferrández-Vicente, J.M. SiPBA at Data Science and Computational Intelligence Institute University of Granada Granada Spain University of Granada Granada Spain Dept. of Psychiatry University of Cambridge Cambridge United Kingdom Dept. of Communications Engineering University of Malaga Malaga Spain School of Computing and Mathematical Sciences University of Leicester Leicester United Kingdom Semantic Information Systems Group Osnabrück University Osnabrück Germany Osnabrück Germany Dept. of Electronics Computer Technology and Projects Universidad Politécnica de Cartagena Cartagena Spain Universitat Politècnica de València València Spain Institute of Applied Computer Science Jagiellonian University Kraków Poland Dept. of Information and Communication Engineering University of Murcia Murcia Spain Dept. of Computer Science and Information Technologies University of A Coruña A Coruña Spain Dept. of Computer Science University of Oviedo Oviedo Spain Buenos Aires Argentina Buenos Aires Argentina Eindhoven University of Technology Eindhoven5612 AZ Netherlands Dept. of Computer Science University of Malaga Malaga Spain De Montfort University Leicester United Kingdom Dept. of Computer Science Faculty of Engineering Universidad de Concepción Concepción Chile Neurocognition and Emotion Research Unit Albacete Research Institute of Informatics University of Castilla-La Mancha Albacete Spain Dept. of Educational Informatics Universidad de Concepción Concepción Chile Madrid Spain Dept. of Humanistic Studies University of Naples Federico II Napoli Italy Escuela Técnica Superior de Ingeniería Informática Universidad Rey Juan Carlos Campus de Móstoles Móstoles Madrid28933 Spain Neuromorphic Speech Processing Lab Center for Biomedical Technology Universidad Politécnica de Madrid Campus de Montegancedo Pozuelo de Alarcón Madrid28223 Spain Biomedical Research Networking Center in Mental Health Instituto de Salud Carlos III Madrid28016 Spain Usher Institute Faculty o

Groundbreaking advances in theoretical and applied Artificial Intelligence (AI). DL algorithms are groundedin non-linear and complex artificial neural systems that progressively extract higher-level features from *** is frequently compared with human-level performance in real-world tasks, such as clinical diagnostics. Itis also a turning point in solving otherwise intractable problems in the design of virtual agents or robotics;orin providing novel insight into disease progress in genomics and Neuroimaging (NI), understanding humanbrain function, the automation of industrial processes based on computer vision, and so on. In this paper, themost relevant advances from the last few years in AI and several applications to neuroscience, neuroimaging,computer vision, and robotics are presented, reviewed and discussed. In this way, we summarize the state-ofthe-art in AI methods, models and applications within a collection of works presented at the 9th InternationalConference on the Interplay between Natural and Artificial Computation (IWINAC). The works presentedin this paper are excellent examples of new scientific discoveries made in laboratories that are successfullytransferred to real-life applications. © 2023, The Authors. All rights reserved.

关键词： Neuroimaging

来源：评论

学校读者我要写书评

暂无评论

Approximation and competitive algorithms for single-minded selling problem 1

引用

12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018

作者： Chin, Francis Y. L. Poon, Sheung-Hung Ting, Hing-Fung Xu, Dachuan Yu, Dongxiao Zhang, Yong Department of Computer Science The University of Hong Kong Pok Fu Lam Hong Kong School of Computer Science University of Nottingham Ningbo China Ningbo China Beijing Institute for Scientific and Engineering Computing Beijing University of Technology Beijing China Institute of Intelligent Computing School of Computer Science and Technology Shandong University Qingdao266237 China Research Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis Technology Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China

ISBN: (数字)9783030046187

ISBN: (纸本)9783030046170

The problem of item selling with the objective of maximizing the revenue is studied. Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must carefully assign some amount of bundles to each buyer with respect to the buyer’s accepted price. Each buyer bi is associated with a value function vi(·) such that vi(x) is the accepted unit bundle price bi is willing to pay for x bundles. We show that the single-minded item selling problem is NP-hard. Moreover, we give an O(√k)-approximation algorithm. For the online version, i.e., the buyers come one by one and the decision on each buyer must be made before the arrival of the next buyer, an O(√k · (log h + log k))- competitive algorithm is achieved, where h is the highest unit item price among all buyers. © Springer Nature Switzerland AG 2018.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Foundation models and intelligent decision-making: Progress, challenges, and perspectives

引用

The Innovation 2025年第6期6卷

作者： Jincai Huang Yongjun Xu Qi Wang Qi (Cheems) Wang Xingxing Liang Fei Wang Zhao Zhang Wei Wei Boxuan Zhang Libo Huang Jingru Chang Liantao Ma Ting Ma Yuxuan Liang Jie Zhang Jian Guo Xuhui Jiang Xinxin Fan Zhulin An Tingting Li Aiguo Fei Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center for Software Engineering Peking University Beijing 100871 China College of Systems Engineering National University of Defense Technology Changsha 410073 China Department of Oral Implantology Peking University School and Hospital of Stomatology Beijing 100081 China Laboratory for Big Data and Decision National University of Defense Technology Changsha 410073 China School of Automation Beijing Institute of Technology Beijing 100081 China Huazhong University of Science and Technology Wuhan 430074 China University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of AI Safety Beijing 100190 China Department of Automation Tsinghua University Beijing 100084 China School of Information Science and Engineering Dalian Polytechnic University Dalian 116034 China The Hong Kong University of Science and Technology (Guangzhou) Guangzhou 511453 China College of Information and Electrical Engineering China Agricultural University Beijing 100083 China State Key Laboratory of Efficient Utilization of Agricultural Water Resources Beijing 100083 China IDEA Research International Digital Economy Academy Shenzhen 518057 China School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing 100876 China

Intelligent decision-making (IDM) is a cornerstone of artificial intelligence (AI) designed to automate or augment decision processes. Modern IDM paradigms integrate advanced frameworks to enable intelligent agents to make effective and adaptive choices and decompose complex tasks into manageable steps, such as AI agents and high-level reinforcement learning. Recent advances in multimodal foundation-based approaches unify diverse input modalities—such as vision, language, and sensory data—into a cohesive decision-making process. Foundation models (FMs) have become pivotal in science and industry, transforming decision-making and research capabilities. Their large-scale, multimodal data-processing abilities foster adaptability and interdisciplinary breakthroughs across fields such as healthcare, life sciences, and education. This survey examines IDM’s evolution, advanced paradigms with FMs and their transformative impact on decision-making across diverse scientific and industrial domains, highlighting the challenges and opportunities in building efficient, adaptive, and ethical decision systems.

关键词： artificial intelligence intelligent decision-making foundation models agent large language model

来源：评论

学校读者我要写书评

暂无评论

Τ-FPL: Tolerance-constrained learning in linear time 32

Τ-FPL: Tolerance-constrained learning in linear time

引用

32nd AAAI Conference on Artificial Intelligence, AAAI 2018

作者： Zhang, Ao Li, Nan Pu, Jian Wang, Jun Yan, Junchi Zha, Hongyuan Shanghai Key Laboratory of Trustworthy Computing MOE International Joint Lab of Trustworthy Software School of Computer Science and Software Engineering East China Normal University Shanghai China Institute of Data Science and Technologies Alibaba Group Hangzhou China IBM Research China Georgia Institute of Technology Atlante United States

ISBN: (纸本)9781577358008

In many real-world applications, learning a classifier with false-positive rate under a specified tolerance is appealing. Existing approaches either introduce prior knowledge dependent label cost or tune parameters based on traditional classifiers, which are of limitation in methodology since they do not directly incorporate the false-positive rate tolerance. In this paper, we propose a novel scoring-thresholding approach, τ-False Positive Learning (τ-FPL) to address this problem. We show that the scoring problem which takes the false-positive rate tolerance into accounts can be efficiently solved in linear time, also an out-of-bootstrap thresholding method can transform the learned ranking function into a low false-positive classifier. Both theoretical analysis and experimental results show superior performance of the proposed τ-FPL over the existing approaches. Copyright © 2018, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

All-electron periodic G0W0 implementation with numerical atomic orbital basis functions: Algorithm and benchmarks

引用

Physical Review Materials 2021年第1期5卷 013807-013807页

作者： Xinguo Ren Florian Merz Hong Jiang Yi Yao Markus Rampp Hermann Lederer Volker Blum Matthias Scheffler Beijing National Laboratory for Condensed Matter Physics Institute of Physics Chinese Academy of Sciences 3rd South Str. 8 Beijing 100190 China Lenovo HPC Innovation Center Meitnerstr. 9 D-70563 Stuttgart Germany Beijing National Laboratory for Molecular Sciences College of Chemistry and Molecular Engineering Peking University Beijing 100871 China Department of Chemistry University of North Carolina Chapel Hill North Carolina 27599 USA Department of Mechanical Engineering and Materials Science Duke University Durham North Carolina 27708 USA Max Planck Computing and Data Facility Giessenbachstrasse 2 D-85748 Garching Germany Department of Chemistry Duke University Durham North Carolina 27708 USA Fritz-Haber-Institut der Max-Planck-Gesellschaft Faradayweg 4-6 D-14195 Berlin Germany Physics Department Humboldt-Universität zu Berlin Zum Großen Windkanal 6 D-12489 Berlin Germany

We present an all-electron, periodic G0W0 implementation within the numerical atomic orbital (NAO) basis framework. A localized variant of the resolution-of-the-identity (RI) approximation is employed to significantly reduce the computational cost of evaluating and storing the two-electron Coulomb repulsion integrals. We demonstrate that the error arising from localized RI approximation can be reduced to an insignificant level by enhancing the set of auxiliary basis functions, used to expand the products of two single-particle NAOs. An efficient algorithm is introduced to deal with the Coulomb singularity in the Brillouin zone sampling that is suitable for the NAO framework. We perform systematic convergence tests and identify a set of computational parameters, which can serve as the default choice for most practical purposes. Benchmark calculations are carried out for a set of prototypical semiconductors and insulators, and compared to independent reference values obtained from an independent G0W0 implementation based on linearized augmented plane waves (LAPWs) plus high-energy localized orbitals (HLOs) basis set, as well as experimental results. With a moderate (FHI-aims tier 2) NAO basis set, our G0W0 calculations produce band gaps that typically lie in between the standard LAPW and the LAPW+HLO results. Complementing tier 2 with highly localized Slater-type orbitals (STOs), we find that the obtained band gaps show an overall convergence towards the LAPW+HLO results. The algorithms and techniques developed in this work pave the way for efficient implementations of correlated methods within the NAO framework.

关键词： Band gap Density functional calculations GW method Random phase approximation

来源：评论

学校读者我要写书评

暂无评论

When the signal is in the noise: Exploiting diffix’s sticky noise

arXiv

引用

arXiv 2018年

作者： Gadotti, Andrea Houssiau, Florimond Rocher, Luc Livshits, Benjamin de Montjoye, Yves-Alexandre Department of Computing and Data Science Institute Imperial College London ICTEAM Université catholique de Louvain

Anonymized data is highly valuable to both businesses and researchers. A large body of research has however shown the strong limits of the de-identification release-and-forget model, where data is anonymized and shared. This has led to the development of privacy-preserving query-based systems. Based on the idea of "sticky noise", Diffix has been recently proposed as a novel query-based mechanism satisfying alone the EU Article 29 Working Party’s definition of anonymization. According to its authors, Diffix adds less noise to answers than solutions based on differential privacy while allowing for an unlimited number of queries. This paper presents a new class of noise-exploitation attacks, exploiting the noise added by the system to infer private information about individuals in the dataset. Our first differential attack uses samples extracted from Diffix in a likelihood ratio test to discriminate between two probability distributions. We show that using this attack against a synthetic best-case dataset allows us to infer private information with 89.4% accuracy using only 5 attributes. Our second cloning attack uses dummy conditions that conditionally strongly affect the output of the query depending on the value of the private attribute. Using this attack on four real-world datasets, we show that we can infer private attributes of at least 93% of the users in the dataset with accuracy between 93.3% and 97.1%, issuing a median of 304 queries per user. We show how to optimize this attack, targeting 55.4% of the users and achieving 91.7% accuracy, using a maximum of only 32 queries per user. Our attacks demonstrate that adding data-dependent noise, as done by Diffix, is not sufficient to prevent inference of private attributes. We furthermore argue that Diffix alone fails to satisfy Art. 29 WP’s definition of anonymization. We conclude by discussing how non-provable privacy-preserving systems can be combined with fundamental security principles such as defense-in-depth

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

McDiarmid-Type inequalities for graph-dependent variables and stability bounds

arXiv

引用

arXiv 2019年

作者： Zhang, Rui Ray Liu, Xingwu Wang, Yuyi Wang, Liwei School of Mathematics Monash University Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences ETH Zurich Switzerland X-Order Lab China Key Laboratory of Machine Perception MOE School of EECS Peking University Center for Data Science

A crucial assumption in most statistical learning theory is that samples are independently and identically distributed (i.i.d.). However, for many real applications, the i.i.d. assumption does not hold. We consider learning problems in which examples are dependent and their dependency relation is characterized by a graph. To establish algorithm-dependent generalization theory for learning with non-i.i.d. data, we first prove novel McDiarmid-type concentration inequalities for Lipschitz functions of graph-dependent random variables. We show that concentration relies on the forest complexity of the graph, which characterizes the strength of the dependency. We demonstrate that for many types of dependent data, the forest complexity is small and thus implies good concentration. Based on our new inequalities we are able to build stability bounds for learning from graph-dependent data. Copyright © 2019, The Authors. All rights reserved.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：