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

2011 1st Middle East Conference on Biomedical engineering, MECBME 2011

作者： Motalova, Leona Krejcar, Ondrej Polak, Tomas Janckulik, Dalibor Cernohorsky, Jindrich Dept. of Measurement and Control Technical University of Ostrava Faculty of Electrical Engineering and Computer Science Ostrava Czech Republic

ISBN: (纸本)9781424470006

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A Game-Theoretical Approach to Cyber-Security of Critical Infrastructures Based on Multi-Agent Reinforcement Learning 26

A Game-Theoretical Approach to Cyber-Security of Critical In...

引用

26th Mediterranean Conference on control and Automation, MED 2018

作者： Panfili, Martina Giuseppi, Alessandro Fiaschetti, Andrea Al-Jibreen, Homoud B. Pietrabissa, Antonio Delli Priscoli, Franchisco Dept. of Computer Control and Management Engineering University of Rome Sapienza via Ariosto 25 Rome00185 Italy

ISBN: (纸本)9781538678909

This paper presents a control strategy for Cyber-Physical System defense developed in the framework of the European Project ATENA, that concerns Critical Infrastructure (CI) protection. The aim of the controller is to find the optimal security configuration, in terms of countermeasures to implement, in order to address the system vulnerabilities. The attack/defense problem is modeled as a multi-agent general sum game, where the aim of the defender is to prevent the most damage possible by finding an optimal trade-off between prevention actions and their costs. The problem is solved utilizing Reinforcement Learning and simulation results provide a proof of the proposed concept, showing how the defender of the protected CI is able to minimize the damage caused by his her opponents by finding the Nash equilibrium of the game in the zero-sum variant, and, in a more general scenario, by driving the attacker in the position where the damage she/he can cause to the infrastructure is lower than the cost it has to sustain to enforce her/his attack strategy. © 2018 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Packet parsing problem solving on mobile low energy client of Biotelemetry system

Packet parsing problem solving on mobile low energy client o...

引用

2011 1st Middle East Conference on Biomedical engineering, MECBME 2011

作者： Janckulik, Dalibor Motalova, Leona Krejcar, Ondrej Cernohorsky, Jindrich Dept. of Measurement and Control Technical University of Ostrava Faculty of Electrical Engineering and Computer Science Ostrava Czech Republic

ISBN: (纸本)9781424470006

The most important parts of our Biotelemetry system is a hardware platform. If we could develop visualization, we must have to measure real data. They are two main choices to solve this part of system. We can use commercial devices, such as embedded PCs, PDAs and wireless ECG unit Blue ECG communicating via Bluetooth. Suggests major problems and disadvantages of their use and offers possible solutions in the form of construction of our own purpose-built equipment. Whether in the form of small auxiliary hardware and design options ECG units optimized for low power consumption and collaboration with mobile devices with limited computing capabilities. We also describe here the real-time response time of packet parsing problem. © 2011 IEEE.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

Ground truth acquisition of humanoid soccer robot behaviour

Ground truth acquisition of humanoid soccer robot behaviour

引用

17th RoboCup International Symposium, RoboCup 2013

作者： Pennisi, Andrea Bloisi, Domenico D. Iocchi, Luca Nardi, Daniele Dept. of Computer Control and Management Engineering Sapienza University of Rome via Ariosto 25 00185 Rome Italy

ISBN: (纸本)9783662444672

In this paper an open source software for monitoring humanoid soccer robot behaviours is presented. The software is part of an easy to set up system, conceived for registering ground truth data that can be used for evaluating and testing methods such as robot coordination and localization. The hardware architecture of the system is designed for using multiple low-cost visual sensors (four Kinects). The software includes a foreground computation module and a detection unit for both players and ball. A graphical user interface has been developed in order to facilitate the creation of a shared multi-camera plan view, in which the observations of players and ball are re-projected to obtain global positions. The effectiveness of the implemented system has been proven using a laser sensor to measure the exact position of the objects of interest in the field. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Empowering citizens by a blockchain-Based Robinson list

引用

International Journal of computers and Applications 2022年第10期44卷 920-928页

作者： Cirillo, Albenzio Dalena, Vito Mauro, Antonio Mogavero, Francesco Pennino, Diego Pizzonia, Maurizio Vitaletti, Andrea Zecchini, Marco Fondazione Ugo Bordoni Roma Italy Roma Tre University–Eng. Dept. Roma Italy Sapienza University of Rome Department of Computer Control and Management Engineering Roma Italy

Robinson lists are adopted in many countries to protect phone subscribers against commercial spam calls. In its essence, they collect the denial of the subscribers to be contacted by marketing operators. Nowadays, all Robinson lists run as centralised services. Namely, citizens have to rely on trusted third parties for the management of their own choices. The Blockchain allows us to envision the development of a decentralised Robinson list in which citizens are finally empowered to autonomously manage their choices. In this paper, we present a proof-of-concept (PoC) of a decentralised Robinson list developed with the Algorand technology. To the best of our knowledge, this is the first attempt to implement a Robinson list on a blockchain technology. The PoC has been designed to support the requirements provided by Fondazione Ugo Bordoni, the manager of the Italian Robinson list. The evaluation of the PoC shows that our decentralised solution provides satisfactory performance, in terms of scalability, latency and costs, when compared to the current centralised service. © 2021 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs 19

Constant-factor approximations for asymmetric TSP on nearly-...

引用

19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016

作者： Marx, Dániel Salmasi, Ario Sidiropoulos, Anastasios Institute of Computer Science and Control Hungarian Academy of Sciences MTA SZTAKI Budapest Hungary Dept. of Computer Science and Engineering Ohio State University ColumbusOH United States Dept. of Computer Science and Engineering Dept. of Mathematics Ohio State University ColumbusOH United States

ISBN: (纸本)9783959770187

In the Asymmetric Traveling Salesperson Problem (ATSP) the goal is to find a closed walk of minimum cost in a directed graph visiting every vertex. We consider the approximability of ATSP on topologically restricted graphs. It has been shown by Oveis Gharan and Saberi [13] that there exists polynomial-Time constant-factor approximations on planar graphs and more generally graphs of constant orientable genus. This result was extended to non-orientable genus by Erickson and Sidiropoulos [8]. We show that for any class of nearly-embeddable graphs, ATSP admits a polynomial-Time constant-factor approximation. More precisely, we show that for any fixed k κ 0, there exist α β > 0, such that ATSP on n-vertex k-nearly-embeddable graphs admits an-Approximation in time O(n). The class of k-nearly-embeddable graphs contains graphs with at most κ apices, κ vortices of width at most k, and an underlying surface of either orientable or non-orientable genus at most κ. Prior to our work, even the case of graphs with a single apex was open. Our algorithm combines tools from rounding the Held-Karp LP via thin trees with dynamic programming. We complement our upper bounds by showing that solving ATSP exactly on graphs of pathwidth κ (and hence on κ-nearly embeddable graphs) requires time nω(κ), assuming the Exponential-Time Hypothesis (ETH). This is surprising in light of the fact that both TSP on undirected graphs and Minimum Cost Hamiltonian Cycle on directed graphs are FPT parameterized by treewidth.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Computing the Shapley value in allocation problems: Approximations and bounds, with an application to the Italian VQR research assessment program 23

Computing the Shapley value in allocation problems: Approxim...

引用

23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA 2016

作者： Lupia, Francesco Mendicelli, Angelo Ribichini, Andrea Scarcello, Francesco Schaerf, Marco Dept. of Computer Science Modeling Electronics and Systems Engineering University of Calabria Rende87036 Italy Dept. of Physics Sapienza University Rome00185 Italy Dept. of Computer Control and Management Engineering Antonio Ruberti Sapienza University Rome00185 Italy

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximized, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to perform a fair allocation taking into account the actual contribution of all agents to the social welfare. Coalitional games provide a formal mathematical framework to model such problems, in particular the Shapley value is a solution concept widely used for assigning worths to agents in a fair way. Unfortunately, computing this value is a #P-hard problem, so that applying this good theoretical notion is often quite difficult in real-world problems. In this paper, we first review the application of the Shapley value to an allocation problem that models the evaluation of the Italian research structures with a procedure known as VQR. For large universities, the problem involves thousands of agents and goods (here, researchers and their research products). We then describe some useful properties that allow us to greatly simplify many such large instances. Moreover, we propose new algorithms for computing lower bounds and upper bounds of the Shapley value, which in some cases provide the exact result and that can be combined with approximation algorithms. The proposed techniques have been tested on large real-world instances of the VQR research evaluation problem.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Particle swarm optimization algorithm based on space mutation and its application

Particle swarm optimization algorithm based on space mutatio...

引用

2009 International Workshop on Intelligent Systems and Applications, ISA 2009

作者： Song, Shengli Kong, Li Zhang, Pu Su, Rijian Dept. of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China Dept. of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou 450002 China

ISBN: (纸本)9781424438945

According to characteristics of particle swarm optimization algorithm, a novel particle swarm optimization algorithm based on adaptive space mutation (ASM-PSO) is proposed. During the searching process, the convergence speed and globally convergence ability is greatly improved by the adaptive space mutation based on the variance of the population's fitness. Experiment results show that the new method, with both a better stability and a steady convergence, not only enhances the local searching efficiency and global searching performance greatly, but also has faster convergence speed and higher precision, and can avoid the premature convergence problem effectively. Most importantly, results demonstrate that ASM-PSO is more feasible and efficient for quality monitoring of laser welding process. © 2009 IEEE.

关键词： Laser beam welding

来源：评论

学校读者我要写书评

暂无评论

A baseline accuracy classification method to over-come the over-fitting problem for class- imbalanced defect-prone datasets model 14

A baseline accuracy classification method to over-come the o...

引用

14th Annual IEEE International Systems Conference, SYSCON 2020

作者： Shaikh, Salahuddin Changan, Liu Malik, Maaz Rasheed Dept. School of Control and Computer Engineering North China Electric Power University Beijing China Dept. Information and Communication Engineering Guilin University of Electronics Technology Guilin China

ISBN: (纸本)9781728153650

Software Engineers are battling always with defects from the earliest starting point of the software history. The defect has significant commitment and assumes an important job in the hour of freeing software. Software defect-prone might be recognized before the software announcement or after the announcement. Although, the desire for designers is to give defect free software to their customers. Hence, recognizing the software defect-prone before announcement makes a decent preferred position for the designers. Here, the difficult assignment is to discover the defect-prone region or defective module of software. On the off chance that defective modules are distinguished before the arrival of software, at that point it could be effectively counteracted and fixed by the designer. In most recent two decades scientists have concentrated on software deformity prophecy issue by applying a few statistical and machine learning systems. The software defect-prone information experiences the class-imbalance issue due to the slanted conveyance of defective and non-defective software modules. Generally, machine learning calculations consider equivalent circulation of information tests in each class and expect the misclassification cost of each class is similarly significant. We have used SMOTE with ONE-R by using its MinBucketsize number n=1, 2, 3, 4, 5 & 6 for over-fit the data and resultant we got that minbucketsize n= 1 & 2 are highly good for base accuracy and efficiency for defect-prone datasets model. We have used datasets model in three different ways and we observed that use training datasets is very suitable for our experiments as compare to other two ways. We also observed that al evaluation measures results are highly good at use of training datasets model. © 2020 IEEE

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

The role of attribute ranker using classification for software defect-prone data-sets model: An empirical comparative study 14

The role of attribute ranker using classification for softwa...

引用

14th Annual IEEE International Systems Conference, SYSCON 2020

作者： Malik, Maaz Rasheed Yining, Liu Shaikh, Salahuddin Dept. Information and Communication Engineering Guilin University of Electronics Technology Guilin China Dept. School of Control and Computer Engineering North China Electric Power University Beijing China

ISBN: (纸本)9781728153650

Feature selection, is an issue firmly identified with size decrease of data-sets model. The target of feature selection is to recognize features in the data-set as significant, and dispose of some other feature as unimportant and repetitive data. Since feature selection diminishes the dimensionality of the data-sets model, it holds out the probability of increasingly successful and quick activity of data mining algorithm which can be worked quicker and all the more adequately by utilizing feature selection. In this research paper we will investigate feature extraction Principal Component Analysis (PCA) with attribute ranker search technique. In practice, Principal Component Analysis with attribute ranker search strategy isn't just used to improve extra storage space or the computational accuracy and efficiency of the classification algorithm, however can likewise enhance the prescient presentation by diminishing the scourge of dimensionality - particularly on the off chance that we are working with software defect-prone or non-defected data-sets models. We have used 10 datasets models, these datasets models basically REPOSITORY model of NASA which contain binary class defected and non-defected datasets models. We have also used 6 classifiers for comparatively analysis between objective model and real datasets model. We illustrated the comparatively analysis between PCA Ranker Search method with No-PCA. We have also compared classifiers efficiency with each other. The most efficient and useful classifier are the Bagging and Multilayer Perceptron at all attribute ranking search method. But the comparatively analysis between the classifiers that Naïve bayes and MultiLayer Perceptron have well increased the correctly classified instances percentage in overall software fault forecast. One more comparison between the PCA Ranker Search Method and No-PCA that is attribute ranker search method is really good for increasing accuracy and efficiency for software fault forecast

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：