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

作者： Chen, Xing Lin, Junxin Lin, Bing Xiang, Tao Zhang, Ying Huang, Gang College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China College of Physics and Energy Fujian Normal University Fuzhou China Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China

In the presence of scale, dynamism, uncertainty, and elasticity, cloud engineers face several challenges when allocating resources for cloud-based software services. They should allocate appropriate resources in order to guarantee good quality of services as well as low cost of resources. Self-adaptive ability is needed in this process because engineers' intervention is difficult. Traditional self-adaptive resource allocation methods are policy-driven. Thus, cloud engineers usually have to develop separate sets of rules for each systems in order to allocate resources effectively, which leads to high administrative cost and implementation complexity. Machine learning has made great achievements in many fields, and it can be also applied to resource allocation. In this paper, we present a self-learning and self-adaptive approach to resource allocation for cloud-based software services. For a given cloud-based software service, its QoS model is firstly trained on history data, which is capable to predict the QoS value as output by using the information on workload and allocated resources as inputs. Then, on-line decision-making on resource allocation can be carried out automatically based on genetic algorithm, which is aimed to search reasonable resource allocation plan by using the QoS model. We evaluate our approach on RUBiS benchmark, demonstrating the accuracy of the QoS model over 90% and the improvement of resource utilization by 10%-30%. © 2018 John Wiley & Sons, Ltd.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

The association between bone density of lumbar spines and different daily protein intake in different renal function

引用

Renal Failure 2024年第1期46卷 2298080页

作者： Lee, Chia-Lin Chen, Kun-Hui Liu, Wei‑Ju Chen, Ching-Hsien Tsai, Shang-Feng Department of Post-Baccalaureate Medicine College of Medicine National Chung Hsing University Taichung Taiwan School of Medicine National Yang-Ming University Taipei Taiwan Division of Endocrinology and Metabolism Department of Internal Medicine Taichung Veterans General Hospital Taichung Taiwan Intelligent data mining laboratory Department of Medical Research Taichung Veterans General Hospital Taichung Taiwan Department of Public Health College of Public Health China Medical University Taichung Taiwan Department of Orthopedic Surgery Taichung Veterans General Hospital Taichung Taiwan Department of Computer Science & Information Engineering College of Computing and Informatics Providence University Taichung Taiwan Divisions of Nephrology and Pulmonary Critical Care and Sleep Medicine Department of Internal Medicine University of California at Davis Davis CA United States Division of Nephrology Department of Internal Medicine Taichung Veterans General Hospital Taichung Taiwan Department of Life Science Tunghai University Taichung Taiwan

Background: Low protein intake (LPI) has been suggested as a treatment for chronic kidney disease (CKD). However, protein intake is essential for bone health. Methods: We studied the database of the National Health and Nutrition Examination Survey, 2005–2010. Basic variables, metabolic diseases, and bone density of different femoral areas were stratified into four subgroups according to different protein intake (DPI) (that is, <0.8, 0.8–1.0, 1.0–1.2, and >1.2 g/kg/day). Results: Significant differences were found among all lumbar area bone mineral density (BMD) and T-scores (p < 0.0001). There was an apparent trend between a decreasing BMD in the CKD groups with increasing DPI in all single lumbar spines (L1, L2, L3, and L4) and all L spines (L1-L4). Compared with DPI (0.8–1.0 g/day/kg), higher risks of osteoporosis were noticed in the subgroup of >1.2 g/day/kg over L2 (relative risk (RR)=1.326, 95% confidence interval (CI)=1.062–1.656), subgroup >1.2 g/day/kg over L3 (RR = 1.31, 95%CI = 1.057–1.622), subgroup <0.8 g/day/kg over L4 (RR = 1.276, 95%CI = 1.015–1.605), subgroup <0.8 g/day/kg over all L spines (RR = 11.275, 95%CI = 1.051–1.548), and subgroup >1.2 g/day/kg over all L spines (RR = 0.333, 95%CI = 1.098–1.618). However, a higher risk of osteoporosis was observed only in the non-CKD group. There was an apparent trend of higher DPI coexisting with lower BMD and T scores in patients with CKD. For osteoporosis (reference:0.8–1.0 g/day/kg), lower (<0.8 g/day/kg) or higher DPI (>1.2 g/day/kg) was associated with higher risks in the non-CKD group, but not in the CKD group. Conclusions: In the CKD group, LPI for renal protection was safe without threatening L spine bone density and without causing a higher risk of osteoporosis. © 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： Bone density chronic kidney disease lumbar spine osteoporosis protein diet

来源：评论

学校读者我要写书评

暂无评论

A two-phase approach for locally differentially private fuzzy co-clustering

引用

Information Sciences 2025年 718卷

作者： Pengfei Zhang Jianlong An Xiang Cheng Youwen Zhu Ji Zhang Zhikun Zhang State Key Laboratory of Digital Intelligent Technology for Unmanned Coal Mining No. 168 Shungeng Road Tianjiaan District 232001 Huainan China School of Computer Science and Engineering Anhui University of Science and Technology No. 168 Shungeng Road Tianjiaan District 232001 Huainan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics No. 237 Longquan Road Kunming 650221 Yunnan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology (Shandong Academy of Sciences) No. 3501 Daxue Road Jinan 255020 Shandong China Key Laboratory of Equipment Data Security and Guarantee Technology Guilin University of Electronic Technology No. 1 Jinji Road Guilin 541010 Guangxi China State Key Laboratory of Networking and Switching Technology No. 10 Xitucheng Road Haidian District 100876 Beijing China Beijing University of Posts and Telecommunications No. 10 Xitucheng Road Haidian District 100876 Beijing China College of Computer and Data Science Nanjing University of Aeronautics and Astronautics No. 29 Yudao Street Qinhuai District Nanjing 210016 Jiangsu China School of Mathematics Physics and Computing University of Southern Queensland West Street Toowoomba 4350 Queensland Australia College of Computer Science and Technology Zhejiang University No. 38 Zheda Road Xihu District 310027 Hangzhou China

Clustering analysis is important for providing personalized services across various user experience optimization. As an advanced clustering technique, Fuzzy Co-Clustering ( FCC ) excels at handling high-dimensional data by simultaneously grouping both samples and attributes while allowing objects to belong to multiple clusters. To alleviate the potential privacy risks posed by directly using raw data, researchers often employ local differential privacy (LDP) techniques for protection. However, current clustering studies under LDP either directly perform clustering on the high-dimensional data, which necessitates splitting the privacy budget heavily, leading to excessive noise injection, or fail to adequately address the impact of Laplacian noise on both objective function modeling and distance metric selection, resulting in reduced clustering accuracy. To address these limitations, we present a two-phase approach SONY , which allocates part of the privacy budget to evaluate attribute importance and perform dimensionality reduction accordingly, and then utilizes the remaining budget to conduct noise-aware clustering on the pruned data. Our key technical contributions include: (1) a Noise-aware Similarity Calculation method ( NSC ) that replaces traditional Euclidean distance with a specialized metric which accounts for the statistical properties of Laplacian noise; (2) an importance-driven dimension reduction and budget allocation method ( IDRBA ) which optimizes both attribute selection and privacy budget allocation; and (3) an outlier-aware objective function calculation method ( OOC ) which enhances robustness against potential noise-induced outliers. We provide theoretical guarantees for SONY 's convergence, privacy preservation, utility bounds, and computational complexity. Experimental evaluations conducted on two real-world datasets and one synthetic dataset, demonstrate that SONY outperforms the state-of-the-arts by at least 14% in F-Measure and 10% in Entrop

关键词： Fuzzy co-clustering Local differential privacy Privacy protection Two phase

来源：评论

学校读者我要写书评

暂无评论

Automatic Text Summarization Based on Transformer and Switchable Normalization

Automatic Text Summarization Based on Transformer and Switch...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Tao Luo Kun Guo Hong Guo College of Mathematics and Computer Sciences Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

With the development of text summarization research, the methods based on RNN with the Encoder-Decoder model gradually become the mainstream. However, RNN tends to forget previous context information and leads to the lack of original information. That will reduce the accuracy of the generated summarizations. The Transformer model uses the self-attention mechanism to encode and decode historical information so that it can achieve better performance than RNN in learning context information. In this paper, a text summarization model based on transformer and switchable normalization is proposed. The accuracy of the model is improved by optimizing the normalization layer. Compared with other models, the new model has a great advantage in understanding words' semantics and associations. Experimental results in English Gigaword dataset show that the proposed model can achieve high ROUGE values and make the summarization more readable.

关键词： Decoding Switches Context modeling Vocabulary Task analysis data mining Semantics

来源：评论

学校读者我要写书评

暂无评论

Financial Big data Hot and Cold Separation Scheme Based on HBase and Redis

Financial Big Data Hot and Cold Separation Scheme Based on H...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Kunhui Li Kun Guo Hong Guo Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

In the era of big data, HBase has been widely used in scenarios of massive unstructured data. For the financial big data, due to the integrity and timing of it, unreasonable data storage and management usually lead to hot spots that decreases the query performance. In practice, the separation of hot and cold financial data will improve data query performance and utilization rate of cluster resources. In this paper, a hot and cold data separation scheme is designed, to store infrequently queried financial data to HBase, and frequently queried one to Redis. The cold data is reasonably planned and managed through pre-partitioning and row key design for HBase. A hot data cache based on Redis is realized to improve the query speed and reduces the pressure of HBase. In addition, due to the lack of Redis's inherent cache elimination strategy, we propose a caching strategy based on the frequencies of updating and querying operations. The experimental results show that the scheme can effectively avoid the hot storage problem, and improve the query performance, and improve the cache hit ratio of Redis. Therefore, the number of cold data access requests can be effectively reduced.

关键词： Big data Distributed databases Memory Time series analysis Stock markets

来源：评论

学校读者我要写书评

暂无评论

Mixed Word Embedding Method Based on Knowledge Graph Augment for Text Classification

Mixed Word Embedding Method Based on Knowledge Graph Augment...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Hongzhong Wang Kun Guo Zhanghui Liu Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

This paper presents a self-training word embedding text classification model based on knowledge graph expansion for text classification. Current mixed word embedding methods are overly dependent on the Fasttext pre-training model and here is still a problem of missing words with rich semantic information are not mapped. First, we propose a method for extracting missing nouns based on shape near word filtering. Second, we design a self-training word embedding method based on knowledge graph that mixes with pre-training word embedding to obtain a high-quality mixed word vector with rich semantics and rich semantics. Third, we designed a GRU model based on improved mixed word embedding to improve the quality of text classification. Experiments conducted on multiple text classification datasets demonstrate that our methods can effectively improve the text classification accuracy.

关键词： Text categorization Context modeling Feature extraction Training Task analysis Predictive models

来源：评论

学校读者我要写书评

暂无评论

Overlapping Community Detection Based on Influence and Seeds Extension

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2019年第1期47卷 153-160页

作者： Yu, Zhi-Yong Chen, Ji-Jie Guo, Kun Chen, Yu-Zhong Xu, Qian College of Mathematics and Computer Sciences Fuzhou University FuzhouFujian350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing FuzhouFujian350116 China Ministry of Education Key Laboratory of Spatial Data Mining & Information Sharing FuzhouFujian350116 China State Grid Info-Telecom Great Power Science and Technology Co. Ltd. FuzhouFujian350003 China

Community detection is a significant research direction in the research of social networks. To improve the quality of seeds selection and expansion, we propose an influence seeds extension overlapping community detection (i-SEOCD) algorithm for overlapping community detection. First, i-SEOCD uses a node influence strategy to find the seed communities with tight structures. Second, on the basis of the seed communities, we calculate the similarity among communities and their neighbor nodes. The nodes whose similarity is greater than a predefined threshold are selected. Third, the strategy of optimizing a self-adaptive function is adopted to expand the communities. Finally, the free nodes in the network are assigned to their corresponding communities in order to find out all the overlapping community structures. Experiments on the real and artificial networks show that i-SEOCD is capable of discovering overlapping communities in complex social networks efficiently. © 2019, Chinese Institute of Electronics. All right reserved.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Residual Networks for Light Field Image Super-Resolution

Residual Networks for Light Field Image Super-Resolution

引用

IEEE/CVF Conference on Computer Vision and Pattern Recognition

作者： Shuo Zhang Youfang Lin Hao Sheng Beijing Key Lab of Traffic Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Key Laboratory of Intelligent Passenger Service of Civil Aviation CAAC State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Light field cameras are considered to have many potential applications since angular and spatial information is captured simultaneously. However, the limited spatial resolution has brought lots of difficulties in developing related applications and becomes the main bottleneck of light field cameras. In this paper, a learning-based method using residual convolutional networks is proposed to reconstruct light fields with higher spatial resolution. The view images in one light field are first grouped into different image stacks with consistent sub-pixel offsets and fed into different network branches to implicitly learn inherent corresponding relations. The residual information in different spatial directions is then calculated from each branch and further integrated to supplement high-frequency details for the view image. Finally, a flexible solution is proposed to super-resolve entire light field images with various angular resolutions. Experimental results on synthetic and real-world datasets demonstrate that the proposed method outperforms other state-of-the-art methods by a large margin in both visual and numerical evaluations. Furthermore, the proposed method shows good performances in preserving the inherent epipolar property in light field images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

An automatic biomedical ontology meta-matching technique

Journal of Network Intelligence

引用

Journal of Network Intelligence 2019年第3期4卷 109-113页

作者： Xue, Xingsi Yang, Haiyan Zhang, Jie Zhang, Jing Chen, Dongxu College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.3 Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China College of Information Science and Engineering Fujian University of Technology No.33 Xuefu South Road University Town Minhou Fuzhou CityFujian Province350118 China School of Computer Science and Engineering Yulin Normal University No.299 Education Middle Road Yulin CityGuanxi Province537000 China School of Computing Ulster University Jordanstown BT370QB United Kingdom Fujian Medical University Union Hospital No.29 Xinquan Road Gulou Fuzhou CityFujian Province350001 China

Biomedical ontology matching aims at determining the heterogeneous biomed-ical concepts, and bridging the semantic gap between heterogeneous biomedical ontologies. The foundation of a biomedical ontology matching technique is the Biomedical Concept Similarity Measure (BCSM), which calculates the similarity value between two biomed-ical concepts. Since various BCSMs have different advantages, usually several BCSMs are aggregated together to improve the result’s confidence. How to tune the aggregating weights to ensure the quality of the alignment is called biomedical ontology meta-matching problem, which is a challenge in the ontology matching domain. Currently, researchers mainly focus on how to tune the aggregating weights for various similarity measures to improve the quality of the ontology alignments. However, the ignorance of the effects brought about by different biomedical concept mapping’s preference on different similarity measures significantly reduces the alignment’s quality. To overcome this drawback, in this work, we formally define the biomedical ontology meta-matching problem, and then present an Ordered Weighted Average (OWA) based approach to automatically aggregate various biomedical concept similarity measures. In our method, the aggregating weights determined for each concept mapping is associated with the ordered position of the similarity value instead of a particular concept similarity measure. The experiment utilizes the large biomed track provided by Ontology Alignment Evaluation Initiative (OAEI) to test our proposal’s performance, and the experimental results show the effectiveness of our proposal. © 2019, Taiwan Ubiquitous Information. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：