首页 > 最新文献

2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)最新文献

英文 中文
Emotion Recognition Using Representative Geometric Feature Mask Based on CNN 基于CNN的代表性几何特征掩模情感识别
Shaosong Lin, Yong Yue, Xiaohui Zhu
Emotion recognition is a growing area of facial recognition, to detect the basic emotion state of a person and then operate further analysis. For practical applications, high speed and accuracy are required as an efficient and precise system. To this end, the paper proposes an effective emotion recognition system using a representative geometric feature mask for feature extraction and a CNN model for classification. Compared with traditional emotion recognition systems, which usually extract facial key features and then convert them into mathematical information variables by equations, the system implemented in this paper extracts necessary features in facial expression through landmarks, and operates a further extraction by a transformation that converts features into a pure geometric feature mask to represent a simplified human face. Then, the mask that can be used to express the human facial emotion with fewer noise features, is input into a deep learning training CNN (Convolutional Neural Network) model. The improvement of this work is that the system combines pure geometric method to extract facial features with CNN algorithm properties in image processing, where local connectivity and shared parameter properties were fully used in further geometric feature extraction. Finally, the system achieves high accuracy and low time costs with KDEF (Karolinska Directed Emotional Faces) and CK+ (Cohn-Kanade AU-Coded Expression Database).
情绪识别是人脸识别的一个新兴领域,通过检测人的基本情绪状态,然后进行进一步的分析。在实际应用中,作为一个高效、精确的系统,需要高的速度和精度。为此,本文提出了一种有效的情感识别系统,使用具有代表性的几何特征掩模进行特征提取,使用CNN模型进行分类。传统的情感识别系统通常是提取面部关键特征,然后通过方程将其转化为数学信息变量,与之相比,本文实现的系统通过地标提取面部表情中必要的特征,并通过转换将特征转化为纯粹的几何特征掩模来表示简化后的人脸进行进一步的提取。然后,将能够用较少噪声特征来表达人类面部情绪的掩模输入深度学习训练CNN(卷积神经网络)模型。本工作的改进之处在于,系统将纯几何方法提取人脸特征与图像处理中的CNN算法属性相结合,充分利用局部连通性和共享参数属性进行进一步的几何特征提取。最后,系统通过KDEF (Karolinska Directed Emotional Faces)和CK+ (Cohn-Kanade AU-Coded Expression Database)实现了高精度和低时间成本。
{"title":"Emotion Recognition Using Representative Geometric Feature Mask Based on CNN","authors":"Shaosong Lin, Yong Yue, Xiaohui Zhu","doi":"10.1109/ICISCAE52414.2021.9590797","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590797","url":null,"abstract":"Emotion recognition is a growing area of facial recognition, to detect the basic emotion state of a person and then operate further analysis. For practical applications, high speed and accuracy are required as an efficient and precise system. To this end, the paper proposes an effective emotion recognition system using a representative geometric feature mask for feature extraction and a CNN model for classification. Compared with traditional emotion recognition systems, which usually extract facial key features and then convert them into mathematical information variables by equations, the system implemented in this paper extracts necessary features in facial expression through landmarks, and operates a further extraction by a transformation that converts features into a pure geometric feature mask to represent a simplified human face. Then, the mask that can be used to express the human facial emotion with fewer noise features, is input into a deep learning training CNN (Convolutional Neural Network) model. The improvement of this work is that the system combines pure geometric method to extract facial features with CNN algorithm properties in image processing, where local connectivity and shared parameter properties were fully used in further geometric feature extraction. Finally, the system achieves high accuracy and low time costs with KDEF (Karolinska Directed Emotional Faces) and CK+ (Cohn-Kanade AU-Coded Expression Database).","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124732497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Keyword-fusion Pointer-Generator Network for Policy Text Title Summarization 关键词融合指针生成器网络策略文本标题摘要
Ziyin Gu, Li Chen, Qing-jin Zhu, Lingbo Li, Zelin Zhang, Xin Zhou
In this paper, we study the electricity price policy text title summarization problem. Comparing with conventional summarization tasks, title summarization of policy text has an extra characteristic. Policy texts always contain many professional keywords. In order to retain the main information in title summarization as much as possible, we propose keyword-fusion pointer-generator network with additional consideration of keywords of policy text. We incorporate keywords information from the original policy texts into our model by a new attention mechanism called keyword-fusion attention mechanism so that keywords can be generated in the title. What's more, our keyword-fusion pointer-generator network contains a more useful coverage vector using exponentially weighted averages method in order to solve the problem of repetition. Experimental results show that our model outperforms the other baselines.
本文主要研究电价政策文本标题的摘要问题。与传统的摘要任务相比,政策文本的标题摘要具有额外的特点。政策文本总是包含许多专业关键词。为了尽可能保留标题摘要中的主要信息,我们提出了关键词融合指针生成器网络,并考虑了政策文本的关键词。我们通过一种新的关注机制——关键词融合关注机制,将原政策文本中的关键词信息整合到我们的模型中,从而在标题中生成关键词。此外,我们的关键字融合指针生成器网络使用指数加权平均方法包含了一个更有用的覆盖向量,以解决重复问题。实验结果表明,该模型的性能优于其他基线。
{"title":"Keyword-fusion Pointer-Generator Network for Policy Text Title Summarization","authors":"Ziyin Gu, Li Chen, Qing-jin Zhu, Lingbo Li, Zelin Zhang, Xin Zhou","doi":"10.1109/ICISCAE52414.2021.9590673","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590673","url":null,"abstract":"In this paper, we study the electricity price policy text title summarization problem. Comparing with conventional summarization tasks, title summarization of policy text has an extra characteristic. Policy texts always contain many professional keywords. In order to retain the main information in title summarization as much as possible, we propose keyword-fusion pointer-generator network with additional consideration of keywords of policy text. We incorporate keywords information from the original policy texts into our model by a new attention mechanism called keyword-fusion attention mechanism so that keywords can be generated in the title. What's more, our keyword-fusion pointer-generator network contains a more useful coverage vector using exponentially weighted averages method in order to solve the problem of repetition. Experimental results show that our model outperforms the other baselines.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"18 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120902163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hierarchical Affinity Learning for Training Evaluation 训练评估的层次亲和学习
Biao Mei
Appropriate affinity/similarity measures always play a critical role in data mining. The complex interactions among multiple features and personality of each individual object makes it still a challenging problem. Existing methods simply consider the relevance in a feature-pair manner, and they treat the features for each object equally without considering the personality. In this paper, we propose a hierarchical affinity learning method on categorical data with unsupervised personalized feature weighting, called HAL. HAL captures the interactions by exploring the affinities among objects, features and values, which carry intrinsic data characteristics, via hierarchical affinity learning to handle this complex data. The inferred affinities between objects and features can be treated as the personalized feature weights which is used to refine the initial affinity matrix. The learned affinities between objects obtained by reinforcement affinity learning can be exploited for clustering. Experimental results on 16 real world datasets with diverse characteristics from 6 different domains confirm the superiority of our method. Compared to the state-of-the-art measures, it averagely achieves 8.8% improvement in terms of F-score.
适当的亲和度/相似度度量在数据挖掘中总是起着关键作用。单个对象的多个特征和个性之间复杂的相互作用使其仍然是一个具有挑战性的问题。现有的方法只是简单地以特征对的方式考虑相关性,对每个对象的特征都一视同仁,而不考虑其个性。在本文中,我们提出了一种基于无监督个性化特征加权的分类数据分层亲和学习方法,称为HAL。HAL通过探索带有内在数据特征的对象、特征和值之间的亲和力来捕获交互,通过分层亲和力学习来处理这些复杂的数据。对象与特征之间的推断亲和力可以作为个性化的特征权重,用于细化初始亲和力矩阵。通过强化亲和学习获得的对象之间的亲和关系可以用于聚类。在来自6个不同领域的16个具有不同特征的真实数据集上的实验结果证实了我们方法的优越性。与最先进的措施相比,它的f分数平均提高了8.8%。
{"title":"Hierarchical Affinity Learning for Training Evaluation","authors":"Biao Mei","doi":"10.1109/ICISCAE52414.2021.9590713","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590713","url":null,"abstract":"Appropriate affinity/similarity measures always play a critical role in data mining. The complex interactions among multiple features and personality of each individual object makes it still a challenging problem. Existing methods simply consider the relevance in a feature-pair manner, and they treat the features for each object equally without considering the personality. In this paper, we propose a hierarchical affinity learning method on categorical data with unsupervised personalized feature weighting, called HAL. HAL captures the interactions by exploring the affinities among objects, features and values, which carry intrinsic data characteristics, via hierarchical affinity learning to handle this complex data. The inferred affinities between objects and features can be treated as the personalized feature weights which is used to refine the initial affinity matrix. The learned affinities between objects obtained by reinforcement affinity learning can be exploited for clustering. Experimental results on 16 real world datasets with diverse characteristics from 6 different domains confirm the superiority of our method. Compared to the state-of-the-art measures, it averagely achieves 8.8% improvement in terms of F-score.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121165448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep Self-Supervised Learning for Oracle Bone Inscriptions Features Representation 甲骨文特征表示的深度自监督学习
Bingxin Du, Guoying Liu, Wenying Ge
In this paper, we design a two-branch deep learning framework to tackle the problem of self-supervised representation learning for Oracle Bone Inscriptions (OBIs). This problem is very complicated in that, unlike natural-photos, OBI images present more abstract content and suffer from different drawing styles, resulting in the failure of many existing self-supervised learning methods to describe them accurately. The core idea of our framework is that we design two OBI-specific pretext tasks, i.e. rotation and deformation. These two kinds of pretext tasks can provide strong supervision signals for OBI features learning. And we perform OBI recognition downstream task to evaluate our self-supervised learned features. Experimental results show that, under the same dataset, our proposed method outperforms jigsaw and matting based self-supervised learning methods.
在本文中,我们设计了一个双分支深度学习框架来解决甲骨文(OBIs)的自监督表示学习问题。这个问题非常复杂,因为与自然照片不同,OBI图像呈现的内容更加抽象,并且存在不同的绘画风格,导致许多现有的自监督学习方法无法准确描述OBI图像。我们的框架的核心思想是我们设计了两个obi特定的借口任务,即旋转和变形。这两种借口任务可以为OBI特征学习提供较强的监督信号。我们通过OBI识别下游任务来评估我们的自监督学习特征。实验结果表明,在相同的数据集下,我们提出的方法优于基于拼图和抠图的自监督学习方法。
{"title":"Deep Self-Supervised Learning for Oracle Bone Inscriptions Features Representation","authors":"Bingxin Du, Guoying Liu, Wenying Ge","doi":"10.1109/ICISCAE52414.2021.9590642","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590642","url":null,"abstract":"In this paper, we design a two-branch deep learning framework to tackle the problem of self-supervised representation learning for Oracle Bone Inscriptions (OBIs). This problem is very complicated in that, unlike natural-photos, OBI images present more abstract content and suffer from different drawing styles, resulting in the failure of many existing self-supervised learning methods to describe them accurately. The core idea of our framework is that we design two OBI-specific pretext tasks, i.e. rotation and deformation. These two kinds of pretext tasks can provide strong supervision signals for OBI features learning. And we perform OBI recognition downstream task to evaluate our self-supervised learned features. Experimental results show that, under the same dataset, our proposed method outperforms jigsaw and matting based self-supervised learning methods.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114536254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on Variable Universe Fuzzy Control of Double-Loop Mode Buck-Boost Converter Based on Matlab 基于Matlab的双环模式Buck-Boost变换器变域模糊控制研究
Haoshen Li, H. Xu, Ruihan Jiang, Linlin Zhao
Aiming at the situation that traditional PI controllers cannot flexibly change their parameters when the converter operating point changes, this paper designs a double-loop mode variable universe fuzzy PI controller based on the combination of variable universe thinking and fuzzy PI, and establishes The small signal model of the buck-boost converter is proposed, and the transfer function of the buck-boost converter is proposed. Finally, Matlab is used for simulation experiments. The experimental results show that, compared with the traditional PI controller, the dual-loop mode variable domain control method has better stability, higher control accuracy, and higher resistance under static operation, load resistance disturbance and input voltage disturbance. The interference ability and adaptive ability are strong, which can better improve the dynamic characteristics of the system and effectively improve the stability of the system.
针对传统PI控制器在变换器工作点变化时不能灵活改变参数的情况,将变域思维与模糊PI相结合,设计了一种双环模变域模糊PI控制器,并建立了buck-boost变换器的小信号模型,提出了buck-boost变换器的传递函数。最后利用Matlab进行仿真实验。实验结果表明,与传统的PI控制器相比,双环模变域控制方法在静态运行、负载电阻干扰和输入电压干扰下具有更好的稳定性和更高的控制精度,并且具有更高的电阻。抗干扰能力和自适应能力强,能较好地改善系统的动态特性,有效提高系统的稳定性。
{"title":"Research on Variable Universe Fuzzy Control of Double-Loop Mode Buck-Boost Converter Based on Matlab","authors":"Haoshen Li, H. Xu, Ruihan Jiang, Linlin Zhao","doi":"10.1109/ICISCAE52414.2021.9590675","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590675","url":null,"abstract":"Aiming at the situation that traditional PI controllers cannot flexibly change their parameters when the converter operating point changes, this paper designs a double-loop mode variable universe fuzzy PI controller based on the combination of variable universe thinking and fuzzy PI, and establishes The small signal model of the buck-boost converter is proposed, and the transfer function of the buck-boost converter is proposed. Finally, Matlab is used for simulation experiments. The experimental results show that, compared with the traditional PI controller, the dual-loop mode variable domain control method has better stability, higher control accuracy, and higher resistance under static operation, load resistance disturbance and input voltage disturbance. The interference ability and adaptive ability are strong, which can better improve the dynamic characteristics of the system and effectively improve the stability of the system.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133699452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A multi-objective fog computing task scheduling strategy based on ant colony algorithm 基于蚁群算法的多目标雾计算任务调度策略
Jingjun Gu, Jiadi Mo, P. Li, Yue Zhang, Wen Wang
Fog computing can effectively reduce latency and improve resource utilization by extending cloud services to the edge of the network. However, due to the wide variety of fog equipment and different computing capabilities, the theoretical knowledge and practical work related to fog computing task scheduling are insufficient. When scheduling tasks, factors such as cost of computing resources, power costs, and network cost were not considered comprehensively. Therefore, we propose a multi-objective fog computing task scheduling algorithm based on improved ant colony algorithm, which optimize the ant colony algorithm to make it more suitable for the characteristics of the fog node, use time and cost (TAC) to comprehensively consider the cost of the node, and introduce the critical factor in task allocation to improve the convergence speed of the algorithm. Different simulation experiments show that the efficiency of the improved ant colony algorithm is enhanced in processing time, cost, and load balance.
雾计算通过将云服务扩展到网络边缘,可以有效降低延迟,提高资源利用率。然而,由于雾设备种类繁多,计算能力不同,雾计算任务调度相关的理论知识和实际工作都不足。在调度任务时,没有综合考虑计算资源成本、电力成本、网络成本等因素。因此,我们提出了一种基于改进蚁群算法的多目标雾计算任务调度算法,该算法对蚁群算法进行优化,使其更适合雾节点的特点,利用时间和成本(TAC)综合考虑节点的成本,并在任务分配中引入关键因素,提高算法的收敛速度。不同的仿真实验表明,改进的蚁群算法在处理时间、成本和负载平衡方面都有提高。
{"title":"A multi-objective fog computing task scheduling strategy based on ant colony algorithm","authors":"Jingjun Gu, Jiadi Mo, P. Li, Yue Zhang, Wen Wang","doi":"10.1109/ICISCAE52414.2021.9590674","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590674","url":null,"abstract":"Fog computing can effectively reduce latency and improve resource utilization by extending cloud services to the edge of the network. However, due to the wide variety of fog equipment and different computing capabilities, the theoretical knowledge and practical work related to fog computing task scheduling are insufficient. When scheduling tasks, factors such as cost of computing resources, power costs, and network cost were not considered comprehensively. Therefore, we propose a multi-objective fog computing task scheduling algorithm based on improved ant colony algorithm, which optimize the ant colony algorithm to make it more suitable for the characteristics of the fog node, use time and cost (TAC) to comprehensively consider the cost of the node, and introduce the critical factor in task allocation to improve the convergence speed of the algorithm. Different simulation experiments show that the efficiency of the improved ant colony algorithm is enhanced in processing time, cost, and load balance.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115443400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Research on High Speed Robot Sorting System Based on Machine Vision Technology 基于机器视觉技术的高速机器人分拣系统研究
J. Dong, Qingpeng Han
The advantages of robot are obvious. It won't feel as tired as human beings. As long as the energy source is sufficient, it can work around the clock. The stability of robot work is stronger than that of human beings. It moves accurately according to the set procedures and has high repetition accuracy. However, the cost of using robot is far lower than that of users. Machine vision technology refers to the use of cameras and computers to simulate people's visual functions. It is widely used in the fields of electronic appliances, aerospace, automobiles and pharmaceuticals. It has the characteristics of non-contact measurement, high reliability and good flexibility, and has been widely used in industrial automation, visual navigation and virtual reality. This paper studies the industrial robot sorting system based on machine vision. The system mainly includes three modules: robot body and workpiece platform, machine vision and motion control; Finally, the key technologies applied in the sorting system are analyzed.
机器人的优点是显而易见的。它不会像人类那样感到疲倦。只要能源充足,它就能昼夜不停地工作。机器人工作的稳定性比人类强。按设定的程序准确移动,重复精度高。然而,使用机器人的成本远远低于用户的成本。机器视觉技术是指利用相机和计算机来模拟人的视觉功能。广泛应用于电子电器、航空航天、汽车、医药等领域。它具有非接触式测量、可靠性高、灵活性好等特点,在工业自动化、视觉导航、虚拟现实等领域得到了广泛的应用。本文研究了基于机器视觉的工业机器人分拣系统。该系统主要包括三个模块:机器人本体与工件平台、机器视觉与运动控制;最后,对分拣系统中应用的关键技术进行了分析。
{"title":"Research on High Speed Robot Sorting System Based on Machine Vision Technology","authors":"J. Dong, Qingpeng Han","doi":"10.1109/ICISCAE52414.2021.9590676","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590676","url":null,"abstract":"The advantages of robot are obvious. It won't feel as tired as human beings. As long as the energy source is sufficient, it can work around the clock. The stability of robot work is stronger than that of human beings. It moves accurately according to the set procedures and has high repetition accuracy. However, the cost of using robot is far lower than that of users. Machine vision technology refers to the use of cameras and computers to simulate people's visual functions. It is widely used in the fields of electronic appliances, aerospace, automobiles and pharmaceuticals. It has the characteristics of non-contact measurement, high reliability and good flexibility, and has been widely used in industrial automation, visual navigation and virtual reality. This paper studies the industrial robot sorting system based on machine vision. The system mainly includes three modules: robot body and workpiece platform, machine vision and motion control; Finally, the key technologies applied in the sorting system are analyzed.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121888177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Influence of electromagnetic environment on CPFSK communication signal 电磁环境对CPFSK通信信号的影响
Hailong Ge, Lifei Geng, Zhifei Yang, Bingyin Ren
In this paper, according to the electromagnetic environment of battlefield communication, the signal model of continuous phase frequency shift keying (CPFSK) is established, the anti-jamming performance is analyzed, and the influence of electromagnetic environment on CPFSK communication signal is studied by using physical communication equipment.
本文根据战场通信的电磁环境,建立了连续相移频键控(CPFSK)的信号模型,分析了其抗干扰性能,并利用物理通信设备研究了电磁环境对CPFSK通信信号的影响。
{"title":"Influence of electromagnetic environment on CPFSK communication signal","authors":"Hailong Ge, Lifei Geng, Zhifei Yang, Bingyin Ren","doi":"10.1109/ICISCAE52414.2021.9590678","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590678","url":null,"abstract":"In this paper, according to the electromagnetic environment of battlefield communication, the signal model of continuous phase frequency shift keying (CPFSK) is established, the anti-jamming performance is analyzed, and the influence of electromagnetic environment on CPFSK communication signal is studied by using physical communication equipment.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125935137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on Data Encryption Technology in Computer Network Communication Security Based on Genetic Algorithms 基于遗传算法的计算机网络通信安全数据加密技术研究
Longkai Zhang, Xingquan Teng, Xue-Zhen Ma, Ruize Wang
With the rapid development of science and technology, network communication technology has been widely used in various industries, but there are many communication security problems. In order to further improve the security of information data, related staff should use data encryption technology (DES) to strengthen security protection and ensure the integrity of information transmission. In the information age, information can help and benefit groups or individuals. Similarly, information can also be used to threaten and destroy them. We often need a measure to protect our data from being seen or destroyed by people with ulterior motives. In this paper, combining the principle and thought of genetic algorithm (GA), DES is studied in computer network communication security, and its application in computer communication network security is discussed.
随着科学技术的飞速发展,网络通信技术已广泛应用于各个行业,但也存在着许多通信安全问题。为了进一步提高信息数据的安全性,相关人员应采用数据加密技术(DES)加强安全保护,确保信息传输的完整性。在信息时代,信息可以帮助和造福群体或个人。同样,信息也可以用来威胁和摧毁他们。我们经常需要一种措施来保护我们的数据不被别有用心的人看到或破坏。本文结合遗传算法(GA)的原理和思想,研究了DES在计算机网络通信安全中的应用,并对其在计算机通信网络安全中的应用进行了探讨。
{"title":"Research on Data Encryption Technology in Computer Network Communication Security Based on Genetic Algorithms","authors":"Longkai Zhang, Xingquan Teng, Xue-Zhen Ma, Ruize Wang","doi":"10.1109/ICISCAE52414.2021.9590801","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590801","url":null,"abstract":"With the rapid development of science and technology, network communication technology has been widely used in various industries, but there are many communication security problems. In order to further improve the security of information data, related staff should use data encryption technology (DES) to strengthen security protection and ensure the integrity of information transmission. In the information age, information can help and benefit groups or individuals. Similarly, information can also be used to threaten and destroy them. We often need a measure to protect our data from being seen or destroyed by people with ulterior motives. In this paper, combining the principle and thought of genetic algorithm (GA), DES is studied in computer network communication security, and its application in computer communication network security is discussed.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130825699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
MatMat: Matrix Factorization by Matrix Fitting 矩阵拟合的矩阵分解
Hao Wang
Matrix factorization is a widely adopted recommender system technique that fits scalar rating values by dot products of user feature vectors and item feature vectors. However, the formulation of matrix factorization as a scalar fitting problem is not friendly to side information incorporation or multi-task learning. In this paper, we replace the scalar values of the user rating matrix by matrices, and fit the matrix values by matrix products of user feature matrix and item feature matrix. Our framework is friendly to multitask learning and side information incorporation. We use popularity data as side information in our paper in particular to enhance the performance of matrix factorization techniques. In the experiment section, we prove the competence of our method compared with other approaches using both accuracy and fairness metrics. Our framework is an ideal substitute for tensor factorization in context-aware recommendation and many other scenarios.
矩阵分解是一种被广泛采用的推荐系统技术,它通过用户特征向量与项目特征向量的点积拟合标量评价值。然而,将矩阵分解表述为标量拟合问题不利于边信息合并或多任务学习。本文将用户评价矩阵的标量值替换为矩阵,并用用户特征矩阵与物品特征矩阵的矩阵积来拟合矩阵值。我们的框架是友好的多任务学习和侧信息合并。在本文中,我们特别使用人气数据作为侧信息来提高矩阵分解技术的性能。在实验部分,我们使用准确性和公平性指标证明了我们的方法与其他方法相比的能力。我们的框架是上下文感知推荐和许多其他场景中张量分解的理想替代品。
{"title":"MatMat: Matrix Factorization by Matrix Fitting","authors":"Hao Wang","doi":"10.1109/ICISCAE52414.2021.9590639","DOIUrl":"https://doi.org/10.1109/ICISCAE52414.2021.9590639","url":null,"abstract":"Matrix factorization is a widely adopted recommender system technique that fits scalar rating values by dot products of user feature vectors and item feature vectors. However, the formulation of matrix factorization as a scalar fitting problem is not friendly to side information incorporation or multi-task learning. In this paper, we replace the scalar values of the user rating matrix by matrices, and fit the matrix values by matrix products of user feature matrix and item feature matrix. Our framework is friendly to multitask learning and side information incorporation. We use popularity data as side information in our paper in particular to enhance the performance of matrix factorization techniques. In the experiment section, we prove the competence of our method compared with other approaches using both accuracy and fairness metrics. Our framework is an ideal substitute for tensor factorization in context-aware recommendation and many other scenarios.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128861181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
期刊
2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1