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

arXiv 2021年

作者： Ye, Mengbin Anderson, Brian D.O. Janson, Axel Gracy, Sebin Johansson, Karl H. Centre for Optimisation and Decision Science Curtin University Perth Australia School of Engineering Australian National University Canberra Australia Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology and Digital Futures Stockholm Sweden Department of Electrical and Computer Engineering Rice University TX United States

We use a deterministic model to study two competing viruses spreading over a two-layer network in the Susceptible-Infected-Susceptible (SIS) framework, and address a central problem of identifying the winning virus in a "survival-of-the-fittest" battle. Existing sufficient conditions ensure that the same virus always wins regardless of initial states. For networks with an arbitrary but finite number of nodes, there exists a necessary and sufficient condition that guarantees local exponential stability of the two equilibria corresponding to each virus winning the battle, meaning that either of the viruses can win, depending on the initial states. However, establishing existence and finding examples of networks with more than three nodes that satisfy such a condition has remained unaddressed. In this paper, we address both issues for networks with an arbitrary but finite number of nodes. We do this by proving that given almost any network layer of one virus, there exists a network layer for the other virus such that the resulting two-layer network satisfies the aforementioned condition. To operationalize our findings, a four-step procedure is developed to reliably and consistently design one of the network layers, when given the other layer. Conclusions from numerical case studies, including a real-world mobility network that captures the commuting patterns for people between 107 provinces in Italy, extend on the theoretical result and its consequences. Copyright © 2021, The Authors. All rights reserved.

关键词： Viruses

来源：评论

学校读者我要写书评

暂无评论

DSA image registration based on multiscale Gabor filters and mutual information

DSA image registration based on multiscale Gabor filters and...

引用

International Conference on Information and Automation (ICIA)

作者： Zhiguo Cao Xiaoxiao Liu Bo Peng Yiu-Sang Moon Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Chinese University of Hong Kong New Territories Hong Kong China

In clinical practice, digital subtraction angiography (DSA) is a powerful technique for the visualization of blood vessels in X-ray image sequences. Different with traditional DSA image registration processes, in our proposed image registration method, the control points are selected from the vessel centerlines using multiscale Gabor filters, and mutual information (MI) is then taken as the similarity criterion to find the correspondences. Experimental results demonstrate our algorithm efficiently yields satisfying registration result for DSA images.

关键词： Image registration Gabor filters Mutual information Biomedical imaging Angiography Visualization Displacement control Blood vessels Image sequences Pixel

来源：评论

学校读者我要写书评

暂无评论

Circuit Tolerance Design Using an Improved Immune Algorithm

Circuit Tolerance Design Using an Improved Immune Algorithm

引用

International Conference on Innovative Computing, Information and control (ICICIC)

作者： Jinn-Tsong Tsai Wen-Hsien Ho Jyh-Horng Chou Tung-Kuan Liu Department of Computer Science National Ping Tung University of Education Ping Tung Taiwan Department of Medical Information Management Kaohsiung Medical University Kaohsiung Taiwan Institute of System Information and Control National Kaohsiung First University of Science and Technology Kaohsiung Taiwan

In this paper, we apply an improved immune algorithm to solve a circuit tolerance design problem, which has many design parameters and constraints. The evolutionary design approach, called a Taguchi immune algorithm (TIA), with a penalty function is proposed for solving the constrained optimization problem. The proposed TIA approach with a penalty function is effectively applied to solve the circuit tolerance design problem.

关键词： Circuits Algorithm design and analysis Immune system Constraint optimization Design optimization Yield estimation Radio frequency computer science Health information management Medical control systems

来源：评论

学校读者我要写书评

暂无评论

Wireless sensor network scheduling for remote estimation under energy constraints

Wireless sensor network scheduling for remote estimation und...

引用

IEEE Annual Conference on Decision and control

作者： Takuya Iwaki Yuchi Wu Junfeng Wu Henrik Sandberg Karl Henrik Johansson ACCESS Linnaeus Centre KTH Royal Institute of Technology Stockholm Sweden Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong College of Control Science and Engineering Zhejiang University Hangzhou P. R. China

This paper studies a design problem of how a group of wireless sensors are selected and scheduled to transmit data efficiently over a multi-hop network subject to energy-saving consideration, when they are observing multiple independent discrete-time linear systems. Each time instant, some sensors are selected to transmit their measurements to a remote estimator. We formulate an optimization problem, minimizing a linear combination of the averaged estimation error and the averaged transmission energy consumption to obtain suitable network scheduling and estimation algorithms. Necessary conditions for optimality are derived and these conditions help trim the feasible solution space so that the optimal solution can be computed efficiently. A numerical example is provided to demonstrate the theoretical results.

关键词： Wireless sensor networks Sensor systems Job shop scheduling Energy consumption Logic gates Estimation

来源：评论

学校读者我要写书评

暂无评论

Two-Layer Distributed Formation-Containment control of Multiple Euler-Lagrange Systems by Output Feedback

引用

IEEE Transactions on Cybernetics 2018年第2期49卷 675-687页

作者： Li, Dongyu Zhang, Wei He, Wei Li, Chuanjiang Ge, Shuzhi Sam Department of Control Science and Engineering Harbin Institute of Technology Harbin150001 China Shanghai Institute of Satellite Engineering Shanghai Key Laboratory of Deep Space Exploration Technology Shanghai201109 China School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Department of Electrical and Computer Engineering National University of Singapore Singapore117576 Singapore

This paper addresses the distributed formation-containment (DFC) problem for multiple Euler-Lagrange systems with model uncertainties via output feedback in both constant and time-varying formation cases. First, a novel definition of the DFC problem is proposed using a two-layer framework. Since only parts of the followers can acquire the states of the dynamic leader, we design a distributed finite-time sliding-mode estimator to obtain accurate estimations of the desired position and velocity for each agent. Next, to deal with the absence of velocity sensors, we propose two DFC control laws combined with the high-gain observer for the leaders and the followers, respectively, while the time-varying formation in the first layer and the leader-based containment in the second layer can be achieved. Further, the adaptive neural networks are applied to deal with the model uncertainties due to their superior approximation capability. The uniform ultimate boundedness of all the state errors can be guaranteed by Lyapunov stability theory. In addition, a unified framework is given which can be transformed to four other basic distributed problems. Finally, simulation examples are presented to illustrate the feasibility of the theoretical results. © 2013 IEEE.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Image Annotation Method Based on SVM and Semi-supervised EM

引用

Acta Automatica Sinica 2010年第7期36卷 960-967页

作者： Yan-Yu Gao Yi-Xin YIN Takashi UOZUMI School of Information Engineering University of Science and Technology Beijing Beijing 100083 P. R. China Key Laboratory of Advanced Control of Iron and Steel Process (Ministry of Education) University of Science and Technology Beijing Beijing 100083 P. R. China Department of Computer Science and Systems Engineering Muroran Institute of Technology Muroran 050-8585 Japan

Automatic image annotation, which aims at automatically identifying and then assigning semantic keywords to the meaningful objects in a digital image, is not a very difficult task for human but has been regarded as a difficult and challenging problem to machines. In this paper, we present a hierarchical annotation scheme considering that generally human s visual identification to a scenery object is a rough-to-fine hierarchical process. First, the input image is segmented into multiple regions and each segmented region is roughly labeled with a general keyword using the multi-classification support vector machine. Since the results of rough annotation affect fine annotation directly, we construct the statistical contextual relationship to revise the improper labels and improve the accuracy of rough annotation. To obtain reasonable fine annotation for those roughly classified regions, we propose an active semi-supervised expectation-maximization algorithm, which can not only find the representative pattern of each fine class but also classify the roughly labeled regions into corresponded fine classes. Finally, the contextual relationship is applied again to revise the improper fine labels. To illustrate the effectiveness of the presented approaches, a prototype image annotation system is developed, the preliminary results of which showed that the hierarchical annotation scheme is effective.

关键词： Hierarchical image annotation support vector machine (SVM) semi-supervised expectation-maximization coexistence relative location relationship

来源：评论

学校读者我要写书评

暂无评论

Quotient kinematics machines: Concept, analysis and synthesis

Quotient kinematics machines: Concept, analysis and synthesi...

引用

2008 IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Yuanqing Wu Zexiang Li Han Ding Yunjiang Lou Mechanical Engineering School Shanghai Jiaotong University Shanghai China Department of Electrical Engineering and Computer Science University of Science and Technology of Hong Kong Kowloon Hong Kong China Shenzhen Graduate School Control and Mechatronics Engineering Harbin Institute of Technology China

ISBN: (纸本)9781424420575

In mechanism and machine design, the notion of serial kinematics machine (SKM), parallel kinematics machine (PKM) and hybrid kinematics machine (HKM) is well understood. In this paper, we introduce a fourth type of kinematics machine, known as quotient kinematics machine(QKM). A QKM generating a subgroup motion G consists of two mechanisms (or motion modules) acting in unison, one synthesizing a subgroup H of G, and another that of a complement of G/H. Apparently, the two motion modules of a QKM have simpler kinematic structures than that of a SKM, PKM or HKM with the same motion type G, and thus is expected to have performance advantages in terms of stiffness (speed and accuracy), modularity and etc, over its SKM/PKM/HKM counterparts. The formulation of the QKM concept and its analysis and synthesis are considered in this paper.

关键词： Kinematics Joints Generators Robots Manifolds Geometry Educational institutions

来源：评论

学校读者我要写书评

暂无评论

An Approximated Domination Relationship based on Binary Classifiers for Evolutionary Multiobjective Optimization

An Approximated Domination Relationship based on Binary Clas...

引用

Congress on Evolutionary Computation

作者： Hao Hao Aimin Zhou Hu Zhang Shanghai Key Laboratory of Multidimensional Information Processing School of Computer Science and Technology East China Normal University Shanghai China Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory Beijing Electro-mechanical Engineering Institute Beijing China

Preselection is an important strategy to improve evolutionary algorithms’ performance by filtering out unpromising solutions before fitness evaluations. This paper introduces a pre-selection strategy based on an approximated Pareto domination relationship for multiobjective evolutionary optimization. For each objective, a binary relation between each pair of solutions is constructed based on the current population, and a binary classifier is built based on the binary relation pairs. In this way, an approximated Pareto domination relationship can be defined. When new trial solutions are generated, the approximated Pareto domination is used to select promising solutions, which shall be evaluated by the real objective functions. The new preselection is integrated into two algorithms. The experimental results on two benchmark test suites suggest that the algorithms with preselection outperform their original ones.

关键词： Filtering Computational modeling Sociology Training data Evolutionary computation Approximation algorithms Linear programming

来源：评论

学校读者我要写书评

暂无评论

Home-Based Mobile Cardio-Pulmonary Rehabilitation Consultant System

Home-Based Mobile Cardio-Pulmonary Rehabilitation Consultant...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： Hsu-En Lee Wen-Chih Wang Shao-Wei Lu Bo-Yuan Wu Li-Wei Ko Department of Computer Science and Brain Research Center National Chiao Tung University Institute of electrical Control Engineering and Brain Research Center National Chiao Tung University Brain Research Center and Department of Biological Science and Technology National Chiao Tung University

ISBN: (纸本)9781424441211

Cardiovascular diseases are the most popular cause of death in the world recently. For postoperatives, cardiac rehabilitation is still asked to maintain at home (phase II) to improve cardiac function. However, only one third of outpatients do the exercise regularly, reflecting the difficulty for home-based healthcare: lacking of monitoring and motivation. Hence, a cardio-pulmonary rehabilitation system was proposed in this research to improve rehabilitation efficiency for better prognosis. The proposed system was built on mobile phone and receiving electrocardiograph (ECG) signal from a wireless ECG holter via Bluetooth connection. Apart from heart rate (HR) monitor, an ECG derived respiration (EDR) technique is also included to provide respiration rate (RR). Both HR and RR are the most important vital signs during exercise but only used one physiological signal recorder in this system. In clinical test, there were 15 subjects affording Bruce Task (treadmill) to simulate rehabilitation procedure. Correlation between this system and commercial product (Custo-Med) was up to 98% in HR and 81% in RR. Considering the prevention of sudden heart attack, an arrhythmia detection expert system and healthcare server at the backend were also integrated to this system for comprehensive cardio-pulmonary monitoring whenever and wherever doing the exercise.

关键词： Electrocardiography Heart Rate electrochemical grinding Exercise Clinical Trial Rehabilitation Lake Restoration Mobile phones Cardiovascular Diseases Outpatients Cause of Death Consultant Vital Signs

来源：评论

学校读者我要写书评

暂无评论

Shifting paths to avoidable ones

arXiv

引用

arXiv 2020年

作者： Gurvich, Vladimir Krnc, Matjaž Milanič, Martin Vyalyi, Mikhail National Research University Higher School of Economics FAMNIT University of Primorska FAMNIT IAM University of Primorska National Research University Higher School of Economics Moscow Institute of Physics and Technology Federal Research Center "Computer Science and Control" The Russian Academy of Science

An extension of an induced path P in a graph G is an induced path P' such that deleting the endpoints of P' results in P. An induced path in a graph is said to be avoidable if each of its extensions is contained in an induced cycle. In 2019, Beisegel, Chudovsky, Gurvich, Milanič, and Servatius conjectured that every graph that contains an induced k-vertex path also contains an avoidable induced path of the same length, and proved the result for k = 2. The case k = 1 was known much earlier, due to a work of Ohtsuki, Cheung, and Fujisawa in 1976. The conjecture was proved for all k in 2020 by Bonamy, Defrain, Hatzel, and Thiebaut. In the present paper, using a similar approach, we strengthen their result from a reconfiguration point of view. Namely, we show that in every graph, each induced path can be transformed to an avoidable one by a sequence of shifts, where two induced k-vertex paths are shifts of each other if their union is an induced path with k + 1 vertices. We also obtain analogous results for not necessarily induced paths and for walks. In contrast, the statement cannot be extended to trails or to isometric *** Codes 05C38, 05C12, 05C05, 05C76 Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：