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

Informatica (Slovenia) 2025年第1期49卷 207-220页

作者： Bhatt, Arpita Jadhav Sardana, Neetu Department of Computer Science & Engineering and Information Technology Jaypee Institute of Information Technology Indonesia

In today’s era, smartphones are used in daily lives because they are ubiquitous and can be customized by installing third-party apps. As a result, the menaces because of these apps, which are potentially risky for user’s privacy, have increased. information on smartphones is perhaps, more personal than compared to data stored on desktops or computers, making it an easy target for intruders. After Android, the most prevalently used mobile operating system is Apple’s iOS. Both Android and iOS follow permission-based access control to protect user’s privacy. However, the users are unaware whether the app is breaching the user’s privacy. To combat this problem, in the paper we propose a hybrid approach to detect malicious iOS apps based on its permissions. In the first phase, weights have been assigned to app permissions using multi-criteria decision-making (MCDM) approach namely Analytic Hierarchy Process (AHP), and in the second phase machine learning& ensemble learning techniques have been employed to train the classifiers for detecting malicious apps. To test the efficacy of the proposed method dataset comprising 1150 apps from 12 app categories has been used. The results demonstrate the proposed approach improves the efficacy of detecting malicious iOS apps for majority of categories. © 2025 Slovene Society Informatika. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

Exploration of alzheimer disease using design of experiments

引用

Multimedia Tools and Applications 2025年第3期84卷 1079-1101页

作者： Gupta, Pranav Pandey, Kavita Gupta, Sanskar Department of Computer Science & Engineering and Information Technology Jaypee Institute of Information Technology Noida India

This study examines the use of experimental designs, specifically full and fractional factorial designs, for predicting Alzheimer’s disease with fewer variables. The full factorial design systematically investigates the effects of selected factors, providing a comprehensive analysis of their individual and interactive impacts on Alzheimer’s prediction. On the other hand, the fractional factorial design simplifies the model by selecting key factors and removing non-significant ones. For Alzheimer’s, among all the factors examined, the MMSE (Mini-mental state Examination) score emerged as the most significant, which was further cross-validated using Minitab Software Analysis. Importantly, the findings suggest that the fractional factorial design is a better alternative, particularly when time and cost constraints are present. The results highlight the effectiveness and efficiency of these experimental designs, demonstrating their potential for early detection, prevention, and treatment of Alzheimer’s disease. By contributing to the expanding knowledge base on experimental designs in medical research, this study emphasizes their crucial role in understanding and combating complex diseases like Alzheimer’s. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Design of experiments

来源：评论

学校读者我要写书评

暂无评论

Modern Machine Learning Solution for Electricity Consumption Management in Smart Buildings

引用

IEEE engineering Management Review 2025年第1期53卷 54-62页

作者： Gautam, Sandeep Kumar Shrivastava, Vinayak Udmale, Sandeep S. Singh, Amit Kumar Singh, Sanjay Kumar Department of Computer Science and Engineering Varanasi221005 India Department of Computer Engineering and Information Technology Mumbai400019 India National Institute of Technology Department of Computer Science and Engineering Patna800005 India

Effective management of electricity consumption (EC) in smart buildings (SBs) is crucial for optimizing operational efficiency, cost savings, and ensuring sustainable resource utilization. Accurate EC prediction enables proactive decision-making, ensuring that resources are allocated efficiently to meet actual demand levels while maintaining occupant comfort. Population growth, building expansion, and technology usage swiftly escalate electricity demand, thus necessitating economical EC management strategies and assist consumers to better understand and strategically plan their EC. To address these challenges, this article proposes a novel approach based on a hybrid prediction model combining temporal convolutional networks (TCNs) and gated recurrent units (GRU). This approach capitalizes on the strengths of both TCN and GRU. TCN is adept at efficiently identifying diverse patterns, particularly within the complex working environments of SBs, by effectively capturing high- and low-frequency information. Subsequently, GRU is leveraged to address the long-term dependencies within the data, enhancing the accuracy of EC prediction. In this article, the results demonstrate the effectiveness of the proposed hybrid model, outperforming competitive methods with an impressive mean absolute error score. This underscores the potential of this approach to improve energy management practices significantly within SB environments, ultimately enhancing both operational efficiency and occupant satisfaction. © 1973-2011 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Local Search-Based Anytime Algorithms for Continuous Distributed Constraint Optimization Problems

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 288-290页

作者： Xin Liao Khoi Hoang Xin Luo the College of Computer and Information Science Southwest University the Department of Computer Science and Engineering Washington University in St.Louis IEEE

Dear Editor,The distributed constraint optimization problems(DCOPs) [1]-[3]provide an efficient model for solving the cooperative problems of multi-agent systems, which has been successfully applied to model the real-world problems like the distributed scheduling [4], sensor network management [5], [6], multi-robot coordination [7], and smart grid [8]. However, DCOPs were not well suited to solve the problems with continuous variables and constraint cost in functional form, such as the target tracking sensor orientation [9], the air and ground cooperative surveillance [10], and the sensor network coverage [11].

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Improved Graph Partitioning Algorithm Based Approach for Workflow Offloading in a Fog Environment

引用

Journal of The Institution of Engineers (India): Series B 2025年第2期106卷 623-634页

作者： Mahajan, Neetu Narang Kaur, Parmeet Department of Computer Science and Engineering Jaypee Institute of Information Technology Noida India

The paper addresses the critical problem of application workflow offloading in a fog environment. Resource constrained mobile and Internet of Things devices may not possess specialized hardware to run complex workflows locally and hence, need to offload these tasks to fog nodes. As compared to cloud-based servers, fog nodes can provide responses in a more-timely manner and are preferred for latency-sensitive applications. Workflow applications are characterized by inter-task dependencies and hence, can be readily represented as directed acyclic graphs. Therefore, the proposed offloading solution approach utilizes an improved graph partitioning algorithm based on the Louvain community detection algorithm. The aim of the algorithm is to partition the workflow graph in such a manner that the workflow tasks having high communication costs between them are transferred or offloaded to the same fog node. The benefits of the proposed algorithm have been verified by simulation experiments where it was observed that it results in a lower makespan as compared to the related approaches. © The Institution of Engineers (India) 2024.

关键词： Fog

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving recommendation with coarse-grained spatiotemporal contexts

引用

science China(information sciences) 2025年第4期68卷 66-81页

作者： Lei CHEN Chen GAO Jiahuan LEI Xiaoyi DU Xinlei SHI Hengliang LUO Depeng JIN Yong LI Meng WANG Department of Electronic Engineering BNRist Tsinghua University Meituan Inc. School of Computer Science and Information Engineering Hefei University of Technology

The behavior of users on online life service platforms like Meituan and Yelp often occurs within specific finegrained spatiotemporal contexts(i.e., when and where). Recommender systems, designed to serve millions of users, typically operate in a fully server-based manner, requiring on-device users to upload their behavioral data, including fine-grained spatiotemporal contexts, to the server, which has sparked public concern regarding privacy. Consequently, user devices only upload coarse-grained spatiotemporal contexts for user privacy protection. However, previous research mostly focuses on modeling fine-grained spatiotemporal contexts using knowledge graph convolutional models, which are not applicable to coarse-grained spatiotemporal contexts in privacy-constrained recommender systems. In this paper, we investigate privacy-preserving recommendation by leveraging coarse-grained spatiotemporal contexts. We propose the coarse-grained spatiotemporal knowledge graph for privacy-preserving recommendation(CSKG), which explicitly models spatiotemporal co-occurrences using common-sense knowledge from coarse-grained contexts. Specifically, we begin by constructing a spatiotemporal knowledge graph tailored to coarse-grained spatiotemporal contexts. Then we employ a learnable metagraph network that integrates common-sense information to filter and extract co-occurrences. CSKG evaluates the impact of coarsegrained spatiotemporal contexts on user behavior through the use of a knowledge graph convolutional network. Finally, we introduce joint learning to effectively learn representations. By conducting experiments on two real large-scale datasets,we achieve an average improvement of about 11.0% on two ranking metrics. The results clearly demonstrate that CSKG outperforms state-of-the-art baselines.

关键词： privacy-preserveing coarse-grained spatiotemporal contexts recommender systems

来源：评论

学校读者我要写书评

暂无评论

Enhancing User Experience in AI-Powered Human-computer Communication with Vocal Emotions Identification Using a Novel Deep Learning Method

引用

computers, Materials & Continua 2025年第2期82卷 2909-2929页

作者： Ahmed Alhussen Arshiya Sajid Ansari Mohammad Sajid Mohammadi Department of Computer Engineering College of Computer and Information SciencesMajmaah UniversityAl-Majmaah11952Saudi Arabia Department of Information Technology College of Computer and Information SciencesMajmaah UniversityAl-Majmaah11952Saudi Arabia Department of Computer Science College of Engineering and Information TechnologyOnaizah CollegesQassim51911Saudi Arabia

Voice, motion, and mimicry are naturalistic control modalities that have replaced text or display-driven control in human-computer communication (HCC). Specifically, the vocals contain a lot of knowledge, revealing details about the speaker’s goals and desires, as well as their internal condition. Certain vocal characteristics reveal the speaker’s mood, intention, and motivation, while word study assists the speaker’s demand to be understood. Voice emotion recognition has become an essential component of modern HCC networks. Integrating findings from the various disciplines involved in identifying vocal emotions is also challenging. Many sound analysis techniques were developed in the past. Learning about the development of artificial intelligence (AI), and especially Deep Learning (DL) technology, research incorporating real data is becoming increasingly common these days. Thus, this research presents a novel selfish herd optimization-tuned long/short-term memory (SHO-LSTM) strategy to identify vocal emotions in human communication. The RAVDESS public dataset is used to train the suggested SHO-LSTM technique. Mel-frequency cepstral coefficient (MFCC) and wiener filter (WF) techniques are used, respectively, to remove noise and extract features from the data. LSTM and SHO are applied to the extracted data to optimize the LSTM network’s parameters for effective emotion recognition. Python Software was used to execute our proposed framework. In the finding assessment phase, Numerous metrics are used to evaluate the proposed model’s detection capability, Such as F1-score (95%), precision (95%), recall (96%), and accuracy (97%). The suggested approach is tested on a Python platform, and the SHO-LSTM’s outcomes are contrasted with those of other previously conducted research. Based on comparative assessments, our suggested approach outperforms the current approaches in vocal emotion recognition.

关键词： Human-computer communication(HCC) vocal emotions live vocal artificial intelligence(AI) deep learning(DL) selfish herd optimization-tuned long/short K term memory(SHO-LSTM)

来源：评论

学校读者我要写书评

暂无评论

A Novel CAPTCHA Recognition System Based on Refined Visual Attention

引用

computers, Materials & Continua 2025年第4期83卷 115-136页

作者： Zaid Derea Beiji Zou Xiaoyan Kui Monir Abdullah Alaa Thobhani Amr Abdussalam School of Computer Science and Engineering Central South UniversityChangsha410083China College of Computer Science and Information Technology Wasit UniversityWasit52001Iraq Department of Computer Science and Artificial Intelligence College of Computing and Information TechnologyUniversity of BishaBisha67714Saudi Arabia Electronic Engineering and Information Science Department University of Science and Technology of ChinaHefei230026China

Improving website security to prevent malicious online activities is crucial,and CAPTCHA(Completely Automated Public Turing test to tell computers and Humans Apart)has emerged as a key strategy for distinguishing human users from automated ***-based CAPTCHAs,designed to be easily decipherable by humans yet challenging for machines,are a common form of this ***,advancements in deep learning have facilitated the creation of models adept at recognizing these text-based CAPTCHAs with surprising *** our comprehensive investigation into CAPTCHA recognition,we have tailored the renowned UpDown image captioning model specifically for this *** approach innovatively combines an encoder to extract both global and local features,significantly boosting the model’s capability to identify complex details within CAPTCHA *** the decoding phase,we have adopted a refined attention mechanism,integrating enhanced visual attention with dual layers of Long Short-Term Memory(LSTM)networks to elevate CAPTCHA recognition *** rigorous testing across four varied datasets,including those from Weibo,BoC,Gregwar,and Captcha 0.3,demonstrates the versatility and effectiveness of our *** results not only highlight the efficiency of our approach but also offer profound insights into its applicability across different CAPTCHA types,contributing to a deeper understanding of CAPTCHA recognition technology.

关键词： Text-based CAPTCHA recognition refined visual attention web security computer vision

来源：评论

学校读者我要写书评

暂无评论

A Novel Reliable and Trust Objective Function for RPL-Based IoT Routing Protocol

引用

computers, Materials & Continua 2025年第2期82卷 3467-3497页

作者： Mariam A.Alotaibi Sami S.Alwakeel Aasem N.Alyahya Department of Computer Engineering College of Computer ScienceKing Saud UniversityRiyadh11543Saudi Arabia Department of Computer Science and Information Technology Shaqra UniversityShaqra11961Saudi Arabia

The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).

关键词： IoT LLNs RPL objective function OF MRHOF OF0 routing metrics reliability trustworthiness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：