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

32nd International Conference on Computer-Aided Verification (CAV)

作者： Gan, Ting Xia, Bican Xue, Bai Zhan, Naijun Dai, Liyun Wuhan Univ Sch Comp Sci Wuhan Peoples R China Peking Univ Sch Math Sci LMAM Beijing Peoples R China Chinese Acad Sci State Key Lab Comp Sci Inst Software Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Southwest Univ Sch Comp & Informat Sci RISE Chongqing Peoples R China

ISBN: (纸本)9783030532888;9783030532871

Craig interpolant generation for non-linear theory and its combination with other theories are still in infancy, although interpolation-based techniques have become popular in the verification of programs and hybrid systems where non-linear expressions are very common In this paper, we first prove that a polynomial interpolant of the form h(x) > 0 exists for two mutually contradictory polynomial formulas phi(x, y) and psi(x, z), with the form f(1) >= 0 Lambda ... Lambda f(n) >= 0, where f(i) are polynomials in x, y or x, z, and the quadratic module generated by f(i) is Archimedean. Then, we show that synthesizing such interpolant can be reduced to solving a semi-definite programming problem (SDP). In addition, we propose a verification approach to assure the validity of the synthesized interpolant and consequently avoid the unsoundness caused by numerical error in SDP solving. Besides, we discuss how to generalize our approach to general semi-algebraic formulas. Finally, as an application, we demonstrate how to apply our approach to invariant generation in program verification.

关键词： Craig interpolant Archimedean condition semi-definite programming Program verification Sum of squares

来源：评论

学校读者我要写书评

暂无评论

An Introduction of a CCA Weighting Matrix to a Closed-Loop Subspace Identification Method

引用

IFAC-PapersOnLine 2021年第7期54卷 761-766页

作者： Kenji Ikeda Hideyuki Tanaka Tokushima University Tokushima 770-8506 Japan Hiroshima University Higashi Hiroshima 739-8524 Japan

This paper introduces a CCA (canonical correlation analysis) weighting matrix to an estimation method of the innovations model previously proposed by the authors. A numerical simulation illustrates that the CCA weighting reduces the covariance of the estimate and that the proposed method gives similar or better performance compared to Closed-Loop MOESP and PBSID. Especially, the design parameter called “past horizon” in the proposed method can be set small compared to Closed-Loop MOESP and PBSID. It is also analyzed how the bias of the estimate is reduced.

关键词： System identification Subspace methods Kalman filters semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Path Disappearance Dection for Millimeter Wave MIMO Channel With Low Time Delay And Little Overhead 5

Path Disappearance Dection for Millimeter Wave MIMO Channel ...

引用

5th International Conference on Mechanical, Control and Computer Engineering (ICMCCE)

作者： Zhang, Jinduo Li, Xiang Beijing Inst Technol Commun & Network Lab Beijing Peoples R China Cent Univ Finance & Econ China Econ & Management Acad Beijing Peoples R China

ISBN: (纸本)9781665423144

In the millimeter wave multi-antenna MIMO system, when the traditional method is used to perform channel measurement before the communication process officially starts, problems such as excessive channel measurement overhead will be faced. The main purpose of this research is to design a new algorithm to solve the problem. In this research, the characteristics such as few millimeter wave paths, the much longer channel angle coherence time, combined with theories such as beamforming, change point detection and others, are exploited to design the effective algorithm. By using the designed algorithm, if the angle of the signal scattering path is unchanged, only a small number of samples will be used to estimate the channel coefficient. In addition, if the angle disappears, the change will be captured with just a small delay. Meanwhile, the relationship between false alarm probability and detection change are also found. Ultimately, the time overhead required for channel measurement is reduced. Through the simulation of the designed algorithm, the correctness and validity of the obtained results are proved.

关键词： Millimeter Wave MIMO System semi-definite programming Beamforming Change Point Detection

来源：评论

学校读者我要写书评

暂无评论

Quasi-AC Optimal Power Flow for VSC-MTDC Systems 4

Quasi-AC Optimal Power Flow for VSC-MTDC Systems

引用

4th IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)

作者： Shi, Chengcheng Tang, Aihong Yang, Huiyuan Yan, Hui Lu, Zhijian Wuhan Univ Technol Sch Automat Wuhan Peoples R China

ISBN: (数字)9781728143903

ISBN: (纸本)9781728143903

The development of DC technology promotes the transformation of AC grid to AC/DC hybrid grid, this means that the existing optimal power flow(OPF) algorithm for only AC grid cannot meet the demand. A quasi-AC solution for OPF of voltage source converter based multi-terminal DC(VSC-MTDC) system is proposed. By analysing the principle of VSC, the equivalent model considering the loss of the converter station is established with AC power supply. Constraints are added to the DC grid to equivalent it to special AC grid. The energy coupling equation of the VSC is linearized to simplify the difficulty. Based on above, the power flow of VSC-MTDC system can be calculated as AC system. Since the OPF problem of AC system is non-convex, the OPF model is relaxed to a semi-definite programming model. The experimental result of the improved IEEE30-bus system shows that the proposed method can extend the OPF solution for traditional AC system to VSC-MTDC system and accurately reflect the internal loss of converter.

关键词： Voltage source converter based multi-terminal DC optimal power flow quasi-AC loss of converter semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Achievable Rate of Multi-Antenna WSRNs with EH Constraint in the presence of a Jammer

Achievable Rate of Multi-Antenna WSRNs with EH Constraint in...

引用

IEEE/CIC International Conference on Communications in China (ICCC)

作者： Tian, Minhan Guo, Wangmei Feng, Guiguo Gao, Jingliang Xidian Univ Sch Telecommun Engn Xian 710071 Peoples R China 20th Res Inst China Elect Technol Grp Corp Xian 710071 Peoples R China

ISBN: (纸本)9781728173276

In this paper, the rate-energy region is studied for the wireless sensor relay network (WSRN) with energy harvesting in the presence of a jammer. In the model, a source communicates to a destination equipped with a single antenna with energy harvesting constraint through a multi-antenna cooperative relay under beamforming. Meanwhile, there is a jammer intended to disturb the communication. The relay works in half-duplex mode and knows all the channel state information (CSI). When beamforming is employed at the relay, the network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). We characterize the achievable rate-energy region. Since the problem is non-convex, we present a stability method to transform it into a semi-definite programming problem (SDP), and the closed-form expression for two special boundary points of the rate-energy region is obtained. Finally, the simulations show the rate-energy region and the anti-jamming performance of the proposed scheme.

关键词： Energy Harvesting Gaussian Arbitrarily Varying Channel Beamforming semi-definite programming the Rate-Energy Region

来源：评论

学校读者我要写书评

暂无评论

FiLoc: Fine-Grained Indoor Localization Using a Single Access Point

FiLoc: Fine-Grained Indoor Localization Using a Single Acces...

引用

IEEE Asia-Pacific Microwave Conference (APMC)

作者： Liu, Kaikai Tian, Zengshan Li, Ze Wang, Jiacheng Zhou, Mu Chongqing Univ Posts & Telecommun Sch Commun & Informat Engn Chongqing 400065 Peoples R China

ISBN: (纸本)9781728169620

This paper presents FiLoc, a single AP-based indoor localization system, which achieves sub-meter accuracy. With ToF measurements, we model the localization process into a quadratically constrained quadratic program problem and then adopt the semi-definite programming (SDP) to solve it. As a result, we can find a global optimum solution corresponding to a location without an accurate initial guess of the target location required in the traditional least-square based algorithm. We implement our system using USRP X310 software-defined radio platform and deploy it in various environments. The extensive experiments show that FiLoc can achieve sub-meter level localization accuracy at 100MHz signal bandwidth.

关键词： Indoor localization Single Access Point semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Bounding Mean First Passage Times in Population Continuous-Time Markov Chains 17th

Bounding Mean First Passage Times in Population Continuous-T...

引用

International Conference on Quantitative Evaluation of Systems (QEST)

作者： Backenkoehler, Michael Bortolussi, Luca Wolf, Verena Saarland Univ Saarbrucken Germany Saarbrucken Grad Sch Comp Sci Saarbrucken Germany Univ Trieste Trieste Italy

ISBN: (纸本)9783030598549;9783030598532

We consider the problem of bounding mean first passage times and reachability probabilities for the class of population continuous-time Markov chains, which capture stochastic interactions between groups of identical agents. The quantitative analysis of such models is notoriously difficult since typically neither state-based numerical approaches nor methods based on stochastic sampling give efficient and accurate results. Here, we propose a novel approach that leverages techniques from martingale theory and stochastic processes to generate constraints on the statistical moments of first passage time distributions. These constraints induce a semi-definite program that can be used to compute exact bounds on reachability probabilities and mean first passage times without numerically solving the transient probability distribution of the process or sampling from it. We showcase the method on some test examples and tailor it to models exhibiting multimodality, a class of particularly challenging scenarios from biology.

关键词： Population continuous-time Markov chains semi-definite programming Exit time distribution Reachability probability Markov population models

来源：评论

学校读者我要写书评

暂无评论

Rational models optimized exactly for solving signal processing problems

Rational models optimized exactly for solving signal process...

引用

作者： Marmin, Arthur Université Paris-Saclay

学位级别：博士

Une vaste classe de problèmes d'optimisation non convexes est celle de l'optimisation rationnelle. Cette dernière apparaît naturellement dans de nombreux domaines tels que le traitement du signal ou le génie des procédés. Toutefois, trouver les optima globaux pour ces problèmes est difficile. Une approche récente, appelée la hiérarchie de Lasserre, fournit néanmoins une suite de problèmes convexes assurée de converger vers le minimum global. Cependant, cette approche représente un défi calculatoire du fait de la très grande dimension de ses relaxations. Dans cette thèse, nous abordons ce défi pour divers problèmes de traitement du *** un premier temps, nous formulons la reconstruction de signaux parcimonieux en un problème d'optimisation rationnelle. Nous montrons alors que ce dernier possède une structure que nous exploitons afin de réduire la complexité des relaxations associées. Nous pouvons ainsi résoudre plusieurs problèmes pratiques comme la restoration de signaux de chromatographie. Nous étendons également notre méthode à la restoration de signaux dans différents contextes en proposant plusieurs modèles de bruit et de signal. Dans une deuxième partie, nous étudions les relaxations convexes générées par nos problèmes et qui se présentent sous la forme de problèmes d'optimisation semi-définie positive de très grandes dimensions. Nous considérons plusieurs algorithmes basés sur les opérateurs proximaux pour les résoudre *** dernière partie de cette thèse est consacrée au lien entre les problèmes d'optimisation polynomiaux et la décomposition de tenseurs symétriques. En effet, ces derniers peuvent être tous deux vus comme une instance du problème des moments. Nous proposons ainsi une méthode de détection de rang et de décomposition pour les tenseurs symétriques basée sur les outils connus en optimisation polynomiale. Parallèlement, nous proposons une technique d'extraction robuste des solutions d'un problème d'optimisation poylnomiale basée su

关键词： Optimisation rationnelle Problème des moments Programmation semi-definie positive Tenseur et décomposition CP Traitement du signal Rational optimization Moment problem semi-definite programming Tensor and CP decomposition Signal processing

来源：评论

学校读者我要写书评

暂无评论

A new hybrid method for optimal circuit design using semi-definite programming

引用

ENGINEERING OPTIMIZATION 2012年第6期44卷 725-740页

作者： Hassan, Abdel-Karim S. O. Abdel-Naby, Ahmed Cairo Univ Fac Engn Dept Engn Math & Phys Giza 12211 Egypt

In this article a new method for yield optimization (design centring) is introduced. The method has a statistical-geometrical nature, hence it is called hybrid. The method exploits the semi-definite programming applications in approximating the feasible region with two bounding ellipsoids. These ellipsoids are obtained using a two phase algorithm. In the first phase, the minimum volume ellipsoid enclosing the feasible region is obtained. The largest ellipsoid that can be inscribed inside the feasible region is obtained in the second phase. The centres of these bounding ellipsoids are used as design centres. In the second phase, an additional polytopic region approximation is constructed. A comparison between the obtained region approximations is given. Saving in the number of circuit simulations needed for yield optimization is also considered. Practical examples are given to show the effectiveness of the new method.

关键词： circuit design design centring semi-definite programming minimum volume ellipsoid maximum volume ellipsoid

来源：评论

学校读者我要写书评

暂无评论

Reset controller synthesis: a correct-by-construction way to the design of CPS

Research Directions: Cyber-Physical Systems

引用

Research Directions: Cyber-Physical Systems 2024年 2卷 e7-e7页

Controller synthesis offers a correct-by-construction methodology to ensure the correctness and reliability of safety-critical cyber-physical systems (CPS). Controllers are classified based on the types of controls they employ, which include reset controllers, feedback controllers and switching logic controllers. Reset controllers steer the behavior of a CPS to achieve system objectives by restricting its initial set and redefining its reset map associated with discrete jumps. Although the synthesis of feedback controllers and switching logic controllers has received considerable attention, research on reset controller synthesis is still in its early stages, despite its theoretical and practical significance. This paper outlines our recent efforts to address this gap. Our approach reduces the problem to computing differential invariants and reach-avoid sets. For polynomial CPS, the resulting problems can be solved by further reduction to convex optimizations. Moreover, considering the inevitable presence of time delays in CPS design, we further consider synthesizing reset controllers for CPS that incorporate delays.

关键词： cyber-physical system controller synthesis reset controller transverse set reach-avoid set differential invariant semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：