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

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Liu, Bowen Dou, Wanchun Zhou, Xiaokang Zhang, Xuyun Qi, Lianyong Dai, Fei Chen, Chaochao Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Shiga University Faculty of Data Science Hikone Japan Macquarie University Department of Computing Sydney Australia College of Computer and Software Qingdao China Southwest Forestry University College of Big Data and Intelligent Engineering Kunming China Zhejiang University College of Computer Science and Technology Hangzhou China

ISBN: (纸本)9798350346558

Edge computing is a novel computing paradigm that offers kinds of resources at the network edge. In edge computing, terminal users are connected to edge servers via the wireless network and there are various channels in each wireless link. These wireless channels are limited resource while different channel has different cost and service ability. The dynamic changes of users' status make it harder to find an appropriate method to satisfy the BPM requirements of channel deployment. With this observation, it is a tricky challenge to make a trade-off between the system cost(rental price) and the service ability(number of users). In view of this challenge, an intelligent resource scheduling method, named EdgeIRS, is proposed in this paper. In the technical sense, the EdgeIRS method can accommodate most users at the edge with a minimum cost of deploying channel resources in an online way. Its performance is analyzed theoretically and the experiments verify the superiority of the method. © 2022 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Faster Edge Coloring by Partition Sieving

arXiv

引用

arXiv 2025年

作者： Akmal, Shyan Koana, Tomohiro INSAIT Sofia University "St. Kliment Ohridski" Bulgaria Technische Universität Berlin Faculty IV Institute of Software Engineering and Theoretical Computer Science Algorithmics and Computational Complexity Germany

In the Edge Coloring problem, we are given an undirected graph G with n vertices and m edges, and are tasked with finding the smallest positive integer k so that the edges of G can be assigned k colors in such a way that no two edges incident to the same vertex are assigned the same color. Edge Coloring is a classic NP-hard problem, and so significant research has gone into designing fast exponential-time algorithms for solving Edge Coloring and its variants exactly. Prior work showed that Edge Coloring can be solved in 2m poly(n) time and polynomial space, and in graphs with average degree d in 2(1−Εd)m poly(n) time and exponential space, where Εd = (1/d)Θ(d3). We present an algorithm that solves Edge Coloring in 2m−3n/5 poly(n) time and polynomial space. Our result is the first algorithm for this problem which simultaneously runs in faster than 2m poly(m) time and uses only polynomial space. In graphs of average degree d, our algorithm runs in 2(1−6/(5d))m poly(n) time, which has far better dependence in d than previous results. We also consider a generalization of Edge Coloring called List Edge Coloring, where each edge e in the input graph comes with a list Le ⊆ {1, . . ., k} of colors, and we must determine whether we can assign each edge a color from its list so that no two edges incident to the same vertex receive the same color. We show that this problem can be solved in 2(1−6/(5k))m poly(n) time and polynomial space. The previous best algorithm for List Edge Coloring took 2m poly(n) time and space. Our algorithms are algebraic, and work by constructing a special polynomial P based off the input graph that contains a multilinear monomial (i.e., a monomial where every variable has degree at most one) if and only if the answer to the List Edge Coloring problem on the input graph is YES. We then solve the problem by detecting multilinear monomials in P. Previous work also employed such monomial detection techniques to solve Edge Coloring. We obtain faster algor

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

Novel Approach for Enhancing Mental Well-Being Through Machine Learning Techniques

Novel Approach for Enhancing Mental Well-Being Through Machi...

引用

Advancements in Computing (ICAC), International Conference on

作者： O.V.D.E Roshani H.M.K.J.J Ayuwardhana P.H.M.S Rodrigo R.U Hewageegana Harinda Fernando Dilshan I. de Silva Department of Computer Science and Software Engineering Faculty of Computing Sri Lanka Institute of Information Technology Malabe Sri Lanka Department of Computer Systems Engineering Faculty of Computing Sri Lanka Institute of Information Technology Malabe Sri Lanka

Frequently, individuals undergo specific episodes of mental health challenges throughout their lifetime. But the COVID pandemic has triggered a surge in mental health disorders arising from isolation, monotonous routines, demanding workloads, financial disparities, and disruptions to daily schedules. Furthermore, the global pandemic has induced constant anxiety and stress. Beyond the pandemic, the competition and intense pressure of the modern world impact mental health. Access to advanced mental health solutions and the necessary familiarity remain limited for most of the population. Given the integration of technology into daily life, diverse remedies, including mobile and web applications, have emerged to tackle the escalating challenge of mental health disorders. This study proposes an accessible and cost-effective approach that employs machine learning to detect stress levels and discern user emotions from journal entries and facial expressions while integrating self-journaling, video recommendations, and visual content generation to stimulate positive emotions and relieve stress.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Properties of Nonlinear Power System Models that are Symmetrically Configured in the Narrow Sense

Properties of Nonlinear Power System Models that are Symmetr...

引用

IEEE General Meeting Power& Energy Society

作者： Elior Segev Ron Ofir Yoash Levron Juri Belikov Faculty of Electrical & Computer Engineering Technion—Israel Institute of Technology Haifa Israel Department of Software Science Tallinn University of Technology Tallinn Estonia

Symmetry is a fundamental property of three-phase circuits and is widely used in the analysis of large-scale power systems. However, when the system is nonlinear or time-varying, classical symmetry generally does not provide sufficient information. Therefore, in this paper, we explore properties of three-phase circuits with dynamic models that are “simple” in some stronger sense. We define a circuit to be simple if its state and input matrices in the dq0 domain are constant, that is, independent of the reference angle, and show that this property leads to dynamic models which are linear and time-invariant, or at least suitable for low-complexity numerical analysis. We formally define circuits with this property to be Symmetrically Configured in the Narrow Sense (SCNS), and explore their properties. We show, for instance, that SCNS circuits must be symmetrically configured and that their state-space models have several interesting properties and structures. The overall aim is to develop a small toolbox, which may help identify and analyze SCNS circuits in the context of large-scale power systems. We believe this may contribute to the understanding of dynamic phenomena in large-scale systems which are too complex for direct simulation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Absolute Pose from One or Two Scaled and Oriented Features

Absolute Pose from One or Two Scaled and Oriented Features

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Jonathan Ventura Zuzana Kukelova Torsten Sattler Dániel Baráth Department of Computer Science & Software Engineering Cal Poly San Luis Obispo Faculty of Electrical Engineering Visual Recognition Group Czech Technical University in Prague Czech Institute of Informatics Robotics and Cybernetics Czech Technical University in Prague Department of Computer Science Computer Vision and Geometry Group ETH Zürich

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Keypoints used for image matching often include an estimate of the feature scale and orientation. While recent work has demonstrated the advantages of using feature scales and orientations for relative pose estimation, relatively little work has considered their use for absolute pose estimation. We introduce minimal solutions for absolute pose from two oriented feature correspondences in the general case, or one scaled and oriented correspondence given a known vertical direction. Nowadays, assuming a known direction is not particularly restrictive as modern consumer devices, such as smartphones or drones, are equipped with Inertial Measurement Units (IMU) that provide the gravity direction by default. Compared to traditional absolute pose methods requiring three point correspondences, our solvers need a smaller minimal sample, reducing the cost and complexity of robust estimation. Evaluations on large-scale and public real datasets demonstrate the advantage of our methods for fast and accurate localization in challenging conditions. Code is available at https://***/danini/absolute-pose-from-oriented-and-sealed-features.

关键词： Location awareness Accuracy Simultaneous localization and mapping Measurement units Pose estimation Noise Inertial navigation

来源：评论

学校读者我要写书评

暂无评论

Federated transfer learning for distributed drought stage prediction

引用

Discover Artificial Intelligence 2025年第1期5卷 1-13页

作者： Raza, Muhammad Owais Umar, Aqsa Rasheed, Jawad Asuroglu, Tunc Alsubai, Shtwai Department of Computer Engineering Istanbul Sabahattin Zaim University Istanbul34303 Turkey Department of Computer Science Sindh Madressatul Islam University Karachi74000 Pakistan Department of Software Engineering Istanbul Nisantasi University Istanbul34398 Turkey Applied Science Research Center Applied Science Private University Amman Jordan Faculty of Medicine and Health Technology Tampere University Tampere33720 Finland VTT Technical Research Centre of Finland Tampere33720 Finland Department of Computer Science College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al-Kharj11942 Saudi Arabia

Due to the uncertain nature of drought, it is one of the most menacing natural disasters. Drought modeling (Prediction, Detection, Forecasting, and Stage Prediction) is very essential for efficient policy making. But one of the key problems with drought modeling is the limited availability of centralized datasets. To address this problem, we are a novel proposing federated learning based transfer learning models for the prediction of drought stages. In this study, satellite image dataset was collected from the Tharparkar district (prone to drought) of Pakistan. We trained the dataset using traditional and federated learning approaches, comparing centralized ML models, pre-trained models, and their respective federated learning models (FL-ResNet, FL-DenseNet, FL-MobileNet). The development of these models is the novel aspect of the study specifically for the use case of drought stage prediction. Based on the final evaluation, FL-MobileNet achieved 82% precision while baseline MobileNet scored 68%. The results show the effectiveness of novelty (federated learning), that our proposed framework improves the performance of the drought stage classification task. © The Author(s) 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

MODEL CHECKING FOR MULTI-AGENT SYSTEMS MODELED BY EPISTEMIC PROCESS CALCULUS

arXiv

引用

arXiv 2025年

作者： Yu, Qixian Cao, Zining Hui, Zong Zhou, Yuan College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China Ministry Key Laboratory for Safety-Critical Software Development and Verification Nanjing211106 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing210023 China Faculty of Computer and Software Engineering Huaiyin Institute Of Technology Huaian223001 China

This paper presents a comprehensive framework for modeling and verifying multi-agent systems. The paper introduce an Epistemic Process Calculus for multi-agent systems, which formalizes the syntax and semantics to capture the essential features of agent behavior interactions and epistemic states. Building upon this calculus, we propose ATLE, an extension of Alternating-time Temporal Logic incorporating epistemic operators to express complex properties related to agent epistemic state. To verify ATLE specifications, this paper presents a model checking algorithm that systematically explores the state space of a multi-agent system and evaluates the satisfaction of the specified properties. Finally, a case study is given to demonstrate the method. © 2025, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Quantum Searchable Encryption for Cloud Data Based on Full-Blind Quantum Computation

arXiv

引用

arXiv 2023年

作者： Liu, Wenjie Xu, Yinsong Liu, Wen Wang, Haibin Lei, Zhibin Engineering Research Center of Digital Forensics Ministry of Education Nanjing210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China School of Computer Science and Cybersecurity Communication University of China Beijing100024 China Science Park East Avenue 999077 Hong Kong

Searchable encryption (SE) is a positive way to protect users sensitive data in cloud computing setting, while preserving search ability on the server side. SE allows the server to search encrypted data without leaking information about the plaintext data. In this paper, a multi-client universal circuit-based full-blind quantum computation (FBQC) model is proposed. In order to meet the requirements of multi-client accessing or computing encrypted cloud data, all clients with limited quantum ability outsource the key generation to a trusted key center and upload their encrypted data to the data center. Considering the feasibility of physical implementation, all quantum gates in the circuit are replaced with the combination of π/8 rotation operator set {Rz(π/4), Ry(π/4), CRz(π/4), CRy(π/4), CCRz(π/4), CCRy(π/4)}. In addition, the data center is only allowed to perform one π/8 rotation operator each time, but does not know the structure of the circuit (i.e., quantum computation), so it can guarantee the blindness of computation. Then, through combining this multi-client FBQC model and Grover searching algorithm, we continue to propose a quantum searchable encryption scheme for cloud data. It solves the problem of multi-client access mode under searchable encryption in the cloud environment, and has the ability to resist against some quantum attacks. To better demonstrate our scheme, an example of our scheme to search on encrypted 2-qubit state is given in detail. Furthermore, the security of our scheme is analysed from two aspects: external attacks and internal attacks, and the result indicates that it can resist against such kinds of attacks and also guarantee the blindness of data and computation. © 2023, CC BY.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

The Power of Bamboo: On the Post-Compromise Security for Searchable Symmetric Encryption 30

The Power of Bamboo: On the Post-Compromise Security for Sea...

引用

30th Annual Network and Distributed System Security Symposium, NDSS 2023

作者： Chen, Tianyang Xu, Peng Picek, Stjepan Luo, Bo Susilo, Willy Jin, Hai Liang, Kaitai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China Cluster and Grid Computing Lab School of Computer Science and Technology China Huazhong University of Science and Technology Wuhan430074 China Digital Security Group Radboud University Nijmegen Netherlands Department of EECS Institute of Information Sciences The University of Kansas LawrenceKS United States Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 CD Netherlands

ISBN: (纸本)1891562835

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user’s secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client’s secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance. © 2023 30th Annual Network and Distributed System Security Symposium, NDSS 2023. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Medical Expert System to Diagnose the Most Common Psychiatric Diseases 21

Medical Expert System to Diagnose the Most Common Psychiatri...

引用

7th International Conference on engineering and MIS, ICEMIS 2021

作者： Alsagheer, Eman A. Rajab, Hamzah A. Elnajar, Khadiga M.Y. Department of Computer Science Faculty of Information Technology University of Benghazi Benghazi Libya Department of Software Engineering Faculty of Information Technology University of Benghazi Benghazi Libya

ISBN: (纸本)9781450390446

Expert Systems are programs that employ artificial intelligence and mimic the performance of human experts in a certain field by gathering and capturing expert information. In this paper, we present a rule-based expert system to provide the diagnosis for the most common psychiatric diseases to facilitate the diagnosis process. This system diagnoses four types of psychiatric diseases Anxiety Disorder (generalized anxiety, panic disorder, OCD, and phobic disorder), Stress-related disorder, Depression, and Schizophrenia using the International Classification of Diseases 10th Revision. The knowledge used in this system is acquired from domain experts, and relevant medical books and documents to capture knowledge that is valid as much as possible. Then, the acquired knowledge is demonstrated using a diagnostic chart, and decision table that represents the signs and symptoms involved in the diagnosis. A rule-based expert system and production rules that represent the domain knowledge are built using SWI-PROLOG Editor. The system is based on backward chaining which starts with possible goals and attempts to collect information that confirms it. The testing result shows the average accuracy of the system register 80% in diagnosing patients with psychiatric diseases. © 2021 ACM.

关键词： Expert systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：