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

SSRN 2022年

作者： Waheed, Hajra Zhou, Jia Aljohani, Naif R. Tuarob, Suppawong Nawaz, Raheel Herrera, Francisco Hassan, Saeed-Ul Information Technology University 346-B Ferozepur Road Lahore Pakistan Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Zhejiang Normal University Zhejiang Jinhua321004 China Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia Faculty of Information and Communication Technology Mahidol University Thailand Staffordshire University Stoke-on-Trent United Kingdom Andalusian Research Institute in Data Science and Computational Intelligence University of Granada Granada Spain Manchester Metropolitan University Manchester United Kingdom

With the increase in the self-paced learning phenomenon, class imbalance in the learning analytics community has become more prevalent, with lesser students dropping out than students who intend to pursue. Similarly, an imbalance in the behavioral performances of students is also observed. This imbalance problem becomes more complicated for temporal data, where each time sequence represents a particular student, and several sequences formulate the overall engagement of students throughout a course. The conventional methods for generating synthetic data do not account for this association of sequences, where each synthetically generated student is associated with its previous sequence. Generative Adversarial Networks (GANs) have been rapidly adopted in the machine learning discipline for synthetic data generation to reduce the class imbalance. In this study, we propose a deep learning-powered methodology called Educational Temporal Generative Adversarial Networks (Ed-TGANs) methodology comprising the following steps: a) Smart data Processing for Actionable data, b) GANs for Temporal data Generation, and c) Learning Approach. Furthermore, the Open University Learning Analytics dataset was deployed as a case study comprising 69% pass and 31% fail students to validate the effectiveness of our proposed methodology, encompassing discrete and continuous features. The results are compared with GAN-based and non-GAN upsampling approaches to demonstrate the proposed methodology's effectiveness, which shows an increase in accuracy of up to 5.33% compared to classic GANs, resulting in improved understating of student behavior. We believe that the presented methodology can be used as a starting point for various areas for upsampling jobs with temporal longitudinal data. © 2022, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

SG-PBFT: A secure and highly efficient blockchain PBFT Consensus Algorithm for internet of vehicles

arXiv

引用

arXiv 2021年

作者： Xu, Guangquan Liu, Yihua Xing, Jun Luo, Tao Gu, Yonghao Liu, Shaoying Zheng, Xi Vasilakos, Athanasios V. The Big Data School Qingdao Huanghai University Qingdao266427 China College of Intelligence and Computing Tianjin University Tianjin300350 China The International Engineering Institute Tianjin University Tianjin300350 China The College of Intelligence and Computing Tianjin University Tianjin Tianjin300350 China The school of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China The Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China School of Informatics and Data Science Hiroshima University Japan The Department of Computing Macquarie University SydneyNSW2109 Australia The University of Technology Sydney Australia The Fuzhou University Fuzhou China Lulea University of Technology Lulea Sweden

The Internet of Vehicles (IoV) is an application of the Internet of things (IoT). It faces two main security problems: (1) the central server of the IoV may not be powerful enough to support the centralized authentication of the rapidly increasing connected vehicles, (2) the IoV itself may not be robust enough to single-node attacks. To solve these problems, this paper proposes SG-PBFT: a secure and highly efficient PBFT consensus algorithm for Internet of Vehicles, which is based on a distributed blockchain structure. The distributed structure can reduce the pressure on the central server and decrease the risk of single-node attacks. The SG-PBFT consensus algorithm improves the traditional PBFT consensus algorithm by using a score grouping mechanism to achieve a higher consensus efficiency. The experimental result shows that our method can greatly improve the consensus efficiency and prevent single-node attacks. Specifically, when the number of consensus nodes reaches 1000, the consensus time of our algorithm is only about 27% of what is required for the state-of-the-art consensus algorithm (PBFT). Our proposed SG-PBFT is versatile and can be used in other application scenarios which require high consensus efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Edge computing-enabled energy efficiency prediction of immersion cooling system for supercomputing centers

引用

Cleaner Engineering and Technology 2025年 27卷

作者： Ma, Shuaiyin Cao, Yichun Liu, Yang School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an 710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Xi'an 710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an 710121 China Shaanxi Union Research Centre of University and Enterprise for 5G+ Industrial Internet Communication Terminal Technology Xi'an University of Posts and Telecommunications Xi'an 710121 China Department of Management and Engineering Linköping University Linköping SE-581 83 Sweden Industrial Engineering and Management University of Oulu Oulu 90570 Finland

Within the context of cleaner production, enhancing energy efficiency and sustainability has emerged as a central focus in supercomputing center development. To address the challenges in predicting energy consumption, this study proposes an architecture of edge computing-enabled energy efficiency prediction of immersion cooling system for supercomputing centers. This architecture combines time-series generative adversarial network (TimeGAN) for data augmentation with the neural basis expansion analysis for time series (N-BEATS) for prediction, providing a robust solution for accurate energy consumption prediction. TimeGAN enhances the training dataset by generating high-quality synthetic time-series data, effectively mitigating issues of data sparsity and imbalance. N-BEATS, with its modular architecture and strong adaptability to temporal data, ensures precise predictions by capturing both global trends and local variations in energy usage. Experimental results demonstrate the effectiveness of the proposed architecture, exhibiting superior performance across key metrics when compared to traditional models. Specifically, the RMSE of TimeGAN-N-BEATS reduced by more than 8 %, the MSE decreased by over 18 %, and the R2 reached 97.31 %, outperforming baseline models such as long short-term memory and gated recurrent unit, and their attention-enhanced variants. This study highlights the potential of integrating generative and predictive models to optimize energy efficiency in liquid cooling systems, offering valuable insights for sustainable supercomputing operations. © 2025 The Authors

关键词： Edge computing Liquid cooling system N-BEATS Supercomputing centers TimeGAN

来源：评论

学校读者我要写书评

暂无评论

Stable recovery of entangled weights: Towards robust identification of deep neural networks from minimal samples

arXiv

引用

arXiv 2021年

作者： Fiedler, Christian Fornasier, Massimo Klock, Timo Rauchensteiner, Michael Intelligent Control Systems Group Max Planck Institute for Intelligent Systems Heisenbergstr. 3 Stuttgart70569 Germany Institute for Data Science in Mechanical Engineering RWTH-Aachen University Dennewartstraße 27 Aachen50868 Germany Department of Mathematics Bolzmannstraße 3 85748 Garching Germany Department of Numerical Analysis and Scientific Computing Simula Research Laboratory Oslo Norway Department of Mathematics University of San Diego California San Diego United States

In this paper we approach the problem of unique and stable identifiability of generic deep artificial neural networks with pyramidal shape and smooth activation functions from a finite number of input-output samples. More specifically we introduce the so-called entangled weights, which compose weights of successive layers intertwined with suitable diagonal and invertible matrices depending on the activation functions and their shifts. We prove that entangled weights are completely and stably approximated by an efficient and robust algorithm as soon as O(D2 × m) nonadaptive input-output samples of the network are collected, where D is the input dimension and m is the number of neurons of the network. Moreover, we empirically observe that the approach applies to networks with up to O(D × mL) neurons, where mL is the number of output neurons at layer L. Provided knowledge of layer assignments of entangled weights and of remaining scaling and shift parameters, which may be further heuristically obtained by least squares, the entangled weights identify the network completely and uniquely. To highlight the relevance of the theoretical result of stable recovery of entangled weights, we present numerical experiments, which demonstrate that multilayered networks with generic weights can be robustly identified and therefore uniformly approximated by the presented algorithmic pipeline. In contrast backpropagation cannot generalize stably very well in this setting, being always limited by relatively large uniform error. In terms of practical impact, our study shows that we can relate input-output information uniquely and stably to network parameters, providing a form of explainability. Moreover, our method paves the way for compression of overparametrized networks and for the training of minimal complexity *** Codes 65D15, 68T07, 90C26 Copyright © 2021, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

The Most Probable Transition Paths of Stochastic Dynamical Systems: A Sufficient and Necessary Characterization

arXiv

引用

arXiv 2021年

作者： Huang, Yuanfei Huang, Qiao Duan, Jinqiao School of Mathematics and Statistics Center for Mathematical Sciences Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology Wuhan430074 China Department of Statistics and Data Science National University of Singapore 6 Science Drive 2 Singapore117546 Singapore School of Data Science City University of Hong Kong Kowloon Hong Kong Department of Mathematics Faculty of Sciences University of Lisbon Campo Grande Edifício C6 LisboaPT-1749-016 Portugal Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University 21 Nanyang Link Singapore637371 Singapore The Dongguan Key Laboratory for Data Science and Intelligent Medicine Department of Mathematics Department of Physics Great Bay University Guangdong Dongguan523000 China

The most probable transition paths of a stochastic dynamical system are the global minimizers of the Onsager–Machlup action functional and can be described by a necessary but not sufficient condition, the Euler–Lagrange equation (a second-order differential equation with initial-terminal conditions) from a variational principle. This work is devoted to showing a sufficient and necessary characterization for the most probable transition paths of stochastic dynamical systems with Brownian noise. We prove that, under appropriate conditions, the most probable transition paths are completely determined by a first-order ordinary differential equation. The equivalence is established by showing that the Onsager–Machlup action functional of the original system can be derived from the corresponding Markovian bridge process. For linear stochastic systems and the nonlinear Hongler’s model, the first-order differential equations determining the most probable transition paths are shown analytically to imply the Euler–Lagrange equations of the Onsager–Machlup functional. For general nonlinear systems, the determining first-order differential equations can be approximated, in a short time or for the small noise case. Some numerical experiments are presented to illustrate our results. Copyright © 2021, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Electric Load Forecasting Based on Sparse Representation Model 13th

Electric Load Forecasting Based on Sparse Representation Mod...

引用

13th International Conference on Green, Pervasive, and Cloud computing, GPC 2018

作者： Huang, Fangwan Zheng, Xiangping Yu, Zhiyong Yang, Guanyi Guo, Wenzhong College of Mathematics and Computer Science 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 and Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030150921

Accurate electric load forecasting can prevent the waste of power resources and plays a crucial role in smart grid. The time series of electric load collected by smart meters are non-linear and non-stationary, which poses a great challenge to the traditional forecasting methods. In this paper, sparse representation model (SRM) is proposed as a novel approach to tackle this challenge. The main idea of SRM is to obtain sparse representation coefficients by the training set and the part of over-complete dictionary, and the rest part of over-complete dictionary multiplied with sparse representation coefficients can be used to predict the future load value. Experimental results demonstrate that SRM is capable of forecasting the complex electric load time series effectively. It outperforms some popular machine learning methods such as Neural Network, SVM, and Random Forest. © 2019, Springer Nature Switzerland AG.

关键词： Electric load forecasting

来源：评论

学校读者我要写书评

暂无评论

Building Surrogate Models of Nuclear Density Functional Theory with Gaussian Processesand Autoencoders

arXiv

引用

arXiv 2022年

作者： Verriere, Marc Schunck, Nicolas Kim, Irene Marević, Petar Quinlan, Kevin NGo, Michelle N. Regnier, David Lasseri, Raphael David Nuclear and Data Theory group Nuclear and Chemical Science Division Lawrence Livermore National Laboratory LivermoreCA94550 United States Machine Intelligence group Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94550 United States Sensing and Intelligent Systems group Global Security Computing Applications Division Lawrence Livermore National Laboratory LivermoreCA94550 United States Centre Borelli ENS Paris-Saclay Université Paris-Saclay Gif-sur-Yvette91190 France Physics Department Faculty of Science University of Zagreb Zagreb10000 Croatia Applied Statistics Group Lawrence Livermore National Laboratory LivermoreCA94551 United States Center for Complex Biological Systems University of California Irvine IrvineCA92697 United States Université Paris-Saclay CEA Laboratoire Matière en Conditions Extrêmes Bruyères-le-Châtel91680 France CEA DAM DIF Arpajon91297 France

From the lightest Hydrogen isotopes up to the recently synthesized Oganesson (Z = 118), it is estimated that as many as about 3000 atomic nuclei could exist in nature. Most of these nuclei are too short-lived to be occurring on Earth, but they play an essential role in astrophysical events such as supernova explosions or neutron star mergers that are presumed to be at the origin of most heavy elements in the Universe. Understanding the structure, reactions, and decays of nuclei across the entire chart of nuclides is an enormous challenge because of the experimental difficulties in measuring properties of interest in such fleeting objects and the theoretical and computational issues of simulating strongly-interacting quantum many-body systems. Nuclear density functional theory (DFT) is a fully microscopic theoretical framework which has the potential of providing such a quantitatively accurate description of nuclear properties for every nucleus in the chart of nuclides. Thanks to high-performance computing facilities, it has already been successfully applied to predict nuclear masses, global patterns of radioactive decay like β or γ decay, and several aspects of the nuclear fission process such as, e.g., spontaneous fission half-lives. Yet, predictive simulations of nuclear spectroscopy – the low-lying excited states and transitions between them – or of nuclear fission, or the quantification of theoretical uncertainties and their propagation to basic or applied nuclear science applications, would require several orders of magnitude more calculations than currently possible. However, most of this computational effort would be spent into generating a suitable basis of DFT wavefunctions. Such a task could potentially be considerably accelerated by borrowing tools from the field of machine learning and artificial intelligence. In this paper, we review different approaches to applying supervised and unsupervised learning techniques to nuclear DFT. © 2022, CC BY.

关键词： Density functional theory

来源：评论

学校读者我要写书评

暂无评论

Controlled-source electromagnetic signal detection using a hybrid deep learning model: Convolutional and long short-term memory neural networks

引用

Computers and Geosciences 2025年 204卷

作者： Liu, Yecheng Li, Diquan Li, Jin Hu, Yanfang Liu, Zijie Zhang, Xian School of Geosciences and Info-Physics Central South University Changsha 410083 China Key Laboratory of Metallogenic Prediction of Non-Ferrous Metals and Geological Environment Monitor Ministry of Education Central South University Changsha 410083 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha 410081 China Hunan Provincial Key Laboratory of Finance & Economics Big Data Science and Technology School of Information Technology and Management Hunan University of Finance and Economics Changsha 410205 China

Controlled-source electromagnetic (CSEM) method using a periodic transmitted signal source suppresses random noise by superimposing and averaging the recorded signal over multiple periods. However, it still faces great challenges in strong interference environments. Here we present a CSEM signal detection method based on a hybrid architecture of convolutional neural network (CNN) and long short-term memory neural network (LSTM). Our method improves the quality of the recorded signal by filtering out all the noise periods and retaining the useful signal periods. The core lies in combining the spatial feature extraction capability of CNN with the time series modeling capability of LSTM, which can deeply excavate the feature differences between noise and CSEM useful signal. Meanwhile, a classification model of signal and noise is constructed using a large-scale training dataset. This hybrid model exhibits superior performance compared to other deep learning models such as CNN or LSTM. Also, we propose a novel signal detection mechanism that not only maintains the periodicity of CSEM signal, but also greatly enhances processing efficiency. The results of synthetic and measured data demonstrate that our method can obtain useful signals from CSEM data containing different noise types and significantly improve the quality of sounding curves. In particular, our method is useful for CSEM signal detection in strong interference. © 2025 Elsevier Ltd

关键词： Controlled-source electromagnetic method Deep learning Noise Signal detection

来源：评论

学校读者我要写书评

暂无评论

Fish vitality assessment under adversity stress based on multi-sensing fusion and deep learning techniques

引用

Aquaculture 2025年

作者： Yanfei Zhu Wenguan Zhang Yongjun Zhang Xiaoshuan Zhang College of Engineering China Agricultural University Beijing 100083 China College of Engineering Beijing Laboratory of Food Quality and Safety China Agricultural University Beijing China School of Information Engineering Shandong Youth University of Political Science Jinan 250103 China New Technology Research and Development Center of Intelligent Information Controlling in Universities of Shandong Jinan 250103 China Smart Healthcare Big Data Engineering and Ubiquitous Computing Characteristic Laboratory in Universities of Shandong Jinan 250103 China

Accurately assessing the vitality of fish during Cryogenic Waterless Live Transportation (CWLT) is crucial for ensuring their survival rate and transport quality. To address this, this study developed a multi-sensing fusion measurement system, integrating the impedance sensor and image sensor to capture fish impedance, phase angle data and visual image data, which can provide reliable data support for vitality assessment. A multi-input deep learning model for cross-modal data fusion, called the whale optimization algorithm-based dual-channel convolutional network (WOA-DConvNet), was developed to assess fish vitality. The study first conducted a correlation analysis between impedance and phase angle data using blood index data, revealing the relationship between different frequency signals and fish vitality status. Cluster analysis and variance analysis were then performed to examine the significant differences in vitality states. The results show significant differences ( P  < 0.05) in impedance and phase angle data between different vitality levels. Finally, the WOA-DConvNet model was used to evaluate the vitality of pearl gentian grouper during the live transport. The results showed that the model achieved excellent performance, achieving precision, recall, f1 score and accuracy of 91.81 %, 91.74 %, 91.76 % and 91.71 %. The core goal of this research is to explore the integrated application of artificial intelligence and advanced sensing technologies in the live transport process, aiming to develop a more precise and intelligent vitality assessment method and promote scientific monitoring and management during live fish transportation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correction to: Enhancing cyber defense strategies with discrete multi-dimensional Z-numbers: a multi-attribute decision-making approach

引用

Complex & intelligent Systems 2025年第7期11卷 1-1页

作者： Yao, Aiting Huang, Chen Zhang, Weiqi Dong, Chengzu Lu, Meiqu Mao, Junjun Liu, Xiao Li, Xuejun Anhui Provincial International Joint Research Center for Advanced Technology in Medical Imaging School of Computer Science and Technology Anhui University Hefei China AI Techplus Pty Ltd Organization Melbourne Australia School of Information Technology Deakin University Geelong Australia School of Data Science Lingnan University Hongkong China School of Artificial Intelligence Guangxi Minzu University Nanning China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：