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

Visual object tracking:Progress,challenge,and future

The Innovation 2023年第2期4卷 19-20页

作者： Libo Zhang Heng Fan Institute of Software Chinese Academy of SciencesBeijing 100190China Department of Computer Science and Engineering University of North TexasDentonTX 76206USA Nanjing Institute of Software Technology Nanjing 210000China

Visual object tracking aims to continuously localize the target object of interest in a video *** one of the most fundamental problems in computer vision,visual object tracking has a long list of critical applications including video surveillance,autonomous driving,human-machine interaction,augmented reality,robotics,etc.,in which the tracking system provides the capacity to report target positions in real time for subsequent visual *** the past decades,visual object tracking has been extensively explored and has witnessed considerable progress,especially in deep-learning-based tracking.

关键词： Visual visual computer

来源：评论

学校读者我要写书评

暂无评论

Towards Safe Online Machine Learning Model Training and Inference on Edge Networks 22

Towards Safe Online Machine Learning Model Training and Infe...

引用

22nd IEEE International Conference on Machine Learning and Applications, ICMLA 2023

作者： Maruf, Md Al Azim, Akramul Auluck, Nitin Sahi, Mansi Ontario Tech University Department of Electrical Computer and Software Engineering Oshawa Canada Indian Institute of Technology Departmcnt of Computer Science and Engineering Ropar India

ISBN: (纸本)9798350345346

With the increasing demand for edge computing in cyber-physical system (CPS) applications, ensuring the safety and reliability of machine learning models running on edge devices during online model training and inference is essential. Although data and model parallelism offer significant advantages for large machine learning model training, adopting parallel computing architecture in edge networks is challenging. It introduces safety concerns while splitting and integrating machine learning models over different computing nodes, which can pose risks to the integrity and reliability of the system. Therefore, online model training and inference in edge networks require a safe parallel computing architecture to achieve improved performance with optimal resource utilization. To address this challenge, we propose an efficient machine learning model partitioning algorithm that considers the safety constraint and requirements of edge networks and includes the triple-modular redundancy (TMR) technique for trusted computation. Our proposed approach achieves a significant speedup of approximately 56.3% in net training time compared to the non-partitioning approach, making it more efficient and suitable for real-time applications in edge networks. © 2023 IEEE.

关键词： Edge Networks Machine Learning Model Partitioning Triple Modular Redundancy (TMR)

来源：评论

学校读者我要写书评

暂无评论

Intelligent Sorting System 7

Intelligent Sorting System

引用

7th International Conference on Cloud Computing and Big Data Analytics, ICCCBDA 2022

作者： Mao, Yanghong Chen, Chuixin Pan, Zhengjun Guangzhou Institute of Science and Technology Department of Computer Science and Engineering Guangzhou China Institute of Guangzhou Department of Software Engineering Software Engineering Guangzhou China Department of Software Engineering Software Engineering Institute of Guangzhou Guangzhou China

ISBN: (纸本)9781665487115

In order to achieve the goal that the manipulator can automatically obtain any position within its working range, and can adjust the end actuator for grasping, a machine vision sorting system is designed. The system passes through image processing, target recognition and positioning, and finally realizes the sorting effect through trajectory planning. Aiming at the problem that the deep learning algorithm takes a long time, The traditional image processing algorithm and deep learning target detection algorithm are organically combined to reduce the use delay of image processing in the system. Because the training of deep learning model requires a large number of data sets, but the amount of data in manufacturing factories is small, and data labeling is time-consuming and laborious, YOLO v3 algorithm is used to improve the efficiency of training model under a small number of labeled data sets, SIFT algorithm is used to extract image features, and K-D tree algorithm is used to match image features. In the algorithm of position, the centroid is extracted as the positioning reference coordinate, the kinematics model of the manipulator is established. trajectory planning, straight-line and arc interpolation algorithms are used. The experimental results show that the system meets the design requirements. © 2022 IEEE.

关键词： Deep learning Training Trajectory planning Target recognition Object detection Feature extraction Manipulators

来源：评论

学校读者我要写书评

暂无评论

Collaborative learning-based inter-dependent task dispatching and co-location in an integrated edge computing system

引用

Digital Communications and Networks 2024年第6期10卷 1837-1850页

作者： Uchechukwu Awada Jiankang Zhang Sheng Chen Shuangzhi Li Shouyi Yang School of Software Henan Institute of Science and TechnologyXinxiang 453003China School of Electrical and Information Engineering Zhengzhou UniversityZhengzhou 450001China Department of Computing and Informatics Bournemouth UniversityPoole BH125BBUK School of Electronics and Computer Science University of SouthamptonSouthampton SO171BJUK Faculty of Information Science and Engineering Ocean University of ChinaQingdao 266100China

Recently,several edge deployment types,such as on-premise edge clusters,Unmanned Aerial Vehicles(UAV)-attached edge devices,telecommunication base stations installed with edge clusters,etc.,are being deployed to enable faster response time for latency-sensitive *** fundamental problem is where and how to offload and schedule multi-dependent tasks so as to minimize their collective execution time and to achieve high resource *** approaches randomly dispatch tasks naively to available edge nodes without considering the resource demands of tasks,inter-dependencies of tasks and edge resource *** approaches can result in the longer waiting time for tasks due to insufficient resource availability or dependency support,as well as provider ***,we present Edge Colla,which is based on the integration of edge resources running across multi-edge *** Colla leverages learning techniques to intelligently dispatch multidependent tasks,and a variant bin-packing optimization method to co-locate these tasks firmly on available nodes to optimally utilize *** experiments on real-world datasets from Alibaba on task dependencies show that our approach can achieve optimal performance than the baseline schemes.

关键词： Edge computing Collaborative learning Resource utilization Execution time Edge federation Gang scheduling

来源：评论

学校读者我要写书评

暂无评论

A Tutorial on Federated Learning from Theory to Practice:Foundations,software Frameworks,Exemplary Use Cases,and Selected Trends

引用

IEEE/CAA Journal of Automatica Sinica 2024年第4期11卷 824-850页

作者： M.Victoria Luzón Nuria Rodríguez-Barroso Alberto Argente-Garrido Daniel Jiménez-López Jose M.Moyano Javier Del Ser Weiping Ding Francisco Herrera Department of Software Engineering Andalusian Research Institute in Data Science and Computational Intelligence(DaSCI)University of GranadaGranada 18071Spain Department of Computer Science and Artificial Intelligence Andalusian Research Institute in Data Science and Computational Intelligence(DaSCI)University of GranadaGranada 18071Spain Department of Communications Engineering University of the Basque Country(UPV/EHU)and also with TECNALIABasque Research&Technology Alliance(BRTA)Spain School of Information Science and Technology Nantong UniversityNantong 226019China

When data privacy is imposed as a necessity,Federated learning(FL)emerges as a relevant artificial intelligence field for developing machine learning(ML)models in a distributed and decentralized *** allows ML models to be trained on local devices without any need for centralized data transfer,thereby reducing both the exposure of sensitive data and the possibility of data interception by malicious third *** paradigm has gained momentum in the last few years,spurred by the plethora of real-world applications that have leveraged its ability to improve the efficiency of distributed learning and to accommodate numerous participants with their data *** virtue of FL,models can be learned from all such distributed data sources while preserving data *** aim of this paper is to provide a practical tutorial on FL,including a short methodology and a systematic analysis of existing software ***,our tutorial provides exemplary cases of study from three complementary perspectives:i)Foundations of FL,describing the main components of FL,from key elements to FL categories;ii)Implementation guidelines and exemplary cases of study,by systematically examining the functionalities provided by existing software frameworks for FL deployment,devising a methodology to design a FL scenario,and providing exemplary cases of study with source code for different ML approaches;and iii)Trends,shortly reviewing a non-exhaustive list of research directions that are under active investigation in the current FL *** ultimate purpose of this work is to establish itself as a referential work for researchers,developers,and data scientists willing to explore the capabilities of FL in practical applications.

关键词： Data privacy distributed machine learning federated learning software frameworks

来源：评论

学校读者我要写书评

暂无评论

Nash Equilibria in Reverse Temporal Voronoi Games

arXiv

引用

arXiv 2024年

作者： Pawlowski, Simeon Froese, Vincent Technische Universität Berlin Faculty IV Institute of Software Engineering and Theoretical Computer Science Germany

We study Voronoi games on temporal graphs as introduced by Boehmer et al. (IJCAI’21) where two players each select a vertex in a temporal graph with the goal of reaching the other vertices earlier than the other player. In this work, we consider the reverse temporal Voronoi game, that is, a player wants to maximize the number of vertices reaching her earlier than the other player. Since temporal distances in temporal graphs are not symmetric in general, this yields a different game. We investigate the difference between the two games with respect to the existence of Nash equilibria in various temporal graph classes including temporal trees, cycles, grids, cliques and split graphs. Our extensive results show that the two games indeed behave quite differently depending on the considered temporal graph class. © 2024, CC BY.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Dysarthric Speech Recognition using Depthwise Separable Convolutions: Preliminary Study 12

Dysarthric Speech Recognition using Depthwise Separable Conv...

引用

12th International Conference on Speech Technology and Human-computer Dialogue, SpeD 2023

作者： Shahamiri, Seyed Reza Mandal, Krishnendu Sarkar, Sudeshna The University of Auckland Faulty of Engineering Department of Electrical Computer and Software Engineering Auckland New Zealand Indian Institute of Technology Computer Science & Engineering Department Kharagpur India

ISBN: (纸本)9798350327977

As a neurological disability that affects muscles involved in articulation, dysarthria is a speech impairment that leads to reduced speech intelligibility. In severe cases, these individuals could also be handicapped and unable to interact with digital devices. For such individuals, Automatic Speech Recognition (ASR) technologies could be life changing by enabling them to communicate with others as well as computing devices via voice commands. Nonetheless, ASR systems designed to recognize healthy speech have shown very poor performance to transcribe dysarthric speech, signaling the need to design ASR specifically tailored for dysarthria. Dysarthric Speech Recognition (DRS) research has progressed gradually because of the challenges the research community faces such as the scarcity of dysarthric speech that does not allow the researchers to design deeper acoustic models needed to better learn dysarthric speech variations. In this paper we report on our preliminary findings to improve our previous DSR called Speech Vision and study the effects of Separable Convolutional neurons to improve its acoustic model. Speech Vision is a novel Dysarthric Speech Recognition system that learns to recognize the shape of the words uttered by dysarthric speakers instead of recognizing phone sequences and then mapping them to words. Experiments conducted on the utterances provided by all UA-Speech dysarthric speakers indicate the proposed Depthwise separable architecture provided better word recognition accuracies compared to the original Speech Vision's architecture across all dysarthric speech intelligibility classes. © 2023 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Message Passing on Semantic-Anchor-Graphs for Fine-grained Emotion Representation Learning and Classification

Message Passing on Semantic-Anchor-Graphs for Fine-grained E...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Zhang, Pinyi Chen, Jingyang Shen, Junchen Zhai, Zijie Li, Ping Zhang, Jie Zhang, Kai School of Computer Science and Technology East China Normal University China Institute of Science and Technology for Brain-inspired intelligence Fudan University China School of Computer Science and Software Engineering Southwest Petroleum University China

ISBN: (纸本)9798891761643

Emotion classification has wide applications in education, robotics, virtual reality, etc. However, identifying subtle differences between fine-grained emotion categories remains challenging. Current methods typically aggregate numerous token embeddings of a sentence into a single vector, which, while being an efficient compressor, may not fully capture their complex semantic and temporal distributions. To solve this problem, we propose SEmantic ANchor Graph Neural Networks (SEAN-GNN) for fine-grained emotion classification. It learns a group of representative, multi-faceted semantic anchors in the token embedding space: using these anchors as global reference, any sentence can be projected onto them to form a "semantic-anchor graph", with node attributes and edge weights quantifying semantic and temporal information, respectively. The graph structure is well aligned across sentences and, importantly, allows for generating comprehensive emotion representations regarding K different anchors. Message passing on the anchor graph can further integrate the semantic and temporal information and refine the learned features. Empirically, SEAN-GNN produces meaningful semantic anchors and discriminative graph patterns, with promising classification results on 6 popular benchmark datasets against state-of-the-arts. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A New Method of Search Engine Optimization Based on Semantic Kernel Idea

A New Method of Search Engine Optimization Based on Semantic...

引用

作者： Orekhov, Sergey Godlevsky, Michail Malyhon, Hennadiy Goncharenko, Tetiana Computer Science and Software Engineering Department National Technical University Kharkiv Polytechnical Institute Kharkiv61002 Ukraine

The results of more than 30 projects in the field of search engine optimization on the Internet show that the effectiveness of existing approaches is catastrophically reduced. Paid promotion methods no longer guarantee a banal increase in the traffic of a given web resource, and even more so the number of leads. The reason is that competition has moved to the Internet as much as possible. So, we need to look for new alternative methods. Therefore, the paper proposes to consider a new alternative way to promote goods on the Internet. This approach is a new information technology – virtual promotion. It is based on the creation of a virtual image of a product on the Internet. We called this virtual image the semantic kernel. Such a kernel is placed on the Internet in order to attract a potential buyer. It is placed in the Internet nodes according to a special online sales scheme, which is based on a map of the user's travels on the Internet. This scheme is called the virtual promotion map. The map must guarantee maximum traffic to a given web resource. However, it will not be possible to immediately build a map. Therefore, its creation is iterative. We are, as it were, setting ourselves up to find effective ways between the semantic core and the user who is ready to buy our product online. The article offers a description of the virtual promotion technology. The main idea of virtual promotion is that promotion is a logistical channel between a company and a client. We put a special message (semantic core) into the channel. He moves through the logistics channel and tries to attract as many new buyers of the goods as possible. This article presents the results of the work of special software that implements the synthesis, quality assessment and management of the semantic kernel of web content. The program generates and manages two channels: the first is intended for the distribution of the semantic kernel, the second is for assessing the quality of such distribution. T

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Incremental software Product Line Verification - A Performance Analysis with Dead Variable Code

Incremental Software Product Line Verification - A Performan...

引用

2023 Fachtagung des GI-Fachbereichs softwaretechnik, software engineering 2023 - 2023 Conference of the GI software engineering Division, software engineering 2023

作者： Kröher, Christian Flöter, Moritz Gerling, Lea Schmid, Klaus University of Hildesheim Institute of Computer Science Software Systems Engineering Universitätsplatz 1 Hildesheim31141 Germany

ISBN: (纸本)9783885797265

In this work, we summarize our journal paper published in Empirical software engineering (EMSE) in 2022 [Kr22]. Verification approaches for software Product Lines (SPL) aim at detecting variability-related defects and inconsistencies. In general, these analyses take a significant amount of time to provide complete results for an entire, complex SPL. If the SPL evolves, these results potentially become invalid, which requires a time-consuming re-verification of the entire SPL for each increment. However, in previous work we showed that variability-related changes occur rather infrequently and typically only affect small parts of a SPL. In this paper, we utilize this observation and present an incremental dead variable code analysis as an example for incremental SPL verification, which achieves significant performance improvements. It explicitly considers changes and partially updates its previous results by re-verifying changed artifacts only. We apply this approach to the Linux kernel demonstrating that our fastest incremental strategy takes only 3.20 seconds or less for most of the changes, while the non-incremental approach takes 1,020 seconds in median. We also discuss the impact of different variants of our strategy on the overall performance, providing insights into optimizations that are worthwhile. © 2023 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Verification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：