linear state bisection is introduced as a new method to find time-invariant state feedback control laws for a special form of underactuated nonlinear systems. the specialty of the systems considered is that every unactuated state should be coupled with at least two directly actuated states. the basic idea is based on bisecting actuated states and using linear combinations with adjustable parame...

Linear state bisection is introduced as a new method to find time-invariant state feedback control laws for a special form of underactuated nonlinear systems. The specialty of the systems considered is that every unactuated state should be coupled with at least two directly actuated states. The basic idea is based on bisecting actuated states and using linear combinations with adjustable parame...

Soft error could cause digital circuit to temporary malfunction. In an asynchronous circuit, the temporary malfunction of the control circuit will cause deadlock; a state where the system will be disabled indefinitely until the system has been reset or the error is filtered or corrected from the system. C-element is most commonly found in control circuit. We have studied the vulnerability of si...

Circuit state bisection is a robust technique to characterize the performance of multi-stage synchronizers. The passage of metastability between synchronizer stages introduces effects that are not captured by small-signal models and thus numerical integration remains the most reliable method for characterizing this behavior. However, the large number of transient simulations required to charact...

We present a multiple ant-colony algorithm (MACA) for the graph bisection problem. The aim of this paper is to compare the performance of the MACA with results on the benchmark graphs from Graph partitioning Archive at the University of Greenwich. Experimental results show that the MACA is comparable with the state-of-the-art graph bisection algorithms.

A bridgeless cubic graph $G$ is said to have a 2-bisection if there exists 2-vertex-colouring of (not necessarily proper) such that: (i) the colour classes same cardinality, and (ii) monochromatic components are either an isolated vertex or edge. In 2016, Ban Linial conjectured that every graph, apart from well-known Petersen admits 2-bisection. paper it was shown Class I bisection. The II grap...

Given an undirected graph G = (V,E), we consider the graph bisection problem, which consists in partitioning the nodes of G in two disjoined sets with p and n− p nodes respectively such that the total weight of edges crossing between subsets is minimal. We apply QCR to it, a general method, presented in [4], which combines semidefinite programming (SDP) and Mixed Integer Quadratic Programming (...

Abstract A bisection of a graph G is partition its vertex set into two parts the same cardinality. k -bisection such that every component each part has at most vertices. Cui and Liu proved claw-free cubic contains 2-bisection. In this paper, we improve result showing 2-bisection with bounded number monochromatic edges, where edge an connecting vertices We also prove our bound best possible for ...