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

The Spatial-Temporal Evolution and Influencing Factors of Public Attention to 5G: Empirical Analysis Based on Baidu Index from 2011 to 2021

引用

Mathematical Problems in Engineering 2023年第1期2023卷

作者： Liu, Pan Wang, Guanyu Liu, Kai Li, Junke Chen, Yanlin School of Information Engineering Suqian University Jiangsu Suqian223800 China School of Computer and Information Qiannan Normal University for Nationalities Guizhou Duyun558000 China Key Laboratory of Machine Learning and Unstructured Data Processing of Qiannan Guizhou Duyun558000 China Key Laboratory of Complex Systems and Intelligent Optimization of Guizhou Duyun558000 China

The development of 5G (fifth-generation wireless systems) determines the future direction of technology and economy and has received extensive public attention. Studying the changing rules of public attention to 5G can provide an important guiding significance for the sustainable development of 5G. This paper takes Baidu Index as the measurement index of 5G public attention and analyzes the spatial and temporal evolution characteristics and influencing factors of public attention to 5G from 2011 to 2021 by using the elasticity coefficient, Gini coefficient, geographical concentration index, and panel data model. The results of the study show the following. (1) The public concern to 5G is generally on the rise, but the heat has declined in the past two years. (2) The public’s 5G attention shows a seasonal effect, with the highest attention in March and June. (3) The spatial difference of 5G public attention is obvious. The eastern region has a high degree of attention, the internal differences between the eastern and western regions are obvious, and the central region is relatively balanced. (4) The factors such as local economic level, education level, Internet development, and media attention have significantly affected the public focus on 5G. Also, some suggestions are made for the sustainable development of 5G and the planning of 6G (sixth-generation wireless systems). Copyright © 2023 Pan Liu et al.

关键词： Sustainable development

来源：评论

学校读者我要写书评

暂无评论

Robust Barron-Loss Tucker Tensor Decomposition

TechRxiv

引用

TechRxiv 2021年

作者： Mozaffari, Mahsa Markopoulos, Panos P. Department of Electrical and Microelectronic Engineering Machine Learning Optimization and Signal Processing Laboratory Rochester Institute of Technology RochesterNY14623 United States

Tucker decomposition is a standard method for the analysis of high-order tensor data. Standard Tucker decomposition generalizes singular-value decomposition and is formulated as minimization of the L2-norm of the low-rank approximation error. Due to the quadratic emphasis on peripheral data, the L2-norm based formulation of Tucker has been shown to be sensitive against corruptions. L1-norm-based variants (L1-Tucker) are proposed as robust Tucker decomposition methods, and are formulated as subspace estimators by absolute-projection maximization, and have proven effective in outlier resistant subspace computation. However, Tucker decomposition for robust low-rank tensor approximation is not defined/optimized in the literature. In this work, we propose a new formulation for low-rank tensor approximation, with tunable outlier-robustness, and present a unified algorithmic solution framework. This formulation relies on a new generalized robust loss function (Barron loss), which encompasses several well-known loss-functions with variable outlier-resistance. The robustness of the proposed framework is corroborated by the presented numerical studies on synthetic and real data. © 2021, CC BY.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Research Status of Information Technology Education Literature in China and Abroad

Analysis of the Research Status of Information Technology Ed...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Yulin Zhao Kai Liu Junke Li School of Computer and Information Qiannan Normal University for Nationalities Duyun China Key Laboratory of Machine learning and Unstructured Data Processing of Qiannan Duyun China School of Information Engineering Suqian University Suqian Jiangsu China Key Laboratory of Complex Systems and Intelligent Optimization of Guizhou Duyun China Jiangsu Province Engineering Research Center of Smart Poultry Farming and Intelligent Equipment Jiangsu China

Information technology education contributes to the development of national education. Understanding the research status of information technology education at home and abroad is helpful to the implementation of education informatization. This paper takes the information technology education research literature collected by CNKI and the Web of Science database as the object and uses the bibliometric method to analyze the literature characteristics of information technology education at home and abroad. Specifically, the paper mainly carries out statistical analysis from the time distribution of literature, journal distribution, and hot keywords, and visually describes the literature features of the information technology education discipline, providing references for the research of information technology education discipline at home and abroad.

关键词： Statistical analysis Databases Education Bibliometrics Educational technology Market research Internet

来源：评论

学校读者我要写书评

暂无评论

Lung Ultrasound for the Detection of Pulmonary Tuberculosis Using Expert- and AI-Guided Interpretation: A Prospective Cohort Study

SSRN

引用

SSRN 2025年

作者： Suttels, Véronique Brokowski, Trevor Wachinou, Ablo Prudence Wolleb, Julia Hada, Aboudou Rasisou Du Toit, Jacques Daniel Fiogbé, Arnauld Attannon Guendehou, Brice Alovokpinhou, Frederic Sefou, Fadyl Makpemikpa, Ginette Bessat, Cécile Roux, Alexia Garcia, Elena Brahier, Thomas Opota, Onya Doenz, Jonathan Vignoud, Julien Agodokpessi, Gildas Affolabi, Dissou Hartley, Mary-Anne Boillat-Blanco, Noémie Department of Medicine Infectious Diseases Lausanne University Hospital University of Lausanne Lausanne Switzerland Yale School of Medicine Department of Biomedical Informatics & Data Science New HavenCT06510 United States Cotonou Benin Faculty of Health Sciences University of the Witwatersrand Johannesburg South Africa Emergency Department Lausanne University Hospital University of Lausanne Lausanne1011 Switzerland Institute of Microbiology University of Lausanne University Hospital Centre Lausanne Switzerland Lausanne1015 Switzerland National Reference Laboratory for Mycobacteriology Cotonou Benin Yale University United States Faculty of Health Sciences Benin Intelligent Global Health Machine Learning and Optimization Laboratory

Background: Point-of-care lung ultrasound (LUS) is a promising tool for portable sputum-free tuberculosis (TB) triage. We investigate the diagnostic performance of LUS to detect TB using expert and artificial intelligence (AI) guided interpretation. We introduce ULTR-AI (Ultrasound-led TB recognition using AI), a suite of deep learning (DL) models designed to automate TB prediction from LUS images. Methods: In this prospective cohort study in a tertiary center in urban Benin, a standardized 14-point sliding scan LUS protocol was performed for symptomatic patients by a trained operator. LUS images were reviewed by two blinded and independent readers. Same-day single sputum Xpert MTB/RIF Ultra® was the microbiological reference standard. The suite comprises three AI models, ULTR-AI, ULTR-AI[signs] and ULTR-AI[max]. ULTR-AI predicts TB directly from images using DL, ULTR-AI[signs] first generates human-recognizable pathological signs before TB risk prediction in a machine learning (ML) model. Finally, ULTR-AI[max] takes the maximal TB risk score predicted by these two models. Findings: Out of 760 patients screened, 504 were analyzed. Median age was 40 (IQR 30-52), 196 (39%) were female, 78 (15%) were people with HIV and 66 (13%) had previous TB. Overall, 192 (38%) had bacteriologically confirmed TB. Human expert interpretation of lung ultrasound achieved a sensitivity of 0·90 (95%CI: 0·89, 0·92), specificity of 0·61 (95%CI: 0·54, 0·67) [AUROC 0·84, 95% CI: 0.82-0.85]. AI-guided interpretation with ULTRA-AI[max] reached a sensitivity of 0·91 (95% CI, 0·90–0·96) and a specificity of 0·85 (95% CI, 0·74–0·88) [AUROC 0·93, 95% 0·92-0·95]. Interpretation: In this cohort, AI-guided LUS meets the WHO requirements for a sputum-free TB triage test, enabling point-of-care testing with minimal infrastructure. ULTR-AI could further help decentralize TB diagnostics in LMICs, improving timely detection. Validation in diverse populations is crucial to confirm clinical utility. © 2025,

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Simple unsupervised keyphrase extraction using sentence embeddings 22

Simple unsupervised keyphrase extraction using sentence embe...

引用

22nd Conference on Computational Natural Language learning, CoNLL 2018

作者： Bennani-Smires, Kamil Musat, Claudiu Hossmann, Andreaa Baeriswyl, Michael Jaggi, Martin Data Analytics and AI Swisscom AG Switzerland Machine Learning and Optimization Laboratory EPFL Switzerland

ISBN: (纸本)9781948087728

Keyphrase extraction is the task of automatically selecting a small set of phrases that best describe a given free text document. Supervised keyphrase extraction requires large amounts of labeled training data and generalizes very poorly outside the domain of the training data. At the same time, unsupervised systems have poor accuracy, and often do not generalize well, as they require the input document to belong to a larger corpus also given as input. Addressing these drawbacks, in this paper, we tackle keyphrase extraction from single documents with EmbedRank: a novel unsupervised method, that leverages sentence embeddings. EmbedRank achieves higher F-scores than graph-based state of the art systems on standard datasets and is suitable for real-time processing of large amounts of Web data. With EmbedRank, we also explicitly increase coverage and diversity among the selected keyphrases by introducing an embedding-based maximal marginal relevance (MMR) for new phrases. A user study including over 200 votes showed that, although reducing the phrases’ semantic overlap leads to no gains in F-score, our high diversity selection is preferred by humans. © 2018 Association for Computational Linguistics.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Sparsified SGD with memory 18

Sparsified SGD with memory

引用

Proceedings of the 32nd International Conference on Neural Information Processing Systems

作者： Sebastian U. Stich Jean-Baptiste Cordonnier Martin Jaggi Machine Learning and Optimization Laboratory (MLO) EPFL Switzerland

Huge scale machine learning problems are nowadays tackled by distributed optimization algorithms, i.e. algorithms that leverage the compute power of many devices for training. The communication overhead is a key bottleneck that hinders perfect scalability. Various recent works proposed to use quantization or sparsification techniques to reduce the amount of data that needs to be communicated, for instance by only sending the most significant entries of the stochastic gradient (top-k sparsification). Whilst such schemes showed very promising performance in practice, they have eluded theoretical analysis so *** this work we analyze Stochastic Gradient Descent (SGD) with k-sparsification or compression (for instance top-k or random-k) and show that this scheme converges at the same rate as vanilla SGD when equipped with error compensation (keeping track of accumulated errors in memory). That is, communication can be reduced by a factor of the dimension of the problem (sometimes even more) whilst still converging at the same rate. We present numerical experiments to illustrate the theoretical findings and the good scalability for distributed applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Simple unsupervised keyphrase extraction using sentence embeddings

arXiv

引用

arXiv 2018年

作者： Bennani-Smires, Kamil Musat, Claudiu Hossmann, Andreaa Baeriswyl, Michael Jaggi, Martin Data Analytics & AI Swisscom AG Machine Learning and Optimization Laboratory EPFL

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Gene locations may contribute to predicting gene regulatory relationships

引用

Journal of Zhejiang University-Science B(Biomedicine & Biotechnology) 2018年第1期19卷 25-37页

作者： Jun MENG Wen-yuan XU Xiao CHEN Tao LIN Xiao-yu DENG Department of System Science and Engineering School of Electrical Engineering Zhejiang University Laboratory of Machine Learning and Optimization école Polytechnique Fédérale de Lausanne (EPFL)

We propose that locations of genes on chromosomes can contribute to the prediction of gene regulatory relationships. We constructed a time-based gene regulatory network of zebrafish cardiogenesis on the basis of a spatio-temporal neighborhood method. Through the network, specific regulatory pathways and order of gene expression during zebrafish cardiogenesis were obtained. By comparing the order with locations of these genes on chromosomes, we discovered that there exists a reversal phenomenon between the order and order of gene locations. The discovery provides an inherent rule to instruct exploration of gene regulatory relationships. Specifically, the discovery can help to predict if regulatory relationships between genes exist and contribute to evaluating the correctness of discovered gene regulatory relationships.

关键词： Prediction Gene regulatory relationships Order of gene location Spatio-temporal neighborhood method Zebrafish cardiogenesis

来源：评论

学校读者我要写书评

暂无评论

Fast and accurate uncertainty estimation in chemical machine learning

arXiv

引用

arXiv 2018年

作者： Musil, Felix Willatt, Michael J. Langovoy, Mikhail A. Ceriotti, Michele Laboratory of Computational Science and Modeling IMX École Polytechnique Fédérale de Lausanne Lausanne1015 Switzerland Machine Learning & Optimization Laboratory IC École Polytechnique Fédérale de Lausanne Lausanne1015 Switzerland

We present a scheme to obtain an inexpensive and reliable estimate of the uncertainty associated with the predictions of a machine-learning model of atomic and molecular properties. The scheme is based on resampling, with multiple models being generated based on sub-sampling of the same training data. The accuracy of the uncertainty prediction can be benchmarked by maximum likelihood estimation, which can also be used to correct for correlations between resampled models, and to improve the performance of the uncertainty estimation by a cross-validation procedure. In the case of sparse Gaussian Process Regression models, this resampled estimator can be evaluated at negligible cost. We demonstrate the reliability of these estimates for the prediction of molecular energetics, and for the estimation of nuclear chemical shieldings in molecular crystals. Extension to estimate the uncertainty in energy differences, forces, or other correlated predictions is straightforward. This method can be easily applied to other machine learning schemes, and will be beneficial to make data-driven predictions more reliable, and to facilitate training-set optimization and active-learning strategies. Copyright © 2018, The Authors. All rights reserved.

关键词： Molecular crystals

来源：评论

学校读者我要写书评

暂无评论

Safe adaptive importance sampling

arXiv

引用

arXiv 2017年

作者： Stich, Sebastian U. Raj, Anant Jaggi, Martin EPFL Machine Learning and Optimization Laboratory Max Planck Institute for Intelligent Systems

Importance sampling has become an indispensable strategy to speed up optimization algorithms for large-scale applications. Improved adaptive variants-using importance values defined by the complete gradient information which changes during optimization- enjoy favorable theoretical properties, but are typically computationally infeasible. In this paper we propose an efficient approximation of gradient-based sampling, which is based on safe bounds on the gradient. The proposed sampling distribution is (i) provably the best sampling with respect to the given bounds, (ii) always better than uniform sampling and fixed importance sampling and (iii) can efficiently be computed-in many applications at negligible extra cost. The proposed sampling scheme is generic and can easily be integrated into existing algorithms. In particular, we show that coordinate-descent (CD) and stochastic gradient descent (SGD) can enjoy significant a speed-up under the novel scheme. The proven efficiency of the proposed sampling is verified by extensive numerical testing.90C25, 68W20, 68Q25 Copyright © 2017, The Authors. All rights reserved.

关键词： Importance sampling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：