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

Video-based Person Re-identification Based on Distributed Cloud Computing

Journal of Artificial Intelligence and Technology 2021年第2期1卷 110-120页

作者： Chengyan Zhong Xiaoyu Jiang Guanqiu Qi College of Automation Chongqing University of Posts and TelecommunicationsChongqing 400065China College of Intelligence Science and Technology Chongqing University of Posts and TelecommunicationsChongqing 400065China Computer Information Systems Department State University of New York at Buffalo StateBuffaloNY 14222USA

Person re-identification has been a hot research issues in the field of computer *** recent years,with the maturity of the theory,a large number of excellent methods have been ***,large-scale data sets and huge networks make training a time-consuming *** the same time,the parameters and their values generated during the training process also take up a lot of computer ***,we apply distributed cloud computing method to perform person re-identification *** distributed data storage method,pedestrian data sets and parameters are stored in cloud *** speed up operational efficiency and increase fault tolerance,we add data redundancy mechanism to copy and store data blocks to different nodes,and we propose a hash loop optimization algorithm to optimize the data distribution ***,we assign different layers of the re-identification network to different nodes to complete the training in the way of model *** comparing and analyzing the accuracy and operation speed of the distributed model on the video-based dataset MARS,the results show that our distributed model has a faster training speed.

关键词： person re-identification distributed cloud computing data redundancy mechanism

来源：评论

学校读者我要写书评

暂无评论

Neural Network Concept of Ukrainian-Language Text Embedding

Neural Network Concept of Ukrainian-Language Text Embedding

引用

International Conference on Advanced computer information Technologies (ACIT)

作者： Oleg Bisikalo Oksana Kovtun Viacheslav Kovtun Department of Automation and Intelligent Information Technologies Vinnytsia National Technical University Vinnytsia Ukraine Department of Theory and Practice of Translation Vasyl’ Stus Donetsk National University Vinnytsia Ukraine Department of Computer Control Systems Vinnytsia National Technical University Vinnytsia Ukraine

The main contribution of the research is the neural network concept of Ukrainian-language text embedding with a two-level architecture. Basic embedding is implemented based on main lexical structures (Noun-Verb, Noun-Adjective, Verb-Adverb). To preserve the semantic component of complex, long sentences characteristic of the Ukrainian language, the post-embedding procedure is analytically defined. Both levels of the concept are implemented as autoencoder-type neural networks with appropriate topologies. To evaluate the complexity of the proposed conglomerate training process, a generalized loss function was formalized. Testing of the proposed concept in comparison with classic (BOW, Word2Vec) and progressive (MCB BERT) analogues showed that the author’s solution prevails over the former and lags behind the latter in the selected quality metric.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Neural-Network-Based Recursive State Estimation for Nonlinear Networked systems With Binary-Encoding Mechanisms

引用

IEEE Transactions on Neural Networks and Learning systems 2025年第6期36卷 10072-10083页

作者： Yuhan Zhang Zidong Wang Lei Zou Wei Qian Shuxin Du College of Electrical Engineering and Automation Shandong University of Science and Technology Qingdao China Department of Computer Science Brunel University of London Middlesex Uxbridge U.K. College of Information Science and Technology Donghua University Shanghai China Engineering Research Center of Digitalized Textile and Fashion Technology Ministry of Education Shanghai China School of Electrical Engineering and Automation Henan Polytechnic University Jiaozuo China Huzhou Key Laboratory of Intelligent Sensing and Optimal Control for Industrial Systems School of Engineering Huzhou University Huzhou China

This work addresses the problem of recursive state estimation for networked control systems with unknown nonlinearities and binary-encoding mechanisms (BEMs). To enhance transmission reliability and reduce network resource consumption, BEMs are used to convert measurement signals into binary bit strings (BBSs) of limited length, which are then transmitted to the estimator through noisy communication channels. During transmission, random bit errors may occur in the BBSs due to channel noise. For the considered nonlinear networked control systems affected by random bit errors, a neural-network (NN)-based recursive estimation strategy is proposed, where an NN with a time-varying tuning scalar is employed to approximate the unknown nonlinearity of the networked control systems. By using the proposed strategy, the upper bounds of the estimation error of the system state and the trace of the estimation error of the NN weight (NNW) are first derived. These bounds are then minimized by recursively designing both the estimator gain matrix and the tuning scalar of the NNW. Finally, the effectiveness of the proposed estimation strategy is demonstrated through a numerical example.

关键词： Artificial neural networks State estimation Encoding Noise Networked control systems Electronic mail Symmetric matrices Estimation error Tuning Recursive estimation

来源：评论

学校读者我要写书评

暂无评论

Learning-Based Sustainable Multi-User Computation Offloading for Mobile Edge-Quantum Computing

Learning-Based Sustainable Multi-User Computation Offloading...

引用

IEEE International Conference on Communications (ICC)

作者： Minrui Xu Dusit Niyato Jiawen Kang Zehui Xiong Mingzhe Chen School of Computer Science and Engineering Nanyang Technological University Singapore School of Automation Guangdong University of Technology China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Singapore Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA

In this paper, a novel paradigm of mobile edgequantum computing (MEQC) is proposed, which brings quantum computing capacities to mobile edge networks that are closer to mobile users (i.e., edge devices). First, we propose an MEQC system model where mobile users can offload computational tasks to scalable quantum computers via edge servers with cryogenic components and fault-tolerant schemes. Second, we show that it is NP-hard to obtain a centralized solution to the partial offloading problem in MEQC in terms of the optimal latency and energy cost of classical and quantum computing. Third, we propose a multi-agent hybrid discrete-continuous deep reinforcement learning using proximal policy optimization to learn the long-term sustainable offloading strategy without prior knowledge. Finally, experimental results demonstrate that the proposed algorithm can reduce at least 30% of the cost compared with the existing baseline solutions under different system settings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parallel Dual-Branch Fusion Network for Epileptic Seizure Prediction

引用

computers in Biology and Medicine 2024年 176卷 108565-108565页

作者： Ma, Hongcheng Wu, Yajing Tang, Yongqiang Chen, Rui Xu, Tao Zhang, Wensheng School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing China Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and Technology Taiyuan China School of Computer Science and Cyber Engineering Guangzhou University Guangzhou China

Epilepsy is a prevalent chronic disorder of the central nervous system. The timely and accurate seizure prediction using the scalp Electroencephalography (EEG) signal can make patients adopt reasonable preventive measures before seizures occur and thus reduce harm to patients. In recent years, deep learning-based methods have made significant progress in solving the problem of epileptic seizure prediction. However, most current methods mainly focus on modeling short- or long-term dependence in EEG, while neglecting to consider both. In this study, we propose a Parallel Dual-Branch Fusion Network (PDBFusNet) which aims to combine the complementary advantages of Convolutional Neural Network (CNN) and Transformer. Specifically, the features of the EEG signal are first extracted using Mel Frequency Cepstral Coefficients (MFCC). Then, the extracted features are delivered into the parallel dual-branches to simultaneously capture the short- and long-term dependencies of EEG signal. Further, regarding the Transformer branch, a novel feature fusion module is developed to enhance the ability of utilizing time, frequency, and channel information. To evaluate our proposal, we perform sufficient experiments on the public epileptic EEG dataset CHB-MIT, where the accuracy, sensitivity, specificity and precision are 95.76%, 95.81%, 95.71% and 95.71%, respectively. PDBFusNet shows superior performance compared to state-of-the-art competitors, which confirms the effectiveness of our proposal. © 2024 Elsevier Ltd

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Vision-based Semantic Communications for Metaverse Services: A Contest Theoretic Approach

arXiv

引用

arXiv 2023年

作者： Liu, Guangyuan Du, Hongyang Niyato, Dusit Kang, Jiawen Xiong, Zehui Soong, Boon Hee The School of Computer Science and Engineering Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The Department of Electrical and Electronic Engineering Nanyang Technological University Singapore

The popularity of Metaverse as an entertainment, social, and work platform has led to a great need for seamless avatar integration in the virtual world. In Metaverse, avatars must be updated and rendered to reflect users’ behaviour. Achieving real-time synchronization between the virtual bilocation and the user is complex, placing high demands on the Metaverse Service Provider (MSP)’s rendering resource allocation scheme. To tackle this issue, we propose a semantic communication framework that leverages contest theory to model the interactions between users and MSPs and determine optimal resource allocation for each user. To reduce the consumption of network resources in wireless transmission, we use the semantic communication technique to reduce the amount of data to be transmitted. Under our simulation settings, the encoded semantic data only contains 51 bytes of skeleton coordinates instead of the image size of 8.243 megabytes. Moreover, we implement Deep Q-Network to optimize reward settings for maximum performance and efficient resource allocation. With the optimal reward setting, users are incentivized to select their respective suitable uploading frequency, reducing down-sampling loss due to rendering resource constraints by 66.076% compared with the traditional average distribution method. The framework provides a novel solution to resource allocation for avatar association in VR environments, ensuring a smooth and immersive experience for all users. © 2023, CC BY.

关键词： Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Abstraction-Based Synthesis of Controllers for Approximate Opacity

Abstraction-Based Synthesis of Controllers for Approximate O...

引用

IEEE Conference on Decision and Control

作者： Junyao Hou Siyuan Liu Xiang Yin Majid Zamani Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Division of Decision and Control Systems KTH Royal Institute of Technology Stockholm Sweden Department of Computer Science University of Colorado Boulder CO USA Department of Computer Science LMU Munich Munich Germany

Opacity is an important information-flow security property which characterizes the plausible deniability of certain “secret behaviors” in dynamical systems. In this paper, we study the problem of synthesizing controllers enforcing a notion of opacity over discrete-time control systems with continuous state sets. In this paper, we develop an abstraction-based approach to tackle the controller synthesis problem. Specifically, we adopt a notion of approximate opacity which is suitable for continuous-space control systems. We propose a notion of approximate initial-state opacity preserving alternating simulation relation which characterizes the closeness between two systems in terms of opacity preservation. We show that, based on this new notion of system relation, one can synthesize an opacity-enforcing controller for the abstract system which is finite and then refine it back to enforce opacity over the original control system. Finally, we present a method for constructing opacity-preserving finite abstractions for discrete-time control systems under some stability properties. Our results are illustrated on a two-room temperature control problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploiting Multiple Paths in Multi-hop Co-operative Ad-Hoc Networks for Providing Security without Trusted Third Party 33rd

Exploiting Multiple Paths in Multi-hop Co-operative Ad-Hoc N...

引用

33rd International Conference on Advanced information Networking and Applications, AINA-2019

作者： Dinesh Ram Kumar, T. Bhatia, Ashutosh Hansdah, R.C. Department of Computer Science and Information Systems Birla Institute of Technology and Science Pilani India Department of Computer Science and Automation Indian Institute of Science Bangalore India

ISBN: (纸本)9783030150310

Ensuring secure communication in large scale wireless networks is a challenging issue, especially when the nodes participating in the network itself cannot be trusted fully. This situation is very much pertinent in the case of multi-hop wireless cooperative networks, where the nodes co-operate with each other to support multi-hop communication in the network. In such networks, assuming the presence of a trusted third party to provide key exchange and authentication services in the network is not viable. Additionally, the classical Diffie-Hellman based key establishment mechanism as such cannot be used because of Man-In-The-Middle and impersonation attacks, as the nodes participating in a multi-hop path from source to destination cannot be trusted. In this paper, we investigate the use of the multi-paths and secret sharing in multi-hop cooperative adhoc networks to provide practical secure communication between the nodes in the network. We propose a couple of routing algorithms that give multiple-paths to send different segments of information required to be communicated securely, under various behavioral models of the participating nodes. The simulation results show that the majority of times, we are able to find the multiple paths in the network through which the different segments of a piece of information can be sent to achieve desirable security. © 2020, Springer Nature Switzerland AG.

关键词： Secure communication

来源：评论

学校读者我要写书评

暂无评论

Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm

引用

Complex System Modeling and Simulation 2021年第3期1卷 198-217页

作者： Xue Han Yuyan Han Qingda Chen Junqing Li Hongyan Sang Yiping Liu Quanke Pan Yusuke Nojima the School of Computer Science Liaocheng UniversityLiaocheng 252000China the State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819China the School of Information Science and Engineering Shandong Normal UniversityJinan 252000China the College of Computer Science and Electronic Engineering Hunan UniversityChangsha 410082China the School of Mechatronic Engineering and Automation Shanghai UniversityShanghai 200072China the Department of Computer Science and Intelligent Systems Osaka Prefecture UniversityOsaka 599-8531Japan

To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing *** this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup *** solve DPFSPs,significant developments of some metaheuristic algorithms are *** this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in *** to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed *** compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.

关键词： distributed permutation flow shop iterated greedy local search swapping strategy

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a Two-Limbed 3T1R Haptic Device

Design and Implementation of a Two-Limbed 3T1R Haptic Device

引用

IEEE/RSJ International Conference on Intelligent Robots and systems (IROS)

作者： Long Kang Yang Yang Byung-Ju Yi PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China Xi'an Modern Control Technology Research Institute Xi'an China School of Automation Nanjing University of Information Science and Technology Nanjing China Department of the Electronic Systems Engineering Hanyang University Ansan South Korea

This paper presents a haptic device with a simple architecture of only two limbs that can provide translational motion in three degrees of freedom (DOF) and one-DOF rotational motion. Actuation redundancy eliminates all forward-kinematic singularities and improves the motion-force transmission property. Thanks to the special structure of the kinematic chains, all actuators are close to the base and full gravity compensation is achieved passively by using springs. Force producibility analysis shows that this haptic device is able to produce long-term continuous force feedback of 15–30 N in each direction. By developing a prototype of the haptic device and a virtual three-dimensional simulator, a preliminary performance evaluation of the haptic device was conducted. In addition, a torque distribution algorithm considering a relaxed form of actuator-torque saturation was experimentally evaluated, and a comparison with other algorithms reveals that this algorithm offers several advantages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：