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

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Antwi-Boasiako, Emmanuel Zhou, Shijie Liao, Yongjian Danso, Ebenezer Kwaku School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Ghana Institute of Management and Public Administration Computer Science Department Accra Ghana China University for Development Studies Ghana

ISBN: (纸本)9781665494571

Privacy preservation in distributed deep learning (DDL) has received a lot of attention recently. One key approach to preserving privacy for DDL is the use of Homomorphic Encryption (HE), which allows computation on ciphertexts without decryption. Although current applications of HE provide some level of privacy to DDL, they are not post-quantum resistant and multi-key compliant. The use of same key by all participants could lead to collusion attacks and possible leakage of sensitive information from a participant's local dataset in the distributed deep learning setting. Furthermore, most of the privacy solutions provided for the DDL assume that all learning participants must be present before the start of the protocol. Hence, such solutions do not allow a new participant to benefit from the utility of the joint learning of other participants, for which it was not present. To address the above problems, we propose a new privacy preserving solution for DDL that uses an LWE-based Multi-key approach. Our proposed privacy preserving DDL solution is multi-key compliant, post-quantum resistant and has an additional property of allowing a new participant to benefit from the utility of an already trained collaborative deep learning system. We prove that our privacy-preserving distributed deep learning system is secured. We note that our proposed solution generally provides a robust privacy-preserving solution for the DDL and at the same time has great potential to reduce communication and computation costs associated with similar systems. © 2021 IEEE.

关键词： Deep learning Resistance Privacy Protocols Costs Collaboration Cryptography

来源：评论

学校读者我要写书评

暂无评论

PRAD: Unsupervised KPI Anomaly Detection by Joint Prediction and Reconstruction of Multivariate Time Series 19

PRAD: Unsupervised KPI Anomaly Detection by Joint Prediction...

引用

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

作者： Xiong, Zhiying Fan, Qilin Wang, Kai Li, Xiuhua Zhang, Xu Xiong, Qingyu Chongqing University School of Big Data and Software Engineering Chongqing China Chongqing University Chongqing Key Laboratory of Digital Cinema Art Theory and Technology Chongqing China Harbin Institute of Technology School of Computer Science and Technology Weihai China Harbin Institute of Technology Research Institute of Cyberspace Security Weihai China Haihe Laboratory of Information Technology Application Innovation Tianjin China University of Exeter Department of Computer Science Exeter United Kingdom

ISBN: (纸本)9798350346558

Detecting anomalies for key performance indicator (KPI) data is of paramount importance to ensure the quality and reliability of network services. However, building the anomaly detection system for KPI is challenging due to the scarcity of abnormal labels and highly dynamic or even unseen patterns. In this paper, we propose an unsupervised KPI anomaly detection framework named PRAD by jointly optimizing prediction-based and reconstruction-based modules. Specifically, PRAD employs two parallel graph attention networks (GATs) to learn metric-oriented and time-oriented relationships. A temporal convolutional attention network (TCAN) is used to capture complex long-term dependencies. Furthermore, to tackle the overfitting issue in the variational auto-encoder (VAE), PRAD designs a reconstruction-based module that combines VAE with a generative adversarial network (GAN). The experimental results on the two public datasets demonstrate that the proposed PRAD outperforms existing anomaly detection methods. © 2022 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Identification of Switched Gated Recurrent Neural Networks Using the EM Algorithm

Identification of Switched Gated Recurrent Neural Networks U...

引用

Data-driven Optimization of Complex Systems (DOCS), International Conference on

作者： Wentao Bai Suhang Gu Chao Yan Haoyu Zhang Chunli Jiang Fan Guo School of Computer Science and Engineering Changshu Institute of Technology Changshu China School of Electrical Engineering and Automation Changshu Institute of Technology Changshu China School of Information Science and Technology Hangzhou Normal University Hangzhou China School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing China School of Automation Nanjing Institute of Technology Nanjing China

In the domain of nonlinear hybrid dynamic system modeling, the effectiveness of switched autoregressive exogenous (SARX) systems may face certain restrictions. To address this issue, this paper presents an enhanced switched system framework. In this framework, all SARX subsystems are replaced with gated recurrent neural networks, aiming to overcome these limitations. Importantly, the proposed switched system does not rely on any prior assumptions about the knowledge of operating modes. Finally, a new identification method is proposed based on the expectation-maximization (EM) algorithm, and its effectiveness is validated through a simulation example.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High-Fidelity and High-Efficiency Talking Portrait Synthesis With Detail-Aware Neural Radiance Fields

引用

IEEE Transactions on Visualization and computer Graphics 2024年 PP卷 PP-PP页

作者： Wang, Muyu Zhao, Sanyuan Dong, Xingping Shen, Jianbing Wuhan University School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan430072 China Beijing Institute of Technology School of Computer Science Beijing China University of Macau State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science China

In this paper, we propose a novel rendering framework based on neural radiance fields (NeRF) named HH-NeRF that can generate high-resolution audio-driven talking portrait videos with high fidelity and fast rendering. Specifically, our framework includes a detail-aware NeRF module and an efficient conditional super-resolution module. Firstly, a detail-aware NeRF is proposed to efficiently generate a high-fidelity low-resolution talking head, by using the encoded volume density estimation and audio-eye-aware color calculation. This module can capture natural eye blinks and high-frequency details, and maintain a similar rendering time as previous fast methods. Secondly, we present an efficient conditional super-resolution module on the dynamic scene to directly generate the high-resolution portrait with our low-resolution head. Incorporated with the prior information, such as depth map and audio features, our new proposed efficient conditional super resolution module can adopt a lightweight network to efficiently generate realistic and distinct high-resolution videos. Extensive experiments demonstrate that our method can generate more distinct and fidelity talking portraits on high resolution (900 × 900) videos compared to state-of-the-art methods. Our code is available at https://***/muyuWang/HHNeRF. © 1995-2012 IEEE.

关键词： Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Classroom monitoring system based on facial expression recognition

Classroom monitoring system based on facial expression recog...

引用

International Symposium on Distributed Computing and Applications to Business, engineering and Science (DCABES)

作者： Boxuan Zhang Dandan Wei Qianying Zhang Wenyu Si Xiang Li Quanyin Zhu Faculty of Computer&Software Engineering Huaiyin Institute of Technology Huaian China

ISBN: (纸本)9781665428903

Facial expressions are important information that reflects human emotions. Recognizing dynamic expressions of students in class, 8 kinds of emotions are selected for application: positive emotions: “happy”; negative emotions: “disgust, Sadness, doubts, contempt, anger”; neutral emotion: “focus, surprise”. [1] In this design, the classroom performance scoring system in normal hours is split into four functions: wireless network list acquisition and verification, face recognition, emotion analysis, and scoring record storage. On this basis, SVM and Softmax are used. Facial expression recognition and a data storage database is designed to realize the function of an intelligent scoring system for classroom performance points. To solve this problem, an expression recognition method combining pyramid convolutional neural network and attention mechanism is proposed.

关键词： Support vector machines Emotion recognition Databases Face recognition Wireless networks Memory Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization 29

Improving Local Search for Pseudo Boolean Optimization by Fr...

引用

29th International Conference on Principles and Practice of Constraint Programming, CP 2023

作者： Zhou, Wenbo Zhao, Yujiao Wang, Yiyuan Cai, Shaowei Wang, Shimao Wang, Xinyu Yin, Minghao School of Information Science and Technology Northeast Normal University Changchun China Key Laboratory of Applied Statistics of MOE Northeast Normal University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Jilin University Changchun China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783959773003

Pseudo-Boolean optimization (PBO) is usually used to model combinatorial optimization problems, especially for some real-world applications. Despite its significant importance in both theory and applications, there are few works on using local search to solve PBO. This paper develops a novel local search framework for PBO, which has three main ideas. First, we design a two-level selection strategy to evaluate all candidate variables. Second, we propose a novel deep optimization strategy to disturb some search spaces. Third, a sampling flipping method is applied to help the algorithm jump out of local optimum. Experimental results show that the proposed algorithms outperform three state-of-the-art PBO algorithms on most instances. © Wenbo Zhou, Yujiao Zhao, Yiyuan Wang, Shaowei Cai, Shimao Wang, Xinyu Wang, and Minghao Yin.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Attack Tree: Assessing Cyberattack Risk Using Attack Tree and Fuzzy Logic 3

Fuzzy Attack Tree: Assessing Cyberattack Risk Using Attack T...

引用

3rd IEEE International Conference on ICT in Business Industry and Government, ICTBIG 2023

作者： Naik, Nitin Jenkins, Paul Grace, Paul Naik, Dishita Song, Jingping Prajapat, Shaligram Mishra, Durgesh Yang, Longzhi Boongoen, Tossapon Iam-On, Natthakan School of Informatics and Digital Engineering Aston University United Kingdom Cardiff School of Technologies Cardiff Metropolitan University United Kingdom Birmingham City University United Kingdom Software College Northeastern University China International Institute of Professional Studies Devi Ahilya University India School of Computer Science & Information Technology Symbiosis University of Applied Sciences India Northumbria University Department of Computer and Information Sciences United Kingdom Aberystwyth University Department of Computer Science United Kingdom

ISBN: (纸本)9798350343274

Organisations and users have been experiencing significant rises in cyberattacks and their severity, which means that they require a greater awareness and understanding of the anatomy of cyberattacks, to prevent and mitigate their effects. In analysing cyberattacks, there are a number of different approaches that may be used to assess their potential risks and effects. However, these are utilised in specific types of cyberattacks and their analysis, which means they cannot be applied in every situation or cyberattack. Moreover, several other factors may influence the decision to use these approaches, such as cost, complexity, skills and adaptability. As a result, continuous research to design and enhance these approaches is undertaken to produce a generic, cost-effective, easy and adaptable approach. This paper presents one such approach to assess the risk of cyberattacks utilising an attack tree and fuzzy logic. An attack tree is a systematic and illustrative method for describing an attack on a system and analysing its taxonomy and other aspects. Subsequently, the probability and risk of each leaf node in the attack tree are calculated using the proposed formulas. Finally, fuzzy logic enables decision making based on imprecise data and heuristics to obtain the overall risk of attack. This proposed approach comprises systematic steps to accomplish an assessment of any cyberattack and its associated risks in an uncomplicated and effective manner, enabling its prevention and mitigation to be determined. The paper illustrates an application of the proposed approach to assess the risk of an information theft attack on an organisation, which can then be utilised to assess the risk of other cyberattacks. © 2023 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Learning Granularity Representation for Temporal Knowledge Graph Completion

arXiv

引用

arXiv 2024年

作者： Zhang, Jinchuan Wan, Tianqi Mu, Chong Lu, Guangxi Tian, Ling School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Beijing Institute of Aerospace Measurement and Testing Technology Beijing China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China KASH Institute of Electronics and Information Industry Kashi China

Temporal Knowledge Graphs (TKGs) incorporate temporal information to reflect the dynamic structural knowledge and evolutionary patterns of real-world facts. Nevertheless, TKGs are still limited in downstream applications due to the problem of incompleteness. Consequently, TKG completion (also known as link prediction) has been widely studied, with recent research focusing on incorporating independent embeddings of time or combining them with entities and relations to form temporal representations. However, most existing methods overlook the impact of history from a multi-granularity aspect. The inherent semantics of human-defined temporal granularities, such as ordinal dates, reveal general patterns to which facts typically adhere. To counter this limitation, this paper proposes Learning Granularity Representation (termed LGRe) for TKG completion. It comprises two main components: Granularity Representation Learning (GRL) and Adaptive Granularity Balancing (AGB). Specifically, GRL employs time-specific multi-layer convolutional neural networks to capture interactions between entities and relations at different granularities. After that, AGB generates adaptive weights for these embeddings according to temporal semantics, resulting in expressive representations of predictions. Moreover, to reflect similar semantics of adjacent timestamps, a temporal loss function is introduced. Extensive experimental results on four event benchmarks demonstrate the effectiveness of LGRe in learning time-related representations. To ensure reproducibility, our code is available at https://***/KcAcoZhang/LGRe. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Support Vector Machine Based Automatic Classification Method for IoT Big Data Features

引用

Journal of computers (Taiwan) 2023年第5期34卷 15-27页

作者： Xu, Yong-Hua School of Computer Engineering Jinling Institute of Technology Nanjing211169 China Jiangsu Key Laboratory of Data Science and Smart Software Jinling Institute of Technology Nanjing211169 China

As China’s information technology development shifts from a single high-speed growth stage to a multidimensional high-quality development stage, the Internet of Things (IoT) enters all aspects of life and becomes more and more popular. The demand for IoT big data information analysis and processing is increasing, and the important role of feature automatic classification methods becomes increasingly prominent. This research proposes SPO-SVM and WSPO-SVM models based on support vector machine for smart home environment monitoring data under the big data of Internet of Things, and then optimizes them with particle swarm optimization algorithm and adaptive method. Finally, the data set is selected for comparative experimental analysis of each optimization algorithm model. The experimental results show that the optimized WSPO-SVM model has less total misclassification and single class misclassification compared with other algorithms under Wine dataset. In cross-validation, both its classification accuracy performance outperformed other algorithms. Under 10 sets of smart home environment monitoring data sets, the WSPO-SVM algorithm model achieves 100% accuracy in 6 out of 10 test data sets, with an average accuracy of 97.67%, which is about 9% higher than the ordinary SVM algorithm model and about 15% higher than other feature classification algorithms. The experimental results prove that the WSPO-SVM algorithm can complete the feature classification work in the IoT big data environment, which meets the expectation. © 2023 computer Society of the Republic of China. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

ADEPT 2022 Workshop: A Summary of Strengths and Weaknesses of the AADL Ecosystem

Ada User Journal

引用

Ada User Journal 2023年第2期44卷 125-128页

作者： Singhoff, Frank Hugues, Jérôme Tran, Hai Nam Bardaro, Gianluca Blouin, Dominique Bozzano, Marco Denzler, Patrick Dissaux, Pierre Senn, Eric Xu, Xiong Yang, Zhibin University of Brest Lab-STICC UMR CNRS 6285 Brest France Software Engineering Institute Carnegie Mellon University United States Politecnico di Milano Piazza Leonardo Da Vinci 32 Milano Italy LTCI Telecom Paris Institut Polytechnique de Paris Palaiseau France Fondazione Bruno Kessler Via Sommarive 18 Trento38123 Italy Institute of Computer Engineering TU Wien Vienna Austria Ellidiss Technologies 24 quai de la douane Brest29200 France Lab-STICC Université de Bretagne Sud Lorient France SKLCS Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China

The Architecture Analysis and Design Language (AADL) is a SAE Standard for the modeling of both the hardware and the software of embedded systems. The AADL standard is now mature and is today employed by numerous stakeholders in the domain of critical embedded real-time systems to address a large set of concerns: performances (latency, schedulability), safety, or security, … The ADEPT workshop aims to present and report on current projects in the field of design, implementation, and verification of critical systems where AADL is a first-citizen technology. This article is a summary of the ADEPT 2022 workshop. © 2023, Ada-Europe. All rights reserved.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：