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

Privacy-preserving human activity sensing:A survey

High-Confidence computing 2024年第1期4卷 108-117页

作者： Yanni Yang Pengfei Hu Jiaxing Shen Haiming Cheng Zhenlin An Xiulong Liu School of Computer Science and Technology Shandong UniversityQingdao 266237China Department of Computing and Decision Sciences Lingnan UniversityHong KongChina Department of Computing The Hong Kong Polytechnic UniversityHong KongChina Department of Computer Science Princeton UniversityNJ 08544USA College of Intelligence and Computing Tianjin UniversityTianjin 300350China

With the prevalence of various sensors and smart devices in people’s daily lives,numerous types of information are being *** using such information provides critical and convenient services,we are gradually exposing every piece of our behavior and *** are aware of the privacy risks and have been working on preserving privacy while sensing human *** survey reviews existing studies on privacy-preserving human activity *** first introduce the sensors and captured private information related to human *** then propose a taxonomy to structure the methods for preserving private information from two aspects:individual and collaborative activity *** each of the two aspects,the methods are classified into three levels:signal,algorithm,and ***,we discuss the open challenges and provide future directions.

关键词： Human activity sensing Privacy-preserving sensing Activity sensing algorithms Human sensors Privacy protection

来源：评论

学校读者我要写书评

暂无评论

An Attention-Locating Algorithm for Eliminating Background Effects in Fine-grained Visual Classification

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第6期35卷 5993-6006页

作者： Huang, Yueting Hechen, Zhenzhe Zhou, Mingliang Li, Zhengguo Kwong, Sam Chongqing University School of Computer Science Chongqing400044 China Agency for Science Technology and Research Institute for Infocomm Research Singapore138632 Singapore Lingnan University Department of Computing and Decision Science Hong Kong

Fine-grained visual classification (FGVC) is a challenging task characterized by interclass similarity and intraclass diversity and has broad application prospects. Recently, several methods have adopted the vision Transformer (ViT) in FGVC tasks since the data specificity of the multihead self-attention (MSA) mechanism in ViT is beneficial for extracting discriminative feature representations. However, these works focus on integrating feature dependencies at a high level, which leads to the model being easily disturbed by low-level background information. To address this issue, we propose a fine-grained attention-locating vision Transformer (FAL-ViT) and an attention selection module (ASM). First, FAL-ViT contains a two-stage framework to identify crucial regions effectively within images and enhance features by strategically reusing parameters. Second, the ASM accurately locates important target regions via the natural scores of the MSA, extracting finer low-level features to offer more comprehensive information through position mapping. Extensive experiments on public datasets demonstrate that FAL-ViT outperforms the other methods in terms of performance, confirming the effectiveness of our proposed methods. The source code is available at https://***/Yueting-Huang/FAL-ViT. © 1991-2012 IEEE.

关键词： Feature extraction Transformers Visualization Data mining computer vision Circuits and systems Training Computational modeling Classification algorithms Background noise

来源：评论

学校读者我要写书评

暂无评论

Network Intrusion Detection System Using Optuna 5

Network Intrusion Detection System Using Optuna

引用

5th International Conference on IoT Based Control Networks and Intelligent Systems, ICICNIS 2024

作者： Parekh, Nishank Sen, Arzob Rajasekaran, P. Jayaseeli, J. D. Dorathi Robert, P. School of Computing Department of Computer Science and Engineering SRM Institute of Science and Technology Tamil Nadu Chengalpattu India School of Computing Department of Computing Technologies SRM Institute of Science and Technology Tamil Nadu Chengalpattu India

ISBN: (纸本)9798331518097

The rapid growth of the digital industry has created a higher demand for robust Network Intrusion Detection Systems (NIDS) to protect valuable information and the integrity of network infrastructures as the digital industry grows rapidly. One of the most important challenges in the current intrusion detection landscape is the growing sophistication of cyber threats, including zero-day attacks, polymorphic malware, and advanced persistent threats, which are difficult to detect using traditional methods. Furthermore, systems often suffer from high false positive rates and struggle to scale effectively in real-time applications. Traditionally, intrusion detection methods were quite effective, but performance is still lacking due to the inability to adapt to evolving threats. Recent breakthroughs include deep learning approaches, ensemble methods, and hybrid detection models. However, these are still plagued by high computational overhead and a lack of transparency in their decision-making processes. The work exploits Optuna for the optimization of hyperparameters, specifically in the performance improvement of various ML models. Among the best-ranked frameworks for the optimization of hyperparameters, Optuna provides a principled method for tuning hyperparameters, resulting in significantly enhanced accuracy and efficiency of the intrusion detection model. The implication of this research work is that it searches for the best configuration of parameters for each algorithm with balanced false positives and detection rates. The study includes an overall scenario of recent development in NIDS. More precisely, this paper shows how Hyperparameter tuning attains very superior model performance compared to other models. The comparative results presented have shown that models which are optimized using Optuna surpass the non-optimized ones by a huge margin with respect to accuracy, recall, precision, and F1-score. The paper also discusses ensemble techniques by integrating the

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

NL2Code: A Hybrid NLP and Model-Driven Framework for Automated Code Generation from Natural Language and UML

NL2Code: A Hybrid NLP and Model-Driven Framework for Automat...

引用

2025 IEEE International Students' Conference on Electrical, Electronics and computer science, SCEECS 2025

作者： Nair, Reshma P Thushara, M.G. Amrita School of Computing Amrita Department of Computer Science & Engineering Kerala Vishwa Vidyapeetham Amritapuri Kollam India Amrita School of Computing Amrita Department of Computer Science & Applications Kerala Vishwa Vidyapeetham Amritapuri Kollam India

ISBN: (纸本)9798331529833

The process of converting natural language requirements and visual models into executable software code remains an ongoing challenge in software engineering. We developed an intelligent system that adopts Natural Language Processing (NLP) and Model-Driven Engineering (MDE) to generate code from natural language requirements and UML diagrams. It then applies advanced NLP techniques for natural language specification, such as tokenization, POS tagging, semantic analysis, and information extraction. This information can be transformed into computer language construct and design patterns with the help of MDE concepts. It generates code templates, skeleton code, and real code and incorporates key principles of software engineering and technological specializations. Case studies explain how the system can improve the software development lifecycle for a development company by automatically translating the natural language and the visual models into code. The system synthesized code with 92-95 % accuracy and 92-93 % completeness in three particular cases of use, proving the efficiency of the translation process of natural language requirements and UML diagrams into executable code. The present work enriches software engineering, NLP, as well as the integration of MDE, and code generation, reducing time consumption, manual efforts, and fast communication in the Software Development Process. © 2025 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Hyper-personalized employment in urban hubs: multimodal fusion architectures for personality-based job matching

引用

Neural computing and Applications 2024年 1-16页

作者： Jain, Dipika Sangwan, Saurabh Raj Kumar, Akshi Department of Computer Science and Engineering Delhi Technological University New Delhi India School of Computer Science and Engineering Galgotias University Greater Noida India Department of Computing Goldsmiths University of London London United Kingdom

In the evolving landscape of smart cities, employment strategies have been steering towards a more personalized approach, aiming to enhance job satisfaction and boost economic efficiency. This paper explores an advanced solution by integrating multimodal deep learning to create a hyper-personalized job matching system based on individual personality traits. We employed the First Impressions V2 dataset, a comprehensive collection encompassing various data modalities suitable for extracting personality insights. Among various architectures tested, the fusion of XceptionResNet with BERT emerged as the most promising, delivering unparalleled results. The combined model achieved an accuracy of 92.12%, an R2 score of 54.49%, a mean squared error of 0.0098, and a root mean squared error of 0.0992. These empirical findings demonstrate the effectiveness of the XceptionResNet + BERT in mapping personality traits, paving the way for an innovative, and efficient approach to job matching in urban environments. This work has the potential to revolutionize recruitment strategies in smart cities, ensuring placements that are not only skill-aligned but also personality-congruent, optimizing both individual satisfaction and organizational productivity. A set of theoretical case studies in technology, banking, healthcare, and retail sectors within smart cities illustrate how the model could optimize both individual satisfaction and organizational productivity. © The Author(s) 2024.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths 22nd

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-...

引用

22nd International Workshop on Approximation and Online Algorithms, WAOA 2024

作者： Chitnis, Rajesh Thomas, Samuel Wirth, Anthony School of Computer Science The University of Birmingham Birmingham United Kingdom School of Computing and Information Systems The University of Melbourne Melbourne Australia School of Computer Science The University of Sydney Sydney Australia

ISBN: (纸本)9783031813955

Given a graph G=(V,E) and a set T={(si,ti):1≤i≤k}⊆V×V of k pairs, the k-Vertex-Disjoint-Paths (resp. k-Edge-Disjoint-Paths) problem asks to determine whether there exist k pairwise vertex-disjoint (resp. edge-disjoint) paths P1,P2,…,Pk in G such that, for each 1≤i≤k, Pi connects si to ti. Both the edge-disjoint and vertex-disjoint versions in undirected graphs are famously known to be FPT (parameterized by k) due to the Graph Minor Theory of Robertson and Seymour. Eilam-Tzoreff [DAM ‘98] introduced a variant, known as the k-Disjoint-Shortest-Paths problem, where each path is further required to be a shortest path connecting its pair. They showed that the k-Disjoint-Shortest-Paths problem is NP-complete on both directed and undirected graphs;this holds even if the graphs are planar and have unit edge lengths. We focus on four versions of the problem, corresponding to considering edge/vertex disjointness, and to considering directed/undirected graphs. Building on the reduction of Chitnis [SIDMA ’23] for k-Edge-Disjoint-Paths on planar DAGs, we obtain the following inapproximability lower bound for each of the four versions of k-Disjoint-Shortest-Paths on n-vertex graphs:Under the gap version of the Exponential Time Hypothesis (Gap-ETH), there exists a constant δ>0 such that for any constant 0δ·k time. Under the gap version of the Exponential Time Hypothesis (Gap-ETH), there exists a constant δ>0 such that for any constant 0δ·k time. We provide a single, unified framework to obtain lower bounds for each of the four versions of k-Disjoint-Shortest-Paths. We are able to further strengthen our results by restricting the structure of the input graphs in the lower bound constructions as follows:Directed: The inapproximability lower bound for edge-disjoint (resp. vertex-disjoint) paths holds even if the input graph is a planar (resp. 1-planar) DAG with max in-degree and max out-degree at most ***: The inapproximability lower bound for edge-disjoint (resp. vertex-dis

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

Cognition2Vocation: meta-learning via ConvNets and continuous transformers

引用

Neural computing and Applications 2024年第21期36卷 12935-12950页

作者： Kamran, Sara Hosseini, Saeid Esmailzadeh, Sayna Kangavari, Mohammad Reza Hua, Wen School of Computer Engineering Iran University of Science and Technology Tehran Iran Faculty of Computing and Information Technology Sohar University Sohar Oman Department of Computing The Hong Kong Polytechnic University Hong Kong

Estimating the suitability of individuals for a vocation via leveraging the knowledge within cognitive factors comes with numerous applications: employment resourcing, occupation counseling, and workload management. Accordingly, the enterprises aim to hire the most suitable person from a massive array of similar applicants, maximizing performance and minimizing the gap between strategic indicators and predefined targets. While cognitive factors signify the best-suited person from similarly skilled workers, inferring pertinent latent cues from noisy and growing social network contents is time-intensive. To tackle the challenges involved, we propose a framework that, on the one hand, extends influential features based on the correlations between cognitive cues and, on the other hand, leverages a novel continuous transformer to mitigate the overlapping and approximation issues in discrete modeling. Rather than relying on discrete patterns that may evolve frequently, we use continuous elements that include not only numerous aggregating components but also sense minor irregular fluctuations. In a hybrid manner, we fuse multiple base models to transfer a higher representation to the meta-learning unit, agglomerating outputs from gradient boosters and the ConvNets. The experimental results show that our proposed framework can outperform trending vocation estimation methods by 1.36% in F1-Score and approximately 1% in accuracy. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Knowledge management

来源：评论

学校读者我要写书评

暂无评论

A hybrid personality-aware recommendation system based on personality traits and types models

引用

Journal of Ambient Intelligence and Humanized computing 2023年第9期14卷 12775-12788页

作者： Dhelim, Sahraoui Chen, Liming Aung, Nyothiri Zhang, Wenyin Ning, Huansheng School of Computer Science University College Dublin Dublin Ireland School of Computing Ulster University Belfast United Kingdom School of Information Science and Engineering Linyi University Linyi China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China

Personality-aware recommendation systems have been proven to achieve high accuracy compared to conventional recommendation systems. In addition to that, personality-aware recommendation systems could help alleviate cold start and data sparsity problems by adding the user’s personality traits in the recommendation process. The majority of the literature works used Big-Five personality model to represent the user’s personality, this is due to the popularity of Big-Five model in the literature of psychology. However, from personality computing perspective, the choice of the most suitable personality model that satisfy the requirements of the recommendation application and the recommended content type still needs further investigation. In this paper, we study and compare four personality-aware recommendation systems based on different personality models, namely Big-Five traits model, Eysenck model and HEXACO model from the personality traits theory, and Myers–Briggs Type Indicator (MPTI) from the personality types theory. Furthermore, we propose a hybrid personality model for recommendation that takes advantage of the personality traits models, as well as the personality types models. Through extensive experiments on recommendation dataset, we prove the efficiency of the proposed model, especially in cold start settings. Our proposed hybrid personality-aware recommendation model improves the precision and recall in cold start settings by 21% and 18% respectively compared to the widely used Big-Five traits model. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Voice over Internet Protocol: Custom SIP Server with QoS Optimization for Real-Time Communication 3

Voice over Internet Protocol: Custom SIP Server with QoS Opt...

引用

3rd International Conference on Intelligent Data Communication Technologies and Internet of Things, IDCIoT 2025

作者： Dinesh Krishna, B.V. Yogendrasai, P. Rajeev, S. Rajagopal, Shinu M. Department of Computer Science and Engineering Amrita School of Computing Amrita Vishwa Vidyapeetham Bengaluru India

ISBN: (纸本)9798331527549

VoIP is a revolutionary technology for transmission of voice over internet protocol than from plain telephony systems. But current VoIP solutions have some important issues which are packet loss, latency, and jitter especially when the network is in motion. This work outlines the design, implementation and performance of a locally developed VoIP system which includes a SIP Server Node, Sender Node and a Receiver Node. The SIP Server Node was designed nearly from the ground up to handle session initiation, packet forwarding, and adaptive QoS control. Both Sender and Receiver Nodes had facilities to record, compress and playback audio. The system’s performance was evaluated in a LAN environment, achieving significant improvements in Quality of Service (QoS) metrics: achieving low latency under 150 ms, 95% packet recovery and achieving a good audio quality with the MOS of 4.2. Evaluating the obtained results, it can be concluded that the proposed system is efficient in handling the issues of the packet-switched network and providing high-quality real time voice communication. © 2025 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

Maximizing Throughput and Minimizing Latency: Evolutionary Algorithms for Optimizing Wireless Cellular Networks 3

Maximizing Throughput and Minimizing Latency: Evolutionary A...

引用

3rd International Conference on Intelligent Data Communication Technologies and Internet of Things, IDCIoT 2025

作者： Pechetti, Jyoshitha Yadav, Sneha Tarunya, G. Rajagopal, Shinu M. Department of Computer Science and Engineering Amrita School of Computing Amrita Vishwa Vidyapeetham Bengaluru India

ISBN: (纸本)9798331527549

In the rapidly evolving world of wireless cellular network, optimizing key parameters like data throughput and latency is of critical importance for ensuring high quality communication services. The proposed presents a novel approach to multi-objective optimization to enhance overall network performance using Genetic Algorithms (GA), Pareto, and Particle Swarm Optimization (PSO). By employing optimization algorithms, a balance is sought in terms of trade-off of other parameters while maximizing data throughput and minimizing latency. Simulation layers indicate the comparative study further solidifies the efficacy of the value of evolutionary algorithms in optimizing wireless networks to satisfy the growing needs of high speed and less latency services in today’s communication landscape. © 2025 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：