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

arXiv 2020年

作者： Cheng, Lei Chen, Zhongtao Shi, Qingjiang Wu, Yik-Chung Theodoridis, Sergios The College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China Hangzhou310027 China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong The School of Software Engineering Tongji University Shanghai201804 China The Shenzhen Research Institute of Big Data Shenzhen518172 China The National and Kapodistrian University of Athens Greece Greece The Department of Electronic Systems Aalborg University Denmark

Tensor rank learning for canonical polyadic decomposition (CPD) has long been deemed as an essential yet challenging problem. In particular, since the tensor rank controls the complexity of the CPD model, its inaccurate learning would cause overfitting to noise or underfitting to the signal sources, and even destroy the interpretability of model parameters. However, the optimal determination of a tensor rank is known to be a non-deterministic polynomial-time hard (NP-hard) task. Rather than exhaustively searching for the best tensor rank via trial- and-error experiments, Bayesian inference under the Gaussian-gamma prior was introduced in the context of probabilistic CPD modeling, and it was shown to be an effective strategy for automatic tensor rank determination. This triggered flourishing research on other structured tensor CPDs with automatic tensor rank learning. On the other side of the coin, these research works also reveal that the Gaussian-gamma model does not perform well for high-rank tensors and/or low signal-to-noise ratios (SNRs). To overcome these drawbacks, in this paper, we introduce a more advanced generalized hyperbolic (GH) prior to the probabilistic CPD model, which not only includes the Gaussian-gamma model as a special case, but also is more flexible to adapt to different levels of sparsity. Based on this novel probabilistic model, an algorithm is developed under the framework of variational inference, where each update is obtained in a closed-form. Extensive numerical results, using synthetic data and real-world datasets, demonstrate the significantly improved performance of the proposed method in learning both low as well as high tensor ranks even for low SNR cases. Copyright © 2020, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

SRSC: Improving Restore Performance for Deduplication-Based Storage systems

引用

ZTE Communications 2019年第2期17卷 59-66页

作者： ZUO Chunxue WANG Fang TANG Xiaolan ZHANG Yucheng FENG Dan Key Laboratory of Information Storage Systems Engineering Research Center of Data Storage Systems and TechnologyHuazhong University of Science and TechnologyWuhanHubei 430074China 5G Application Product Line ZTE CorporationShenzhenGuangdong 518057China

Modern backup systems exploit data deduplication technology to save stor-age space whereas suffering from the fragmentation problem caused by *** degrades the restore performance because of restoring the chunks thatare scattered all over different containers. To improve the restore performance, thestate-of-the-art History Aware Rewriting Algorithm(HAR) is proposed to collect frag-mented chunks in the last backup and rewrite them in the next backup. However, dueto rewriting fragmented chunks in the next backup, HAR fails to eliminate internalfragmentation caused by self-referenced chunks(that exist more than two times in abackup) in the current backup, thus degrading the restore performance. In this paper,we propose Selectively Rewriting Self-Referenced Chunks(SRSC), a scheme that de-signs a buffer to simulate a restore cache, identify internal fragmentation in the cacheand selectively rewrite them. Our experimental results based on two real-world datas-ets show that SRSC improves the restore performance by 45% with an acceptable sac-rifice of the deduplication ratio.

关键词： data deduplication fragmentation restore performance

来源：评论

学校读者我要写书评

暂无评论

Exploring Social Media data for MOOC Recommendation

Exploring Social Media Data for MOOC Recommendation

引用

International Conference on systems of Collaboration (SysCo)

作者： Sara Assami Najima Daoudi Rachida Ajhoun Department of Computer Science Smart Systems Laboratory Mohammed Vth University Rabat Morocco Department of Data and Knowledge Engineering Information Sciences School (ESI) Rabat Morocco

ISBN: (数字)9781728142166

ISBN: (纸本)9781728142173

MOOCs (Massive Open Online Courses) are a key tool for open education stakeholders and high-level universities to face the problem of limited resources and make education accessible worldwide. Our study relies on the hypothesis of the influence of learning adaptation on the learners' lack of motivation in MOOCs. In this sense, a recommendation approach could stimulate the learner's interest in specific MOOCs. In previous research, we have identified the recommendation criteria to recommend MOOCs adapted to the learner's needs and motivations. Then, we modeled the ontology of the learning actors' profiles for the matching of the characteristics of learners with adapted MOOCs. Afterward, we designed the functional architecture and use cases of a semantic recommendation system to stimulate learners' interest in MOOCs. However, the recommendation process is still hindered by the learner profile on these platforms that doesn't represent the learner's interests and motivations. Yet, social media profiles extraction can be an external data source for learners' profile enrichment. So, the purpose of this research is to use social media mining for the acquisition of personal and professional data about learners. Therefore, we apply the first phases of data mining on a social media dataset to explore the potentially meaningful data for MOOC recommendation.

关键词： Social networking (online) data mining Educational courses Recommender systems Computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

Multi-criteria consensus sorting model with flexible linguistic preferences based on fuzzy information granulation from the perspective of preference disaggregation

引用

engineering Applications of Artificial Intelligence 2025年 154卷

作者： Zhang, Shiji Zhang, Shitao Tian, Hao Deveci, Muhammet Liu, Xiaodi School of Microelectronics and Data Science Anhui University of Technology Ma'anshan243032 China Key Laboratory of Multidisciplinary Management and Control of Complex Systems of Anhui Higher Education Institutes Anhui University of Technology Ma'anshan243002 China Anhui Provincial Joint Key Laboratory of Disciplines for Industrial Big Data Analysis and Intelligent Decision Ma'anshan243032 China Department of Industrial Engineering Turkish Naval Academy National Defence University Tuzla Istanbul34942 Turkey The Bartlett School of Sustainable Construction University College London LondonWC1E 6BT United Kingdom Department of Information Technologies Western Caspian University Baku1001 Azerbaijan

Multi-criteria group sorting (MCGS) that considers linguistic preferences involves multiple individuals evaluating alternatives and assigning them to pre-determined ordered categories based on specific criteria. Nevertheless, due to the limited availability of class information and the constrained cognitive capacity of decision-makers (DMs), it becomes challenging for DMs to furnish explicit preference information to reach consensus. Besides, decision parameters such as consensus threshold and class thresholds are also too hard to be assumed in advance. Therefore, this paper studies the preference disaggregation problem in MCGS, in which DMs are allowed to provide their pairwise comparisons in flexible linguistic expressions (FLEs) as preference information. To more fully utilize the preferences, semantic granulation is introduced. First, an individual consistency recognition model is proposed to identify inconsistent preferences and provide modification directions to the corresponding individuals. Next, semantic granulation and maximum entropy are combined into a granulation-driven information transformation model to convert the preference information based on FLEs into triangular fuzzy numbers (TFNs). Subsequently, in the consensus-driven preference disaggregation model, decision parameters and sorting results can be obtained at the premise of consensus by adjusting weights. Ultimately, to substantiate the effectiveness of the proposal, two numerical applications concerning the sorting of government venture capitals and information system suppliers are presented, along with comparative analysis, sensitivity analysis, and simulation analysis. © 2025 The Authors

关键词： information granules

来源：评论

学校读者我要写书评

暂无评论

The EMPOWER blended digital intervention for relapse prevention in schizophrenia: a feasibility cluster randomised controlled trial in Scotland and Australia

引用

The Lancet Psychiatry 2022年第6期9卷 477-486页

作者： Gumley, Andrew I Bradstreet, Simon Ainsworth, John Allan, Stephanie Alvarez-Jimenez, Mario Aucott, Lorna Birchwood, Maximillian Briggs, Andrew Bucci, Sandra Cotton, Sue M Engel, Lidia French, Paul Lederman, Reeva Lewis, Shôn Machin, Matthew MacLennan, Graeme McLeod, Hamish McMeekin, Nicola Mihalopoulos, Cathy Morton, Emma Norrie, John Schwannauer, Matthias Singh, Swaran P Sundram, Suresh Thompson, Andrew Williams, Chris Yung, Alison R Farhall, John Gleeson, John Glasgow Institute of Health and Wellbeing University of Glasgow Glasgow United Kingdom Division of Psychology and Mental Health School of Health Sciences Faculty of Biology Medicine and Health Manchester Academic Health Science Centre University of Manchester Manchester United Kingdom Division of Informatics Imaging and Data Sciences School of Health Sciences Faculty of Biology Medicine and Health Manchester Academic Health Science Centre University of Manchester Manchester United Kingdom Orygen Melbourne Melbourne VIC Australia Centre for Youth Mental Health University of Melbourne Melbourne VIC Australia School of Computing and Information Systems Faculty of Engineering and Information Technology University of Melbourne Melbourne VIC Australia Centre for Healthcare Randomised Trials (CHaRT) University of Aberdeen Aberdeen United Kingdom Centre for Mental Health and Wellbeing Research Warwick Medical School University of Warwick Warwick United Kingdom Department of Health Services Research and Policy London School of Hygiene & Tropical Medicine London United Kingdom Greater Manchester Mental Health NHS Foundation Trust Manchester United Kingdom School of Public Health and Preventive Medicine Monash University Melbourne VIC Australia Department of Psychiatry School of Clinical Sciences Monash University Melbourne VIC Australia School of Medicine Deakin University Melbourne VIC Australia Department of Psychiatry Manchester Metropolitan University Manchester United Kingdom Department of Psychiatry University of British Columbia Vancouver BC Canada The Usher Institute University of Edinburgh Edinburgh United Kingdom School for Health in Social Sciences University of Edinburgh Edinburgh United Kingdom Mental Health Program Monash Health Melbourne VIC Australia Department of Psychology and Counselling La Trobe University Melbourne VIC Australia NorthWestern Mental Health The Royal Melbourne Hospital Epping VIC Australia Healthy Brain and Mi

Background: Early warning signs monitoring by service users with schizophrenia has shown promise in preventing relapse but the quality of evidence is low. We aimed to establish the feasibility of undertaking a definitive randomised controlled trial to determine the effectiveness of a blended digital intervention for relapse prevention in schizophrenia. Methods: This multicentre, feasibility, cluster randomised controlled trial aimed to compare Early signs Monitoring to Prevent relapse in psychosis and prOmote Well-being, Engagement, and Recovery (EMPOWER) with treatment as usual in community mental health services (CMHS) in Glasgow and Melbourne. CMHS were the unit of randomisation, selected on the basis of those that probably had five or more care coordinators willing to participate. Participants were eligible if they were older than 16 years, had a schizophrenia or related diagnosis confirmed via case records, were able to provide informed consent, had contact with CMHS, and had had a relapse within the previous 2 years. Participants were randomised within stratified clusters to EMPOWER or to continue their usual approach to care. EMPOWER blended a smartphone for active monitoring of early warning signs with peer support to promote self-management and clinical triage to promote access to relapse prevention. Main outcomes were feasibility, acceptability, usability, and safety, which was assessed through face-to-face interviews. App usage was assessed via the smartphone and self-report. Primary end point was 12 months. Participants, research assistants and other team members involved in delivering the intervention were not masked to treatment conditions. Assessment of relapse was done by an independent adjudication panel masked to randomisation group. The study is registered at ISRCTN (99559262). Findings: We identified and randomised eight CMHS (six in Glasgow and two in Melbourne) comprising 47 care coordinators. We recruited 86 service users between Jan 19 and Au

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model-Free Non-Stationary RL: Near-Optimal Regret and Applications in Multi-Agent RL and Inventory Control

arXiv

引用

arXiv 2020年

作者： Mao, Weichao Zhang, Kaiqing Zhu, Ruihao Simchi-Levi, David Başar, Tamer Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois Urbana-Champaign UrbanaIL61801 United States Laboratory for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Cornell SC Johnson College of Business IthacaNY14853 United States Institute for Data Systems and Society Department of Civil and Environmental Engineering Operations Research Center Massachusetts Institute of Technology CambridgeMA02139 United States

We consider model-free reinforcement learning (RL) in non-stationary Markov decision processes. Both the reward functions and the state transition functions are allowed to vary arbitrarily over time as long as their cumulative variations do not exceed certain variation budgets. We propose Restarted Q-Learning with Upper Confidence Bounds (RestartQ-UCB), the first model-free algorithm for non-stationary RL, and show that it outperforms existing solutions in terms of dynamic regret. Specifically, RestartQ-UCB with Freedman-type bonus terms achieves a dynamic regret bound of (formula presented ), where S and A are the numbers of states and actions, respectively, ∆ > 0 is the variation budget, H is the number of time steps per episode, and T is the total number of time steps. We further present a parameter-free algorithm named Double-Restart Q-UCB that does not require prior knowledge of the variation budget. We show that our algorithms are nearly optimal by establishing an information-theoretical lower bound of (formula presented ), the first lower bound in non-stationary RL. Numerical experiments validate the advantages of RestartQ-UCB in terms of both cumulative rewards and computational efficiency. We demonstrate the power of our results in examples of multi-agent RL and inventory control across related products. Copyright © 2020, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Autonomous Obstacle Avoidance Scheme Using Monocular Vision Applied to Mobile Robots

引用

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

作者： Yun Yun Song Sheng Yi Yang Chao Liu Qing Gui Wu School of Data Science and Information Engineering Key Laboratory of Pattern Recognition and Intelligent Systems of Guizhou Province Guizhou Minzu University Guiyang China Key Laboratory of Pattern Recognition and Intelligent Systems of Guizhou Province Guizhou Minzu University Guiyang China School of Mechatronics Engineering Guizhou Minzu University Guiyang China

Mobile robots cannot move in an unknown environment with static or slow-moving obstacles effectively. We present an enhanced obstacle avoidance strategy using monocular vision to solve this problem. First, we combine Canny and Otsu to extract the barrier feature and find the critical pixel position of obstacles by the monocular vision. Then the image depth estimation algorithm is used to estimate the gaps. With these parameters of barriers, an improved bug algorithm is proposed to avoid the obstacles autonomously. The experiments show that the proposed obstacles avoidance strategy can effectively make a small mobile robot avoid different kinds of obstacles.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

"Is this an STD? Please help!⇝ online information seeking for sexually transmitted diseases on reddit 12

"Is this an STD? Please help!⇝ online information seeking f...

引用

12th International AAAI Conference on Web and Social Media, ICWSM 2018

作者： Nobles, Alicia L. Dreisbach, Caitlin N. Keim-Malpass, Jessica Barnes, Laura E. Department of Systems and Information Engineering United States School of Nursing United States Data Science Institute United States University of Virginia United States

ISBN: (纸本)9781577357988

Increasing incidence of sexually transmitted diseases (STDs) has prompted the public health and technology communities to innovate new measures to understand how individuals use Internet resources to attain relevant information, particularly for sensitive or stigmatized conditions. The purpose of this study is to examine recent health information seeking and needs of the r/STD community, a subreddit focused exclusively on STDs. We found that the majority of posts crowdsource information about intermediate, non-reportable STDs such as human papillomavirus (HPV). Crowdsourced information in this community focused on symptoms, treatment, as well as the social and emotional aspects of sexual health such as fear of misdiagnosis. From our analysis, it is clear that online communities focused on discussion of health symptoms have the ripe potential to influence information-seeking behavior and consumer action. Copyright © 2018, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Serial-EMD: Fast empirical mode decomposition method for multi-dimensional signals based on serialization

arXiv

引用

arXiv 2021年

作者： Zhang, Jin Feng, Fan Marti-Puig, Pere Caiafa, Cesar F. Sun, Zhe Duan, Feng Solé-Casals, Jordi College of Computer Science Nankai University Tianjin300071 China College of Artificial Intelligence Nankai University Tianjin300350 China Data and Signal Processing Group University of Vic—Central University of Catalonia Catalonia Vic08500 Spain Instituto Argentino de Radioastronomía CONICET CCT La Plata CIC-PBA UNLP V. Elisa1894 Argentina Tensor Learning Team Center for Advanced Intelligence Project RIKEN Tokyo103-0027 Japan Computational Engineering Applications Unit Head Office for Information Systems and Cybersecurity RIKEN Saitama351-0198 Japan

Empirical mode decomposition (EMD) has developed into a prominent tool for adaptive, scale-based signal analysis in various fields like robotics, security and biomedical engineering. Since the dramatic increase in amount of data puts forward higher requirements for the capability of real-time signal analysis, it is difficult for existing EMD and its variants to trade off the growth of data dimension and the speed of signal analysis. In order to decompose multi-dimensional signals at a faster speed, we present a novel signal-serialization method (serial-EMD), which concatenates multi-variate or multi-dimensional signals into a one-dimensional signal and uses various one-dimensional EMD algorithms to decompose it. To verify the effects of the proposed method, synthetic multi-variate time series, artificial 2D images with various textures and real-world facial images are tested. Compared with existing multi-EMD algorithms, the decomposition time becomes significantly reduced. In addition, the results of facial recognition with Intrinsic Mode Functions (IMFs) extracted using our method can achieve a higher accuracy than those obtained by existing multi-EMD algorithms, which demonstrates the superior performance of our method in terms of the quality of IMFs. Furthermore, this method can provide a new perspective to optimize the existing EMD algorithms, that is, transforming the structure of the input signal rather than being constrained by developing envelope computation techniques or signal decomposition methods. In summary, the study suggests that the serial-EMD technique is a highly competitive and fast alternative for multi-dimensional signal analysis. Copyright © 2021, The Authors. All rights reserved.

关键词： Signal analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：