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

Federated Recognition Architecture Based on voting and Feedback Mechanisms for Accuracy Object Classification in Distributed Edge Intelligence Environment

引用

IEEE SENSORS JOURNAL 2023年第22期23卷 27478-27489页

作者： Tuan, Nguyen Anh Xu, Rongxu Moe, Sa Jim Soe Kim, Dohyeun Jeju Natl Univ Dept Comp Engn Jeju 63243 South Korea Jeju Natl Univ Big Data Res Ctr Jeju 63243 South Korea

Deep learning has recently become a crucial tool to solve many complex problems and has the potential to revolutionize industries. With the widespread adoption of the Internet of Things, there are now many devices with limited computational resources that are capable of running deep learning models. It has opened up new opportunities to implement deep learning in the edge environment so that decisions can be made locally without sending data to a cloud server for processing. However, because of limited resources, the model's performance and communication overhead are challenges when deploying learning models to edge devices. The focus of this article is to investigate and propose a federated recognition architecture for object classification in a distributed edge intelligence environment. Specifically, we build an edge server that includes a voting module and a feedback module to improve the overall accuracy of object classification. The voting module aggregates predictions of multiple edge devices, whereas the feedback module sends the voting results to edge devices to adjust the local deep learning model. We build edge devices based on the EdgeX platform which makes it easy to manage data and optimize communication overheads. Because the edge server and edge nodes only exchange prediction results, our proposed architecture ensures security with sensitive data as well as deep learning model architecture. By testing on the image dataset, we evaluate the proposed architecture's performance and show that it outperforms individual local models in terms of accuracy. Furthermore, our experiments demonstrate that, with the feedback mechanism, the deep learning model is constantly updated with new data to maintain accuracy and avoid being outdated. Besides, we prove the real-time processing speed by collecting the delay time of the proposed model. The results show that our proposed architecture has the potential to be deployed in practical applications such as smart cities

关键词： Convolutional neural network (CNN) deep learning distributed edge environment EdgeX platform federated recognition Internet of Things online learning voting algorithms

来源：评论

学校读者我要写书评

暂无评论

CAPACITY OF voting SYSTEMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1993年第7期19卷 698-706页

作者： RANGARAJAN, S JALOTE, P TRIPATHI, SK INDIAN INST TECHNOL DEPT COMP SCI & ENGNKANPUR 208016UTTAR PRADESHINDIA UNIV MARYLAND DEPT COMP SCICOLL PKMD 20742

Data replication is often used to increase the availability of data in a database system. voting schemes can be used to manage this replicated data. In this paper we use a simple model to study the capacity of systems using voting schemes for data management. Capacity of a system is defined as the number of operations the system can perform successfully, on an average, per unit time. We study the capacity of a system using voting and compare it with the capacity of a system using a single node. We show that the maximum increase in capacity by the use of majority voting is bounded by 1/p, where p is the steady-state probability of a node being alive. We also show that for a system employing majority voting, if the reliability of nodes is high, increasing the number of nodes to more than three gives only a marginal increase in capacity. We perform similar analysis for three other voting schemes.

关键词： AVAILABILITY CAPACITY DATA REPLICATION MAJORITY voting SCALABILITY voting algorithms

来源：评论

学校读者我要写书评

暂无评论

Threshold behaviour of discordant voting on the complete graph

引用

JOURNAL OF DISCRETE algorithms 2018年 50卷 10-22页

作者： Cooper, Colin Rivera, Nicolas Kings Coll London Dept Informat London England

Given a connected graph G whose vertices are coloured in some way, a discordant voting process on G is as follows. At each step a pair of adjacent vertices with different colours interact, and one of the vertices changes its colour to match the other one. If eventually all vertices have the same colour, we say a consensus has been reached. A vertex is discordant if it has a discordant edge, i.e. a neighbour of a different colour. In the general discordant voting process, at each step a discordant vertex u is chosen uniformly at random, and then a discordant edge (u, v) is chosen from among the discordant edges of u, also uniformly at random. With probability beta vertex u adopts the colour of vertex v and with probability 1 - beta vertex v adopts the colour of vertex u. Let T be the number of steps needed to reach consensus. For the complete graph K-n with an initial colouring where half the vertices are red and half blue, then when beta = 0, ET = circle dot(n logn), whereas when beta = 1 then ET = circle dot(2(n)). The case beta = 1/2 corresponds to a simple random walk on a path with vertex set {0, 1,...,n} and has ET = n(2) / 4. We study the effect of varying beta from zero to one, thus revealing the detailed transition from ET = circle dot(n logn) to ET = circle dot(2(n)). In terms of beta, the transition from circle dot(n logn) to circle dot(n(2)) occurs in a scaling window of width O(1/n) around beta = 1/2. For any a > 1, there is an explicit value of beta = 1/2 + O(logn/n) for which ET = circle dot(n(a)). When beta > 1/2 constant, there is an explicit value a(beta) such that ET = circle dot(a(n)). (C) 2018 Elsevier B.V. All rights reserved.

关键词： Random processes voting algorithms Distributed computing

来源：评论

学校读者我要写书评

暂无评论

voting Algorithm Approach for Autonomous Vehicle Safe Driving 19

Voting Algorithm Approach for Autonomous Vehicle Safe Drivin...

引用

19th IEEE International Conference on Industrial Technologies (ICIT)

作者： Boukhari, Mohamed Ryad Chaibet, Ahmed Boukhnifer, Moussa Glaser, Sebastien Inst VEDECOM Versailles France ESTACA Montigny Le Bretonneux France

ISBN: (纸本)9781509059492

The aim of this paper is to assess three voting algorithms ensuring fault tolerance for an autonomous vehicle. Thus, by using a vehicle longitudinal dynamic model and a SHERPA/VEDECOM sensors model, the emphasis is to ensure a reliable inter-distance measurement to the controller in both faultless and faulty scenarios. The simulation results show the effectiveness of the designed algorithms to provide fault tolerance;nonetheless, some disparities are noticed between the voting algorithms in terms of performance.

关键词： voting algorithms Fault Tolerant Control Vehicle Perception Sensors

来源：评论

学校读者我要写书评

暂无评论

Component-oriented voter model for dependable control applications

引用

MICROPROCESSORS AND MICROSYSTEMS 2001年第3期25卷 167-176页

作者： Latif-Shabgahi, G Bass, JM Bennett, S Univ Sheffield Dept Automat Control & Syst Engn Sheffield S1 3JD S Yorkshire England Univ Wales Sch Informat Bangor LL57 1UT Gwynedd Wales

In many industrial applications arbitration between redundant subsystems using voting algorithms is popular. Many voting strategies, implemented in hardware or software, have been proposed of which majority and median voters have been widely used in real applications. Component-oriented design and modeling is receiving increasing amounts of interest in the software engineering community. Detailed analysis of voters shows that they can also be considered as a combination of independent components, each performing a specific function. This article proposes a component-oriented model for voters. The model offers benefits such as reusability, flexibility, and extensibility to the system designer. Components and their families are introduced, categorised and simulated. The model is simulated and a Library of simulated components is provided. The generality of the model not only supports the analysis of a large number of voter permutations but also facilitates system design and implementation phases. The article presents the experimental results of selected component-oriented voters including majority, median, and linear predictor voters within a Triple Modular Redundant, TMR, system for a wide range of error scenarios. The correctness of the voter model is also proved by comparing the experimental results of selected component-oriented voters with those of the corresponding directly implemented voters. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： component-orientated software fault-tolerance voting algorithms

来源：评论

学校读者我要写书评

暂无评论

STOCHASTIC PETRI NET ANALYSIS OF A REPLICATED FILE SYSTEM

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1989年第4期15卷 394-401页

作者： DUGAN, JB CIARDO, G Department of Computer Science Duke University Durham NC 27706 Software Productivity Consortium Herndon VA

We present a stochastic Petri net model of a replicated file system in a distributed environment where replicated files reside on different hosts and a voting algorithm is used to maintain consistency. Witnesses, which simply record the status of the file but contain no data, may be used in addition to or in place of files to reduce overhead. We present a model sufficiently detailed to include file status (current or out-of-date) as well as failure and repair of hosts where copies or witnesses reside. The number of copies and witnesses is not fixed, but is a parameter of the model. Two different majority protocols are examined, one where a majority of all copies and witnesses is necessary to form a quorum, the other where only a majority of the copies and witnesses or operational hosts is needed. The latter, known as adaptive voting, is shown to increase file availability in most cases. We also investigate the process of selection of copies and witnesses to participate in an update when more than the majority is available and show the inherent performance/reliability tradeoffs. [ABSTRACT FROM AUTHOR]

关键词： Availability analysis distributed file system Petri net replicated file system stochastic Petri net voting algorithms

来源：评论

学校读者我要写书评

暂无评论

Velocity Sensor Fault-Tolerant Controller for Induction Machine Using Intelligent voting Algorithm

引用

ENERGIES 2022年第9期15卷 3084-3084页

作者： Alyoussef, Fadi Akrad, Ahmad Sehab, Rabia Morel, Cristina Kaya, Ibrahim Dicle Univ Inst Nat & Appl Sci Elect & Elect Engn Dept TR-21280 Diyarbakir Turkey Ecole Super Tech Aeronaut & Construct Automobile ESTACA Lab F-53000 Laval France Dicle Univ Fac Engn Elect & Elect Engn Dept TR-21280 Diyarbakir Turkey

Nowadays, induction machines (IMs) are widely used in industrial and transportation applications (electric or hybrid ground vehicle or aerospace actuators) thanks to their significant advantages in comparison to other technologies. Indeed, there is a large demand for IMs because of their reliability, robustness, and cost-effectiveness. The objective of this paper is to improve the reliability and performance of the three-phase induction machine in case of mechanical sensor failure. Moreover, this paper will discuss the development and proposal of a fault-tolerant controller (FTC), based on the combination of a vector controller, two virtual sensors (an extended Kalman filter, or EKF, and a sliding mode observer, or SMO) and a neural voting algorithm. In this approach, the vector controller is based on a new structure of a back-stepping sliding mode controller, which incorporates a double integral sliding surface to improve the performance of the induction machine in faulty operation mode. More specifically, this controller improves the machine performance in terms of having a fast response, fewer steady-state errors, and a robust performance in the existence of uncertainty. In addition, two voting algorithms are suggested in this approach. The first is based on neural networks, which are insensitive to parameter variations and do not need to set a threshold. The second one is based on fuzzy logic. Finally, validation is carried out by simulations in healthy and faulty operation modes to prove the feasibility of the proposed FTC.

关键词： induction machine mechanical sensor failure fault-tolerant control sensorless control back-stepping controller sliding mode observer extended kalman filter neural networks fuzzy logic voting algorithms reliability performance

来源：评论

学校读者我要写书评

暂无评论

Global localization in SLAM in bilinear time

Global localization in SLAM in bilinear time

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Paz, LM Piniés, P Neira, J Tardós, JD Univ Zaragoza Dept Comp Sci Zaragoza 50018 Spain

ISBN: (纸本)0780389123

In this paper we study the global localization problem in SLAM: the determination of the vehicle location in a previously mapped environment with no other prior information. We show that, using a grid sampling representation of the configuration space, it is possible to evaluate all vehicle location hypotheses in the environment (up to a certain resolution) with a computational cost that is bilinear: linear both in the number of map features and in the number of sensor measurements. We propose a pairing-driven algorithm that considers only individual measurement-feature pairings and thus, in contrast with current correspondence space algorithms, it avoids searching in the exponential correspondence space. It uses a voting strategy that accumulates evidence for each vehicle location hypothesis, assuring robustness to noise in the sensor measurements and environment models. The general nature of the proposed strategy allows the consideration of different types of features and sensor measurements. Using the popular Victoria Park dataset, we compare its performance with location-driven algorithms where the solution space is usually randomly sampled. We show that the proposed pairing-driven technique is computationally more efficient in proportion to the density of features in the environment.

关键词： SLAM global localization grid sampling voting algorithms

来源：评论

学校读者我要写书评

暂无评论

Thyroid prediction using ensemble data mining techniques

引用

International Journal of Information Technology (Singapore) 2022年第3期14卷 1273-1283页

作者： Yadav, Dhyan Chandra Pal, Saurabh VBS Purvanchal University (VBSPU) UP Jaunpur India Department of MCA VBS Purvanchal University (VBSPU) Jaunpur India

Data mining algorithms provide easy way to solve problem in medical data analysis. Data mining supports in complex data analysis to identify each issue in dataset. Now-a-days every person suffers for a good heath. The life style of every person is very fast so it is very difficult to maintain his health. Every person cannot easily maintain the hormone system in the body. Nowadays hormone disturbance are major issue in ladies. The major issues behind thyroids are hormonal disturbance. Initially we do not care the symptom of thyroids. If we have some knowledge about thyroid symptom then prior of major problem we protect his life. The symptoms of thyroid are very similar so we easily can not eliminate for identification. Data mining provide major help in thyroid dataset with different algorithms for classification, clustering, association etc. We use different types of machine learning meta classifier algorithms for thyroid dataset classification. In this analysis we analyze thyroid large and complex dataset by data mining meta classifier algorithm: Boosting, Bagging, Stacking and voting with new ensemble model and con comparing classification accuracy, sensitivity and specificity. We easily classify thyroid dataset in different class level. Thyroid is a very common disease found in the human body, which is related to human diet and daily living with the help of classification algorithms, they can be avoided by studying various types of functions in thyroid, with the help of classification, after the disease consisting of experienced doctor walking expert system can be developed. © 2019, Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： Bagging Boosting Data mining meta classifier algorithms Stacking voting algorithms

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Technique for Endogenously Silencing a Specific Human Gene by siRNA

An Intelligent Technique for Endogenously Silencing a Specif...

引用

3rd International Conference on E-Health and Bioengineering (EHB)

作者： Abdel-Rahman, Mohammad H. Youssif, Aliaa A. A. Ghaleb, Fayed F. M. Salem, Abdel-Badeeh M. Ain Shams Univ Fac Sci Dept Math Cairo Egypt Ain Shams Univ Fac Comp & Informat Sci Dept Comp Sci Cairo Egypt Helwan Univ Fac Comp & Informat Sci Dept Comp Sci Cairo Egypt

ISBN: (纸本)9781457702921

The use of short interfering RNA (siRNA) is an emerging powerful method for gene silencing. siRNA is a short RNA sequence that targets mRNA and causes the sequence-specific degradation of the mRNA. Despite its importance, few efforts have been made to develop algorithms and computational tools to detect genes controlled by siRNA process. This paper introduces an algorithm that uses an intelligent technique based on voting to determine whether a specific gene can be endogenously controlled by the cell using a siRNA sequence. When applying the proposed algorithm;the experimental results show that it requires relatively small memory space (not more than 70 MB) and in less than 3 minutes to determine whether a human gene can endogenously controlled. This makes the proposed algorithm practical to run into large genomes, specially the Human genome, and its specificity for only single gene increases its medical benefit as a tool for detecting treatments for specific diseases.

关键词： Gene silencing siRNA Hashing algorithms voting algorithms ESSG problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：