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

Prediction of Compressive Strength of Green Concrete by Artificial Neural Network 1st

学校读者我要写书评

暂无评论

Prediction of Compressive Strength of Green Concrete by Arti...

1st International Conference on Advanced Communication and Intelligent Systems, ICACIS 2022

作者： Verma, Manvendra Upreti, Kamal Dadhich, Priyanka Ghosh, Soumi Khatri, Vishal Singh, Prashant Department of Civil Engineering GLA University Uttar Pradesh Mathura India Department of Computer Science and Engineering Akhilesh Das Gupta Institute of Technology and Management Delhi India Department of Big Data Analytics Asia Pacific Institute of Management Delhi India Department of Information Technology Maharaja Agrasen Institute of Technology Delhi India Department of Computer Science and Engineering Bhagwan Parshuram Institute of Technology Delhi India Department of Computer Science and Engineering Sunder Deep Engineering College Ghaziabad India

ISBN: (纸本)9783031250873

The concrete business has just come out with a brand-new product called geopolymer concrete. Because of its resilience in harsh environments and its high strength, it has the potential to revolutionise the whole construction industry. It is an excellent substitute for the traditional kind of concrete. It outperforms traditional concrete in terms of sustainability, ecology, durability, and economic viability. In this day and age, the use of machine learning strategies is not just the future of the research and development industry, but of all industries. These methods provide predictions about the outcomes by analysing the facts from the past. The process of determining the outcomes or worth of anything in the construction sector is very challenging, time consuming, and arduous. Without having to conduct destructive experiments or take samples, the strength of a mix design may now be more accurately predicted thanks to these procedures. By using deep learning and the random forest method, the purpose of this research is to predict the compressive strength of flyash-based geopolymer concrete. This will be accomplished by comparing the two algorithms with varying degrees of error and coefficient correlation. It has been shown via the use of simulated data that the random forest algorithm is the method that is most suited for making predictions about compressive strength. After the developing a model, the various errors were found for accuracy. The mean absolute error, root mean square error, relative absolute error, and root relative squared error are 3.46%, 5.94%, 64.32%, and 82.97%, respectively for the deep learning predicted compressive strength. The errors provide the proof of model accuracy to predict the compressive strength on the basis of ingredients proportions. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Compressive strength

End-to-end Dense video captioning with parallel decoding

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Teng Zhang, Ruimao Lu, Zhichao Zheng, Feng Cheng, Ran Luo, Ping The University of Hong Kong Southern University of Science and Technology The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data

Dense video captioning aims to generate multiple associated captions with their temporal locations from the video. Previous methods follow a sophisticated "localize-then-describe" scheme, which heavily relies on numerous hand-crafted components. In this paper, we proposed a simple yet effective framework for end-to-end dense video captioning with parallel decoding (PDVC), by formulating the dense caption generation as a set prediction task. In practice, through stacking a newly proposed event counter on the top of a transformer decoder, the PDVC precisely segments the video into a number of event pieces under the holistic understanding of the video content, which effectively increases the coherence and readability of predicted captions. Compared with prior arts, the PDVC has several appealing advantages: (1) Without relying on heuristic non-maximum suppression or a recurrent event sequence selection network to remove redundancy, PDVC directly produces an event set with an appropriate size;(2) In contrast to adopting the two-stage scheme, we feed the enhanced representations of event queries into the localization head and caption head in parallel, making these two sub-tasks deeply interrelated and mutually promoted through the optimization;(3) Without bells and whistles, extensive experiments on ActivityNet Captions and YouCook2 show that PDVC is capable of producing high-quality captioning results, surpassing the state-of-the-art two-stage methods when its localization accuracy is on par with them. Code is available at https://***/ttengwang/*** Codes 68T45 Copyright © 2021, The Authors. All rights reserved.

关键词： Decoding

Order-preserving pattern mining with forgetting mechanism

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Yan Ma, Chenyu Gao, Rong Wu, Youxi Li, Jinyan Wang, Wenjian Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300400 China School of Artificial Intelligence Hebei University of Technology Tianjin300400 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China School of Computer and Information Technology Shanxi University Taiyuan237016 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Order-preserving pattern (OPP) mining is a type of sequential pattern mining method in which a group of ranks of time series is used to represent an OPP. This approach can discover frequent trends in time series. Existing OPP mining algorithms consider data points at different time to be equally important;however, newer data usually have a more significant impact, while older data have a weaker impact. We therefore introduce the forgetting mechanism into OPP mining to reduce the importance of older data. This paper explores the mining of OPPs with forgetting mechanism (OPF) and proposes an algorithm called OPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks, candidate pattern generation and support calculation. In candidate pattern generation, OPF-Miner employs a maximal support priority strategy and a group pattern fusion strategy to avoid redundant pattern fusions. For support calculation, we propose an algorithm called support calculation with forgetting mechanism, which uses prefix and suffix pattern pruning strategies to avoid redundant support calculations. The experiments are conducted on nine datasets and 12 alternative algorithms. The results verify that OPF-Miner is superior to other competitive algorithms. More importantly, OPF-Miner yields good clustering performance for time series, since the forgetting mechanism is employed. Copyright © 2024, The Authors. All rights reserved.

关键词： Miners

Existence of a generalized polynomial attractor for the wave equation with nonlocal weak damping, anti-damping and critical nonlinearity

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhao, Chunyan Zhong, Chengkui Yan, Senlin School of Mathematics and Big Data Anhui University of Science and Technology Huainan232001 China Department of Mathematics Nanjing University Nanjing210093 China

In this paper, we first establish a criterion based on contractive function for the existence of polynomial attractors. This criterion only involves some rather weak compactness associated with the repeated limit inferior and requires no compactness, which makes it suitable for critical cases. Then by this abstract theorem, we verify the existence of a polynomial attractor and estimate its attractive speed for the wave equation with nonlocal weak damping, anti-damping and critical *** Codes 35B40, 35B41, 35L05, 35B33 Copyright © 2021, The Authors. All rights reserved.

关键词： Damping

A Drug Box Recognition System Based on Deep Learning and Cloud-Edge Collaboration for Pharmacy Automation

学校读者我要写书评

暂无评论

A Drug Box Recognition System Based on Deep Learning and Clo...

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Honglei Zhu Anming Dong Jiguo Yu Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Key Laboratory of Computing Power Network and Information Security Qilu University of Technology (Shandong Academy of Sciences) Jinan China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Big Data Institute Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Drug box recognition is an integral part of the pharmacy automation system (PAS), which checks for discrepancies between the drugs provided by the system and the doctor’s prescription with the help of modern image recognition techniques. Although deep learning has facilitated the development of pharmacy automation systems, practical applications still face challenges. First, pharmacies update drugs frequently, and many pharmacies across the country are trained independently, which requires consuming massive computational resources. Secondly, the equipment performance of pharmacies is poor, and it’s hard to guarantee the real-time and accuracy of recognition. Therefore, we propose a cloud-side collaborative drug box recognition system. When new drugs are added, the new model is trained in the cloud and uniformly distributed to each edge through this architecture. In terms of real-time recognition, an improved lightweight YOLOv5 model is added to the edge part, and a text recognition module is deployed in the cloud to validate the recognition results at the edge. This cloud-edge collaboration architecture not only ensures the accuracy of recognition, but also reduces the burden on the compute edge, ensures the real-time *** results show that the proposed cloud-edge architecture reduces the recognition latency by 37.18% and achieves a precision of 97.47%. The improved YOLOv5 model reduces GFLOPs by 45% while achieving a 1.6% precision improvement.

关键词：

GK: A Graphormer Architecture Based Knowledge Graph Reasoning Model for Link Prediction

学校读者我要写书评

暂无评论

GK: A Graphormer Architecture Based Knowledge Graph Reasonin...

IEEE International Conference on big data and Cloud Computing (BdCloud)

作者： Yueiia Wu Jian-tao Zhou Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph has become a dominant research field in graph theory, but its incompleteness and sparsity hinder its application in various fields. Knowledge Graph Reasoning aims to alleviate these problems by deducing new knowledge or identifying false knowledge from existing knowledge. Recently, the Graph Convolution Network (GCN) based method is one of the most advanced methods to realize knowledge graph reasoning. However, it still suffers from some problems such as incomplete neighbor information aggregation and slow training speed. This paper proposes a knowledge graph reasoning model named GK for the link prediction task, which obtains better performance than existing GCN-based methods by introducing Graphormer into knowledge reasoning. The GK first proposes that nodes and their surroundings can be regarded as a hierarchical architecture that enables the model to capture more practical reasoning information to improve prediction accuracy. In addition, to accelerate the training speed of the model on the large-scale Knowledge Graph, we present a faster shortest path-finding method F-SPF in the edge coding process. Extensive experimental results show that the GK model can obtain the state-of-the-art prediction results of current GCN-based methods and can improve the training speed.

关键词： Training Knowledge engineering Knowledge graphs Predictive models Prediction algorithms Feature extraction Cognition

A residual attention-based privacy-preserving biometrics model of transcriptome prediction from genome

学校读者我要写书评

暂无评论

A residual attention-based privacy-preserving biometrics mod...

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Cheng Tian Song Liu Jinbao Li Guangchen Wang Luyue Kong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Department of Medicine Shandong Medical College Jinan China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Transcriptome prediction from genetic variation data is an important task in the privacy-preserving and biometrics field, which can better protect genomic data and achieve biometric recognition through transcriptome. Many transcriptome prediction methods have achieved good accuracy from genetic variation data. However, these traditional transcriptome prediction methods have the problems of linear assumption, overfitting, expose personal privacy, and extensive manual optimization. To solve these shortcomings, we propose an attention-based transcriptome prediction model from genetic variation named RATPM that improves the accuracy of transcriptome prediction and protects participant genomic data. In RATPM, we introduce and improve the deep learning model with multi-head self-attention into the transcriptome prediction stage of Predixcan, which uncovers the non-linear relationship between genetic variation and transcriptome. Moreover, we introduce a residual attention module to generate attention-aware features and extract more accurate features at different levels from genetic variation. Furthermore, we introduce the BERT pre-training module to encode genetic variation fully utilizing their contextual information. Our research enables scientific institutions to publish only predicted transcriptomic data for biometric purposes, thus protecting the genomic information of the subjects. Finally, we evaluated our model on the 1000 Genomes and Geuvadis projects datasets to compare with other baseline models.

关键词： Privacy Biometrics (access control) Biological system modeling Genomics Predictive models Feature extraction Gene expression

Towards on Blockchain data Privacy Protection with Cryptography and Software Architecture Approach 2nd

学校读者我要写书评

暂无评论

Towards on Blockchain Data Privacy Protection with Cryptogra...

2nd International Conference on Blockchain and Trustworthy Systems, Blocksys 2020

作者： Wang, Zexu Wen, Bin Luo, Ziqiang School of Information Science and Technology Hainan Normal University Haikou China Cloud Computing and Big Data Research Center Hainan Normal University Haikou China Key Laboratory of Data Science and Intelligence Education of Ministry of Education Hainan Normal University Haikou571158 China

ISBN: (纸本)9789811592126

The essence of blockchain is to solve trust problems and realize value transfer. The traditional centralized processing method adopts centralized transmission and storage of users’ data privacy, which improves the security and reliability of processing. The non central blockchain technology uses distributed ledger technology to realize the characteristics of disintermediation, data tampering, traceability, work audit, etc. encryption algorithm is used to encrypt the data, and consensus mechanism makes the data sharing of blockchain system more fair and stable. The current passive data privacy schemes are basically based on cryptography. On the premise of satisfying the constraint mechanism of blockchain, this paper studies the technical framework, encryption mechanism and empirical analysis of blockchain, and discusses the information privacy protection method of hiding the original big data as much as possible, so as to improve the system performance and protect the security and privacy of user data. At the same time, we study data privacy protection from the perspective of software architecture, and propose a data privacy protection scheme through algorithm decomposition multi center collaboration method, which provides guidance for big data sharing and transaction based on blockchain. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Blockchain

Training of Spiking Neural Network joint Curriculum Learning Strategy

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Tang, Lingling Chu, Jielei Gong, Zhiguo Li, Tianrui The School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China The State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China

Starting with small and simple concepts, and gradually introducing complex and difficult concepts is the natural process of human learning. Spiking Neural Networks (SNNs) aim to mimic the way humans process information, but current SNNs models treat all samples equally, which does not align with the principles of human learning and overlooks the biological plausibility of SNNs. To address this, we propose a CL-SNN model that introduces Curriculum Learning(CL) into SNNs, making SNNs learn more like humans and providing higher biological interpretability. CL is a training strategy that advocates presenting easier data to models before gradually introducing more challenging data, mimicking the human learning process. We use a confidence-aware loss to measure and process the samples with different difficulty levels. By learning the confidence of different samples, the model reduces the contribution of difficult samples to parameter optimization automatically. We conducted experiments on static image datasets MNIST, Fashion-MNIST, CIFAR10, and neuromorphic datasets N-MNIST, CIFAR10-DVS, DVS-Gesture. The results are promising. To our best knowledge, this is the first proposal to enhance the biologically plausibility of SNNs by introducing CL. Copyright © 2023, The Authors. All rights reserved.

关键词： Curricula