2 citations · 5 across the 8 of their papers we have counts for
8 papers
Tighter Truncated Rectangular Prism Approximation for RNN Robustness Verification
Xingqi Lin, Liangyu Chen, Min Wu +2
Robustness verification is a promising technique for rigorously proving Recurrent Neural Networks (RNNs) robustly. A key challenge is to over-approximate the nonlinear activation f…
Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
Xuefeng Zhang, Liangyu Chen, Zhengfeng Yang +1
Cutting planes (cuts) are crucial for solving Mixed Integer Linear Programming (MILP) problems. Advanced MILP solvers typically rely on manually designed heuristic algorithms for c…
Maximizing the Sum of the Distances between Four Points on the Unit Hemisphere
Zhenbing Zeng, Jian Lu, Yaochen Xu +1
In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*…
Exact Safety Verification of Hybrid Systems Using Sums-Of-Squares Representation
Wang Lin, Min Wu, Zhengfeng Yang +1
In this paper we discuss how to generate inductive invariants for safety verification of hybrid systems. A hybrid symbolic-numeric method is presented to compute inequality inducti…
Generating Loop Invariants by Computing Vanishing Ideals of Sample Points
Bin Wu, Liyong Shen, Min Wu +2
Loop invariants play a very important role in proving correctness of programs. In this paper, we address the problem of generating invariants of polynomial loop programs. We presen…
Vertices in all minimum paired-dominating sets of block graphs
Lei Chen, Changhong Lu, Zhenbing Zeng
Let be a simple graph without isolated vertices. A set is a paired-dominating set if every vertex in has at least one neighbor in and the subgrap…