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

2024 International Conference on Intelligent systems for Cybersecurity, ISCS 2024

作者： Singhi, Nitika Verma, Ankush Agrawal, Atul Khan, Irfan Computer Science Engineering Shri Vaishnav Vidhyapeeth Vishwavidyalava Indore India Data Analytics and Information System Prestige Institute of Management and Research Indore India Computer Science Engineering Sushila Devi Bansal College of Technology Indore India Computer Science Engineering Bansal Institute of Science and Technology Bhopal India

ISBN: (纸本)9798350375237

In past few year designs thinking has worked on several new effective problem and has generated innovative solution for new business model. For the scenario of today's demand, to better understand how design thinking can work on different perspectives in business models and how it can bring new innovative solutions for any problem is essential However, studies of existing literature explore the application, potential, and challenges of Design Thinking towards the comprehensive aim of this paper, which regards business model innovation as a fundamental subject of Design Thinking. The paper provides practical tools for exploring Design Thinking along with various critical aspects for the researchers to explore how Design Thinking can be applied to innovative business models. The main focus of this paper is to explain the basics of Design Thinking, how to frame the mind through different techniques used, the Design Techniques used for a business model, the methodology of a design thinker, and different tools like BPM, Blue Work Live, Mind Mapping, Brainstorming, and RICPS. © 2024 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of computer science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

A novel approach to identify parkinson’s disease and other similar neural stress by analysing keystrokes on modern active devices with ensemble classification

引用

Multimedia Tools and Applications 2025年 1-40页

作者： Roy, Soumen Roy, Utpal Sinha, Devadatta Pal, Rajat Kumar Department of Computer Science and Engineering University of Calcutta Acharya Prafulla Chandra Roy Siksha Prangan JD-2 Sector - III Saltlake City Kolkata700106 India Department of Computer and System Sciences Visva-Bharati University Santiniketan731235 India

Motor skills (related to the motor nerve) and neurocognitive disorders affect humans’ typing ability to an extent that is noticeable while using a keyboard, smartphone, or other electronic gadgets. These two medical conditions are Parkinson’s disease (PD), caused by malfunctions of the motor nerve, and neurocognitive disorder, caused by a deficiency of organismic responses to stimuli. A mild symptom of PD, change in fine motor skills during typing, is reflected heavily in keystroke patterns during the early stages. Similarly, Emotional stress (ES) expresses a neurocognitive disorder that affects cognitive abilities as well. Early symptoms of this disorder are reflected in the keystroke patterns according to their severity. As there is no such pathological examination, it is challenging to perceive and measure the development of such disorders already developed in human behaviour as a disease. Furthermore, early screening of these diseases is essential for future diagnosis and preventing fatal consequences, since both are progressive illnesses. A modest attempt is made here to detect two such neurodegenerative disorders in humans using the way they type, formally known as Keystroke dynamics (KD). In this study, a bootstrapped-based homogeneous ensemble classification method has been proposed to address the uncertain performance and uneven distribution of classes for the detection of such medical conditions using users’ typing tendencies. For this purpose, two recent benchmark datasets were used for the validation and confirmation of operational improvements of the proposed method, which have been validated qualitatively and quantitatively. As a result, sensitivity/specificity of 0.82/0.78 in detecting PD and 0.98/0.98 in ES have been achieved, which is robust and accurate in a more realistic evaluation. The proposed framework explores the possibilities of implementing it in web-based systems, which has significant benefits. A better diagnosis, early detection at home

关键词： Neurodegenerative diseases

来源：评论

学校读者我要写书评

暂无评论

Decomposition-Based Memetic Algorithm for Multi-Objective Fleet Size and Mix Vehicle Routing Problem 13

Decomposition-Based Memetic Algorithm for Multi-Objective Fl...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Ba, Yunpeng Zheng, Ruihao Wang, Zhenkun School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen China School of System Design and Intelligent Manufacturing Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen China

ISBN: (纸本)9798350308365

The heterogeneous fleet vehicle routing problem (HFVRP) is of great significance in logistics and transportation. This paper considers a crucial and challenging HFVRP variant, namely multi-objective fleet size and mix vehicle routing problem with unlimited fleet, fixed cost, and dependent cost (MO-FSMVRPFD). A decomposition-based memetic algorithm called MOEA/D-ALS is proposed to cope with MO-FSMVRPFD. MOEA/D-ALS uses the multi-objective evolutionary algorithm based on decomposition (MOEA/D) as the backbone. Beyond that, it adopts a replacement strategy based on maximal fitness improvement (MFI). In addition, the local search is conducted on difficult subproblems for further refinement. The experimental studies on 18 instances show that MOEA/D-ALS exhibits a significant performance superiority over two other representative algorithms. The effectiveness of both the MFI strategy and the adaptive local search procedure is also validated. © 2024 IEEE.

关键词： Vehicle routing

来源：评论

学校读者我要写书评

暂无评论

Compression Format and Systolic Array Structure Co-design for Accelerating Sparse Matrix Multiplication in DNNs 24th

Compression Format and Systolic Array Structure Co-design f...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Cao, Yongxiang Jiang, Jixiang Zhao, Guocheng Wang, Wei Jiang, Hongxu Song, Yanfei School of Computer Science and Engineering Beihang University Beijing China Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory Beijing China

ISBN: (纸本)9789819615445

The systolic array (SA) architecture is widely used in accelerator/AI chip design due to its excellent matrix multiplication acceleration effect. However, the mismatch between the traditional sparse matrix compression format and the SA architecture results in poor SA performance in computing sparse matrices. To solve the problem, we propose a method for co-designing the sparse compression format and SA architecture. This work proposes the Vector Group Compressed Coordinate (VGCC) data stream compression format and designs a sparse SA architecture based on hardware encoding and decoding. VGCC can handle data streams of any size without increasing the index bit width. The VGCC compression size is significantly smaller than general sparse compression formats such as COO/CSR. In a sparse matrix with a sparsity of 90%, it saves 67.13% of storage space compared to the state-of-the-art ECOO data stream compression format and achieves an average acceleration of 1.54 times. We also propose a VGCC-friendly SA architecture. Our SA architecture engine reduces logic consumption by 51.6% compared to Sparse TPU while achieving a 3.23x speedup. To mitigate the issue of high no-load rates in systolic arrays, we introduce a Data Transmission Priority (DTP) data matching algorithm. With sparsity levels ranging from 50% to 90%, the algorithm’s calculation speed is enhanced by 1.124x to 1.991x. We implemented a sparse DNN accelerator on an FPGA Zynq UltraScale+MPSoC ZCU102, utilizing the VGCC compression format proposed in this study for compressing input data. When compared to the S2 Engine, the accelerator achieved a 3.37x speed improvement in matrix multiplication with 75% sparsity, significantly enhancing the speed of sparse matrix multiplication. The accelerator achieved an average throughput of 1079.33GOP/s when inferencing DNNs. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Systolic arrays

来源：评论

学校读者我要写书评

暂无评论

A Survey on Evolutionary Computation Based Drug Discovery

引用

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Yu, Qiyuan Lin, Qiuzhen Ji, Junkai Zhou, Wei He, Shan Zhu, Zexuan Tan, Kay Chen College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science University of Birmingham Bir-mingham UK Department of Computing The Hong Kong Poly-technic University Hong Kong Hong Kong

Drug discovery is an expensive and risky process. To combat the challenges in drug discovery, an increasing number of researchers and pharmaceutical companies recognize the benefits of utilizing computational techniques. Evolutionary computation (EC) offers promise as most drug discovery problems are essentially complex optimization problems beyond conventional optimization algorithms. EC methods have been widely applied to solve these complex optimization problems especially in lead com-pound generation and molecular virtual evaluation, substantially speeding up the process of drug discovery and development. This article presents a comprehensive survey of EC-based drug discovery methods. Particularly, a new taxonomy of the methods is provided and the advantages and limitations of the methods are reviewed. In addition, the potential future directions of EC-based drug discovery are discussed and the publicly available resources including databases and computational tools are compiled for the convenience of researchers seeking to pursue this field. IEEE

关键词： Lead compounds

来源：评论

学校读者我要写书评

暂无评论

A Composite Decomposition Method for Large-Scale Global Optimization

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 6304-6319页

作者： Tian, Maojiang Chen, Minyang Du, Wei Tang, Yang Jin, Yaochu Yen, Gary G. Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen518055 China East China University of Science and Technology Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education Shanghai200237 China East China University of Science and Technology Engineering Research Center of Process System Engineering Ministry of Education Shanghai200237 China Westlake University School of Engineering Hangzhou310030 China Oklahoma State University School of Electrical and Computer Engineering StillwaterOK74048 United States

Cooperative coevolution (CC) algorithms, based on the divide-and-conquer strategy, have emerged as the predominant approach to solving large-scale global optimization (LSGO) problems. The efficiency and accuracy of the grouping stage significantly impact the performance of the optimization process. While the general separability grouping (GSG) method has overcome the limitation of previous differential grouping (DG) methods by enabling the decomposition of nonadditively separable functions, it suffers from high computational complexity. To address this challenge, this article proposes a composite separability grouping (CSG) method, seamlessly integrating DG and GSG into a problem decomposition framework to utilize the strengths of both approaches. CSG introduces a step-by-step decomposition framework that accurately decomposes various problem types using fewer computational resources. By sequentially identifying additively, multiplicatively and generally separable variables, CSG progressively groups nonseparable variables by recursively considering the interactions between each nonseparable variable and the formed nonseparable groups. Furthermore, to enhance the efficiency and accuracy of CSG, we introduce two innovative methods: a multiplicatively separable variable detection method and a nonseparable variable grouping method. These two methods are designed to effectively detect multiplicatively separable variables and efficiently group nonseparable variables, respectively. Extensive experimental results demonstrate that CSG achieves more accurate variable grouping with lower computational complexity compared to GSG and state-of-the-art DG-series designs. © 2024 IEEE.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Use of Euclidean Distance to Improve Fingerprint Matching Accuracy 4th

Use of Euclidean Distance to Improve Fingerprint Matching Ac...

引用

4th International Conference on Innovations in Computational Intelligence and computer Vision, ICICV 2024

作者： Bhargava, Neeraj Yadav, Rajendra Choudhary, Usha Department of Computer Science School of Engineering System Sciences MDS University Rajasthan Ajmer India Department of Computer and Communication Engineering Manipal University Jaipur Rajasthan Jaipur India

ISBN: (纸本)9789819769919

Fingerprint authentication is the most sophisticated method of all biometric techniques and has been thoroughly verified through various applications. Fingerprint matching has been done using several fingerprint recognition techniques. The methods for matching fingerprints have changed significantly over time, but Euclidean distance is still widely used since it is efficient and straightforward. Euclidean distance is still used in minutiae-based fingerprint matching to produce accurate results. The computational geometry, image processing, and patter recognition fields all make substantial use of Euclidean distance, a fundamental distance matching approach. The purpose of this work is to highlight the importance of normalization in improving contrast, particularly in noisy fingerprint photographs where accuracy is critical. We analyzed how to make fingerprint matching more robots against a reference template by utilizing Euclidean distance between small spots. We also analyzed algorithm’s effectiveness in producing dependable and accurate fingerprint matching results using MATLAB. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Solar Radiation Estimation Based on a New Combined Approach of Artificial Neural Networks (ANN) and Genetic Algorithms (GA) in South Algeria

引用

computers, Materials & Continua 2024年第6期79卷 4725-4740页

作者： Djeldjli Halima Benatiallah Djelloul Ghasri Mehdi Tanougast Camel Benatiallah Ali Benabdelkrim Bouchra Material Sciences Department Faculty of Material SciencesMathematics and Computer ScienceLaboratory of Sustainable Development and Computer Science(LSDCS)University of AdrarAdrar01000Algeria Department of Civil Engineering University of Sistan and BaluchestanZahedan98167-45845Iran Laboratory of Computer Production and Maintenance Engineering(LGIPM)University of LorraineChieulles57070France Laboratory of Energy Environment and Information System(LEEIS) University of AdrarAdrar01000Algeria

When designing solar systems and assessing the effectiveness of their many uses,estimating sun irradiance is a crucial first *** study examined three approaches(ANN,GA-ANN,and ANFIS)for estimating daily global solar radiation(GSR)in the south of Algeria:Adrar,Ouargla,and *** proposed hybrid GA-ANN model,based on genetic algorithm-based optimization,was developed to improve the ANN *** GA-ANN and ANFIS models performed better than the standalone ANN-based model,with GA-ANN being better suited for forecasting in all sites,and it performed the best with the best values in the testing phase of Coefficient of Determination(R=0.9005),Mean Absolute Percentage Error(MAPE=8.40%),and Relative Root Mean Square Error(rRMSE=12.56%).Nevertheless,the ANFIS model outperformed the GA-ANN model in forecasting daily GSR,with the best values of indicators when testing the model being R=0.9374,MAPE=7.78%,and rRMSE=10.54%.Generally,we may conclude that the initial ANN stand-alone model performance when forecasting solar radiation has been improved,and the results obtained after injecting the genetic algorithm into the ANN to optimize its weights were *** model can be used to forecast daily GSR in dry climates and other climates and may also be helpful in selecting solar energy system installations and sizes.

关键词： Solar energy systems genetic algorithm neural networks hybrid adaptive neuro fuzzy inference system solar radiation

来源：评论

学校读者我要写书评

暂无评论

Automated Detection of Harmful Insects in Agriculture: A Smart Framework Leveraging IoT, Machine Learning, and Blockchain

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第9期5卷 4787-4798页

作者： Rahman, Wahidur Hossain, Muhammad Minoar Hasan, Md. Mahedi Iqbal, Md. Sadiq Rahman, Mohammad Motiur Fida Hasan, Khondokar Moni, Mohammad Ali Mawlana Bhashani Science and Technology University Department of Computer Science and Engineering Tangail1902 Bangladesh Uttara University Department of Computer Science and Engineering Dhaka1230 Bangladesh Prime University Department of Management and Information System Mirpur Dhaka1216 Bangladesh Bangladesh University Department of Computer Science and Engineering Dhaka1207 Bangladesh School of Professional Studies CanberraNSW2052 Australia Artificial Intelligence and Cyber FuturesInstitute Charles Sturt University AI & Digital Health Technology BathurstNSW2795 Australia

Paddy cultivation is a significant global economic sector, with rice production playing a crucial role in influencing worldwide economies. However, insects in paddy farms predominantly impact the growth rate and ecological equilibrium of the agricultural field. Hence, the precise and timely identification of insects in agricultural settings presents a potential strategy for addressing this issue. This study aims to implement an automated system for paddy farming by employing a real-time framework that incorporates the Internet of Things (IoT), blockchain technology, and Deep Learning (DL) algorithms. The primary emphasis of the DL-based system is on the timely identification of pests. In contrast, integrating the IoT and blockchain technologies facilitates stablishing a fully automated system with security within the agricultural domain. The DL-based system includes a secondary dataset of paddy insects, and then preprocessing, feature extraction, and identification have been performed. Besides, an IoT-based system is embodied with a camera module and microprocessor, accompanied by some apparatus required to automate the whole system. In addition, the research also includes the blockchain to secure each individual data transmission among the several IoT components and the cloud server. While examining the proposed solution, various experimental data have been systematically documented and analyzed. The proposed framework attained a peak accuracy of 98.91% using the VGG19 model and ensemble classifiers to detect the pest with a specificity of 99.14% and a precision of 98.21%. The study additionally quantifies the mean duration of the cloud response when integrated with IoT, yielding an average time of 1.71 s after pest identification. Nevertheless, the system has exhibited a high level of efficacy in the context of real-time monitoring and automation of paddy farms. © 2020 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：