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

2020 47th IEEE Photovoltaic Specialists Conference (PVSC)

作者： Kun Ding Xiang Chen Jingwei Zhang Li Feng Frank U. Hamelmann Shuai Weng College of Mechanical and Electrical Engineering Hohai University Changzhou China Solar Computing Lab University of Applied Science Bielefeld Minden Germany Changzhou Key Laboratory of Photovoltaic System Integration and Production Equipment Technology Changzhou China

ISBN: (数字)9781728161150

ISBN: (纸本)9781728161167

In order to improve the accuracy of short-term photovoltaic (PV) power prediction, the PV array power prediction model based on ensemble empirical mode decomposition (EEMD) and kernel extreme learning machine (KELM) optimized by particle swarm optimization algorithm (PSO-KELM) is proposed in this paper. The EEMD algorithm is used to decompose the power sequence of the PV array into a series of intrinsic mode functions (IMFs) with different features, the IMFs with similar features are divided into new components by sample entropy (SE), and establishing the KELM power prediction model corresponding to the new component. The PSO is used to optimize the output weight of KELM, seeking the optimal solution of upper and lower limits, and improving the performance of KELM. The actual data is used to compare the proposed prediction model with the traditional back-propagation (BP) and extreme learning machine (ELM) prediction models. The results validate that the proposed model can predict power of PV array with good accuracy and calculation speed.

关键词： Predictive models Kernel Biological system modeling Prediction algorithms Power generation Particle swarm optimization Neural networks

来源：评论

学校读者我要写书评

暂无评论

Extracting and Clustering the Evaluation Objects of the Chinese Product Recommendation system Based on the Opinion Mining

Extracting and Clustering the Evaluation Objects of the Chin...

引用

2019 3rd International Conference on Informatization in Education,Management and Business(IEMB 2019)

作者： Yingbin Xue Xiaoye Wang Yingyuan Xiao Yukun Li Wenguang Zheng Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education

The research of product recommendation system mainly focuses on the user s behavior or the commodities. contents, but rarely focuses on the commodies. reviews. This paper extracts useful information hidden in the commodies. reviews by opinion mining technology. It is more targeted that recommending product to users according to the user’s favorite property. The main process of opinion mining is the extraction of topic words and the polarity judgement of polar words. Because the time complexity of the topic extracting algorithm is high, this paper extracts the explicit evaluation object and evaluation words by using the method of matching noun phrase and then setting up a semantic mapping set of evaluation objects and evaluation words to determine the implicit evaluation object. In this paper, k-means and BIRCH are combined to cluster the evaluation objects. K-Means algorithm is used for pre-clustering for the BIRCH algorithm to solve local optimum. And the advantage of BIRCH is it can get the number of clusters by self-learning. And delete the clusters contained few contents to pruning evaluation objects. It can reduce the time complexity and guarantees the clustering effect.

关键词： Product recommendation opinion mining extraction of theme words clustering

来源：评论

学校读者我要写书评

暂无评论

Non-invasive biopsy diagnosis of diabetic kidney disease via deep learning applied to retinal images: a population-based study

引用

The Lancet Digital Health 2025年第5期7卷 100868页

作者： Meng, Ziyao Guan, Zhouyu Yu, Shujie Wu, Yilan Zhao, Yaoning Shen, Jie Lim, Cynthia Ciwei Chen, Tingli Yang, Dawei Ran, An Ran He, Feng Hamzah, Haslina Singh, Sarkaaj Abd Raof, Anis Syazwani Lee-Boey, Jian Wen Samuel Lim, Soo-Kun Sun, Xufang Ge, Shuwang Xu, Gang Su, Hua Cheng, Yang Lu, Feng Liao, Xiaofei Jin, Hai Deng, Chenxin Ruan, Lei Zhang, Cuntai Wu, Chan Dai, Rongping Jin, Yixiao Wang, Wenxiao Li, Tingyao Liu, Ruhan Li, Jiajia Shu, Jia Lu, Yuwei Wang, Xiangning Wu, Qiang Qin, Yiming Tang, Jin Sheng, Xiaohua Jiao, Qiong Yang, Xiaokang Guo, Minyi McKay, Gareth J Hogg, Ruth E Liew, Gerald Chee, Evelyn Yi Lyn Hsu, Wynne Lee, Mong Li Szeto, Simon Luk, Andrea O Y Chan, Juliana C N Cheung, Carol Y Tan, Gavin Siew Wei Tham, Yih-Chung Cheng, Ching-Yu Sabanayagam, Charumathi Lim, Lee-Ling Jia, Weiping Li, Huating Sheng, Bin Wong, Tien Yin Shanghai Belt and Road International Joint Laboratory of Intelligent Prevention and Treatment for Metabolic Diseases Department of Computer Science and Engineering School of Electronic Information and Electrical Engineering Institute for Proactive Healthcare Shanghai Jiao Tong University Department of Endocrinology and Metabolism Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai Diabetes Institute Shanghai Clinical Centre for Diabetes Shanghai Key Laboratory of Diabetes Mellitus Shanghai China MOE Key Laboratory of AI School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Beijing Tsinghua Changgung Hospital Eye Center School of Clinical Medicine Tsinghua Medicine Tsinghua University Beijing China Medical Records and Statistics Office Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Renal Medicine Singapore General Hospital SingHealth-Duke Academic Medical Centre Singapore Singapore Department of Ophthalmology Shanghai Health and Medical Center Wuxi China Department of Ophthalmology and Visual Sciences The Chinese University of Hong Kong Hong Kong Special Administrative Region China Singapore Eye Research Institute Singapore National Eye Centre Singapore Department of Medicine Faculty of Medicine Universiti Malaya Kuala Lumpur Malaysia Department of Ophthalmology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Hubei Wuhan China Department of Nephrology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Nephrology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Ophthalmology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China National Engineering Research Centre for Big Dat

Background: Improving the accessibility of screening diabetic kidney disease (DKD) and differentiating isolated diabetic nephropathy from non-diabetic kidney disease (NDKD) are two major challenges in the field of diabetes care. We aimed to develop and validate an artificial intelligence (AI) deep learning system to detect DKD and isolated diabetic nephropathy from retinal fundus images. Methods: In this population-based study, we developed a retinal image-based AI-deep learning system, DeepDKD, pretrained using 734 084 retinal fundus images. First, for DKD detection, we used 486 312 retinal images from 121 578 participants in the Shanghai Integrated Diabetes Prevention and Care system for development and internal validation, and ten multi-ethnic datasets from China, Singapore, Malaysia, Australia, and the UK (65 406 participants) for external validation. Second, to differentiate isolated diabetic nephropathy from NDKD, we used 1068 retinal images from 267 participants for development and internal validation, and three multi-ethnic datasets from China, Malaysia, and the UK (244 participants) for external validation. Finally, we conducted two proof-of-concept studies: a prospective real-world study with 3 months' follow-up to evaluate the effectiveness of DeepDKD in screening DKD;and a longitudinal analysis of the effectiveness of DeepDKD in differentiating isolated diabetic nephropathy from NDKD on renal function changes with 4·6 years' follow-up. Findings: For detecting DKD, DeepDKD achieved an area under the receiver operating characteristic curve (AUC) of 0·842 (95% CI 0·838–0·846) on the internal validation dataset and AUCs of 0·791–0·826 across external validation datasets. For differentiating isolated diabetic nephropathy from NDKD, DeepDKD achieved an AUC of 0·906 (0·825–0·966) on the internal validation dataset and AUCs of 0·733–0·844 across external validation datasets. In the prospective study, compared with the metadata model, DeepDKD could detect DKD wit

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Spike Sorting Based on Window-Gradient Feature

Spike Sorting Based on Window-Gradient Feature

引用

2018计算机科学与工程技术国际研讨会

作者： Min Dai Feng Jia Wen Yang Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology

Spike sorting is difficult when there is high waveforms similarity between different spike or when there is a large number of superimposed spikes in the sample. A new sample optimization method is proposed in the paper, called window-gradient feature. Every spike waveform is segmented into successive fragments in terms of the width σ, and each segment is called a window. Then calculate the gradient change of each window and use the ratio as the new alternative feature of the window. Finally, all window-gradient features of the spike waveforms are used to replace the original waveform features for spike sporting. The method is verified on the simulation data at different SNR. The experimental results show that when using SVM for spike sorting, the optimization effect of the proposed method is better than PCA, especially for data sets data sets with high noise or large sampling waveform similarity.

关键词： SNR Spike Sorting Based on Window-Gradient Feature

来源：评论

学校读者我要写书评

暂无评论

Energy Saving Strategy of Power system Cluster Based on Container Virtualization

Energy Saving Strategy of Power System Cluster Based on Cont...

引用

IEEE Asia Power and Energy Engineering Conference (APEEC)

作者： Ran Zheng Hao Wang Hai Jin Dechao Xu Yong Chen Xiaomeng Li Yufei Rao Zhenan Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory of Power Grid Safety and Energy Conservation China Electric Power Research Institute Haidian District Beijing China State Grid Henan Electric Power Company Electric Power Research Institute Zhengzhou China

ISBN: (数字)9781728167824

ISBN: (纸本)9781728167831

With the continuous development of power grids, the scale of supercomputing clusters has also gradually increased to carry a large number of power system simulation calculations, and the problem of high energy consumption has appeared. To solve this problem, we propose a container virtualization-based supercomputing cluster for power system. We analyze the impact of containers on power simulation calculations and compare the energy consumption effects of various container scheduling and migration algorithms on clusters. Experiments show that compared to virtual machines with hypervisor, which consumes massive resources and reduces performances by 28.4%, the performance degradation of container on power simulation calculation is 1.3%, which can be ignored. The energy consumption of load-concentration or resource-and-load-balance container scheduling algorithms is up to 4.0% lower and at least 2.2% lower than other algorithms. In container migration, the method combining autoregressive model with most-correlation and resource-andload-balance algorithms is better than other methods, which not only minimizes energy consumption, but also has lowest number of migrations and SLA violations. Experiments verify the feasibility and advantages of container migration in power system computing clusters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SWRR:The Link Scheduling Algorithm Based on Weighted Round-Robin

引用

Computers, Materials & Continua 2019年第6期59卷 965-982页

作者： Tianbo Lu Ru Yan Chao Li Lihua Yin Hao Chen Xieyu Zou School of Software Engineering Beijing University of Posts and TelecommunicationsBeijing100876China Key Laboratory of Trustworthy Distributed Computing and Service(Beijing University of Posts and Telecommunications) Ministry of EducationBeijing100876China Cyberspace Institute of Advanced Technology Guangzhou UniversityGuangzhou510006China Department Computer Science and Engineering The University of Texas at ArlingtonArlington76091USA

With the rapid development of the Internet,people pay more and more attention to the protection of *** second-generation onion routing system Tor is the most commonly used among anonymous communication systems,which can be used to protect user privacy *** recent years,Tor’s congestion problem has become the focus of attention,and it can affect Tor’s performance even user ***,we investigate the causes of Tor network congestion and summarize some link scheduling algorithms proposed in recent *** we propose the link scheduling algorithm SWRR based on WRR(Weighted Round Robin).In this process,we design multiple weight functions and compare the performance of these weight functions under different congestion conditions,and the appropriate weight function is selected to be used in our algorithms based on the experiment ***,we also compare the performance of SWRR with other link scheduling algorithms under different congestion conditions by experiments,and verify the effectiveness of the algorithm SWRR.

关键词： Weighted Round-Robin Tor congestion control link scheduling anonymous communication

来源：评论

学校读者我要写书评

暂无评论

A NOMA Power Allocation Strategy Based on Genetic Algorithm 8th

A NOMA Power Allocation Strategy Based on Genetic Algorithm

引用

8th International Conference on Communications, Signal Processing, and systems, CSPS 2019

作者： Yin, Lu Chenggong, Wang Kai, Mao Kuanxin, Bao Haowei, Bian Jiangsu Key Laboratory of Wireless Communications Nanjing University of Posts and Telecommunications Nanjing210003 China Engineering Research Center of Health Service System Based on Ubiquitous Wireless Networks Nanjing University of Posts and Telecommunications Ministry of Education Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China

ISBN: (纸本)9789811394089

The NOMA technology uses the power domain non-orthogonal multiplexing method to enable multiple users to occupy the entire frequency band simultaneously to transmit signals. In order to maximize the total transmission rate of the system, an effective method is to use the genetic algorithm for NOMA power allocation. In this paper, the NOMA downlink system model is constructed, and the objective function and constraints are analyzed. A NOMA power allocation strategy based on genetic algorithm is proposed. The algorithm distributes user power based on the criterion of maximizing total transmission rate, therefore the algorithm has random search capabilities and relatively low search complexity. The simulation results show that when the system transmits power or multiplexed users is fixed the proposed algorithm outperforms the fixed power allocation algorithm in the total transmission rate. The total system transmission rate of the genetic algorithm is similar to the full space search algorithm. As the number of multiplexed users increases, the computational complexity of genetic algorithms is much lower than that of full-space search algorithms. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

When to preprocess? Keeping information fresh for computing enable internet of things

arXiv

引用

arXiv 2021年

作者： Wang, Xijun Fang, Minghao Xu, Chao Yang, Howard H. Sun, Xinghua Chen, Xiang Quek, Tony Q.S. School of Electronics and Information Technology Sun Yat-sen University Guangzhou510006 China Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences 865 Changning Road Shanghai200050 China School of Electronics and Communication Engineering Sun Yat-sen University Guangzhou China School of Information Engineering Northwest A&F University Shaanxi Yangling China Key Laboratory of Agricultural Internet of Things Ministry of Agriculture and Rural Affairs Shaanxi Yangling China Shaanxi Key Laboratory of Agricultural Information Perception and Intelligent Service Shaanxi Yangling China Zhejiang University/University of Illinois at Urbana-Champaign Institute Zhejiang University Haining314400 China Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

Age of information (AoI), a notion that measures the information freshness, is an essential performance measure for time-critical applications in Internet of Things (IoT). With the surge of computing resources at the IoT devices, it is possible to preprocess the information packets that contain the status update before sending them to the destination so as to alleviate the transmission burden. However, the additional time and energy expenditure induced by computing also make the optimal updating a non-trivial problem. In this paper, we consider a time-critical IoT system, where the IoT device is capable of preprocessing the status update before the transmission. Particularly, we aim to jointly design the preprocessing and transmission so that the weighted sum of the average AoI of the destination and the energy consumption of the IoT device is minimized. Due to the heterogeneity in transmission and computation capacities, the durations of distinct actions of the IoT device are nonuniform. Therefore, we formulate the status updating problem as an infinite horizon average cost semi-Markov decision process (SMDP) and then transform it into a discrete-time Markov decision process. We demonstrate that the optimal policy is of threshold type with respect to the AoI. Equipped with this, a structure-aware relative policy iteration algorithm is proposed to obtain the optimal policy of the SMDP. Our analysis shows that preprocessing is more beneficial in regimes of high AoIs, given it can reduce the time required for updates. We further prove the switching structure of the optimal policy in a special scenario, where the status updates are transmitted over a reliable channel, and derive the optimal threshold. Finally, simulation results demonstrate the efficacy of preprocessing and show that the proposed policy outperforms two baseline policies. © 2021, CC BY.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Traffic flow prediction model based on deep belief network and genetic algorithm

Traffic flow prediction model based on deep belief network a...

引用

作者： Zhang, Yaying Huang, Guan Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China

Traffic flow prediction plays an indispensable role in the intelligent transportation system. The effectiveness of traffic control and management relies heavily on the prediction accuracy. The authors propose a model based on deep belief networks (DBNs) to predict the traffic flow. Moreover, they use Fletcher-Reeves conjugate gradient algorithm to optimise the fine-tuning of model's parameters. Since the traffic flow has various features at different times such as weekday, weekend, daytime and nighttime, the hyper-parameters of the model should adapt to the time. Therefore, they employ the genetic algorithm to find the optimal hyper-parameters of DBN models for different times. The dataset from Caltrans Performance Measurement system was used to evaluate the performance of their models. The experimental results demonstrate that the proposed model achieved better performance in different times. © The Institution of Engineering and technology 2018.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Study of Visual Comfort for Disparity Gradient of S3D Image with Multiple Salient Objects 4

A Study of Visual Comfort for Disparity Gradient of S3D Imag...

引用

4th IEEE Advanced Information technology, Electronic and Automation Control Conference, IAEAC 2019

作者： Su, Zhibin Liu, Yuanzi Li, Weiwei Wei, Lin Ren, Hui Communication University of China School of Information and Communication Engineering China Key Laboratory of Acoustic Visual Technology and Intelligent Control System Ministry of Culture and Tourism China CITVC KEHUA CO. LTD. Technology Service Branch Beijing China

ISBN: (纸本)9781728119076

This paper had investigated the perception of visual comfort for the disparity gradient of stereoscopic 3D(S3D) image though subjective evaluation experiments. For the extraction of gradient features, the calculation of absolute disparity and relative disparity were all considered. The experiment result shown that the relative disparity gradient mainly affects the visual comfort under the circumstance of positive disparity, while the absolute disparity gradient would affect the viewing experience with negative disparity. As a whole, the higher both the disparity gradient was, the lower the rating score was. The research achievement is of practical value, which can not only provide importance experimental support for the visual perception mechanism, but also offer the valid basis for feature extraction of stereoscopic images. © 2019 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：