Push Operation

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 51 Experts worldwide ranked by ideXlab platform

Sagnik Sen - One of the best experts on this subject based on the ideXlab platform.

  • erratum to on oriented cliques with respect to Push Operation discrete appl math 232 2017 50 63
    Discrete Applied Mathematics, 2019
    Co-Authors: Julien Bensmail, Soumen Nandi, Sagnik Sen
    Abstract:

    Abstract An error is spotted in the statement of Theorem 1.3 of our published article titled “On oriented cliques with respect to Push Operation” (Discrete Applied Mathematics 2017). The theorem provided an exhaustive list of 16 minimal (up to spanning subgraph inclusion) underlying planar Push cliques. The error was that, one of the 16 graphs from the above list was missing an arc. We correct the error and restate the corrected statement in this article. We also point out the reason for the error and comment that the error occurred due to a mistake in a particular lemma. We present the corrected proof of that particular lemma as well. Moreover, a few counts were wrongly reported due to the above mentioned error. So we update our reported counts after correction in this article.

  • On oriented cliques with respect to Push Operation
    Discrete Applied Mathematics, 2017
    Co-Authors: Julien Bensmail, Soumen Nandi, Sagnik Sen
    Abstract:

    An oriented graph is a directed graph without any directed cycle of length at most 2. An oriented clique is an oriented graph whose non-adjacent vertices are connected by a directed 2-path. To Push a vertex v of a directed graph G is to change the orientations of all the arcs incident to v. A Push clique is an oriented clique that remains an oriented clique even if one Pushes any set of vertices of it. We show that it is NP-complete to decide if an undirected graph is the underlying graph of a Push clique or not. We also prove that a planar Push clique can have at most 8 vertices and provide an exhaustive list of planar Push cliques.

  • On homomorphisms of oriented graphs with respect to the Push Operation
    Discrete Mathematics, 2017
    Co-Authors: Sagnik Sen
    Abstract:

    An oriented graph G is a directed graph without directed cycles of length at most 2 having set of vertices V(G) and set of arcs A(G). To Push a vertex of an oriented graph is to reverse the orientation of the arcs incident to that vertex. If G can be obtained by Pushing a set of vertices of G, then we say G is in a Push relation with G. A mapping f:V(G)V(H) is a Pushable homomorphism of G to H if there exists a G which is in a Push relation with G such that uvA(G) implies f(u)f(v)A(H). Klostermeyer and MacGillivray (2004) introduced Pushable homomorphism and defined the Pushable chromatic number of an oriented graph G as the minimum cardinality of V(H) such that G admits a Pushable homomorphism to an oriented graph H. In this article, we further study the same topic and answer some of the questions asked in the above mentioned work, including studies of Pushable chromatic numbers for the family of outerplanar graphs with girth restrictions, cactus, planar graphs and planar graphs with girth at least eight.

  • on oriented cliques with respect to Push Operation
    arXiv: Combinatorics, 2015
    Co-Authors: Julien Bensmail, Soumen Nandi, Sagnik Sen
    Abstract:

    To Push a vertex $v$ of a directed graph $\overrightarrow{G}$ is to change the orientations of all the arcs incident with $v$. An oriented graph is a directed graph without any cycle of length at most 2. An oriented clique is an oriented graph whose non-adjacent vertices are connected by a directed 2-path. A Push clique is an oriented clique that remains an oriented clique even if one Pushes any set of vertices of it. We show that it is NP-complete to decide if an undirected graph is underlying graph of a Push clique or not. We also prove that a planar Push clique can have at most 8 vertices. We also provide an exhaustive list of minimal (with respect to spanning subgraph inclusion) planar Push cliques.

Mona M Hella - One of the best experts on this subject based on the ideXlab platform.

  • triple Push Operation for combined oscillation divison functionality in millimeter wave frequency synthesizers
    Custom Integrated Circuits Conference, 2010
    Co-Authors: Burak Catli, Mona M Hella
    Abstract:

    This paper proposes the use of N-Push Operation for combining the functions of the VCO and divider in the mm-wave frequency range. If employed in a PLL, the combined VCO/divider (C-VCO/D) would potentially provide wider tuning range than traditional mm-wave PLLs employing injection locked frequency dividers, thus exploiting the full range available in the 60 GHz band (57 GHz-64 GHz). The behavior of triple Push oscillators based on injection locking theory is analyzed to study their various oscillation modes, their stability and the effect of mismatch on the oscillator performance. Design guidelines are provided for boosting the third harmonic power at a given power budget. Using 130 nm IBM CMOS technology, multiple versions of the triple Push oscillator are implemented and characterized. A 55 GHz-65 GHz tuning range is obtained using a 206 pH tank inductance and requires I core = 20 mA, and I buffer = 15 mA from a 1.4 V supply. For a tank inductance of 140 pH, a 63.2 GHz-72.4 GHz tuning range is obtained using I core = 17 mA, and I buffer = 18 mA with a phase noise of -91 dBc/Hz at 10 MHz from the 63.2 GHz carrier and -95 dBc/Hz at 10 MHz from the 72.4 GHz carrier.

  • a 60 ghz cmos combined mm wave vco divider with 10 ghz tuning range
    Custom Integrated Circuits Conference, 2009
    Co-Authors: Burak Catli, Mona M Hella
    Abstract:

    This paper proposes the use of N-Push Operation for combining the functions of the VCO and dividers in the mm-wave frequency range. If employed in a PLL, the combined VCO/divider (C-VCO/D) would potentially provide wider tuning range than traditional mm-wave PLLs employing injection locked frequency dividers, thus exploiting the full range available in the 60GHz band (57GHz–64GHz). The C-VCO/D is fabricated in 130nm IBM CMOS technology and achieves a tuning range from 55GHz-65GHz using a VDD=1.5V, I core =20mA, and I buffer =15mA. The C-VCO/D has a phase noise of 97.1 dBc/Hz at 1MHz Offset.

Weizhi Huang - One of the best experts on this subject based on the ideXlab platform.

  • assembly of micro 3 d components on soi wafers using novel su 8 locking mechanisms and vertical one Push Operation
    IEEE Journal of Selected Topics in Quantum Electronics, 2009
    Co-Authors: Yi Chiu, Weizhi Huang
    Abstract:

    A novel out-of-plane assembly technique of 3-D microstructures is proposed and demonstrated by using simple vertical one-Push Operations. This one-Push method has large probe positioning tolerance in both vertical and lateral directions to reduce the overall complexity of the assembly process. Micromirrors and corner cube reflectors are fabricated on silicon-on-insulator wafers using SU-8 photoresist as a second structure layer in a low-temperature process. Batch assembly of multiple mirrors assembled simultaneously is demonstrated.

Burak Catli - One of the best experts on this subject based on the ideXlab platform.

  • triple Push Operation for combined oscillation divison functionality in millimeter wave frequency synthesizers
    Custom Integrated Circuits Conference, 2010
    Co-Authors: Burak Catli, Mona M Hella
    Abstract:

    This paper proposes the use of N-Push Operation for combining the functions of the VCO and divider in the mm-wave frequency range. If employed in a PLL, the combined VCO/divider (C-VCO/D) would potentially provide wider tuning range than traditional mm-wave PLLs employing injection locked frequency dividers, thus exploiting the full range available in the 60 GHz band (57 GHz-64 GHz). The behavior of triple Push oscillators based on injection locking theory is analyzed to study their various oscillation modes, their stability and the effect of mismatch on the oscillator performance. Design guidelines are provided for boosting the third harmonic power at a given power budget. Using 130 nm IBM CMOS technology, multiple versions of the triple Push oscillator are implemented and characterized. A 55 GHz-65 GHz tuning range is obtained using a 206 pH tank inductance and requires I core = 20 mA, and I buffer = 15 mA from a 1.4 V supply. For a tank inductance of 140 pH, a 63.2 GHz-72.4 GHz tuning range is obtained using I core = 17 mA, and I buffer = 18 mA with a phase noise of -91 dBc/Hz at 10 MHz from the 63.2 GHz carrier and -95 dBc/Hz at 10 MHz from the 72.4 GHz carrier.

  • a 60 ghz cmos combined mm wave vco divider with 10 ghz tuning range
    Custom Integrated Circuits Conference, 2009
    Co-Authors: Burak Catli, Mona M Hella
    Abstract:

    This paper proposes the use of N-Push Operation for combining the functions of the VCO and dividers in the mm-wave frequency range. If employed in a PLL, the combined VCO/divider (C-VCO/D) would potentially provide wider tuning range than traditional mm-wave PLLs employing injection locked frequency dividers, thus exploiting the full range available in the 60GHz band (57GHz–64GHz). The C-VCO/D is fabricated in 130nm IBM CMOS technology and achieves a tuning range from 55GHz-65GHz using a VDD=1.5V, I core =20mA, and I buffer =15mA. The C-VCO/D has a phase noise of 97.1 dBc/Hz at 1MHz Offset.

Julien Bensmail - One of the best experts on this subject based on the ideXlab platform.

  • erratum to on oriented cliques with respect to Push Operation discrete appl math 232 2017 50 63
    Discrete Applied Mathematics, 2019
    Co-Authors: Julien Bensmail, Soumen Nandi, Sagnik Sen
    Abstract:

    Abstract An error is spotted in the statement of Theorem 1.3 of our published article titled “On oriented cliques with respect to Push Operation” (Discrete Applied Mathematics 2017). The theorem provided an exhaustive list of 16 minimal (up to spanning subgraph inclusion) underlying planar Push cliques. The error was that, one of the 16 graphs from the above list was missing an arc. We correct the error and restate the corrected statement in this article. We also point out the reason for the error and comment that the error occurred due to a mistake in a particular lemma. We present the corrected proof of that particular lemma as well. Moreover, a few counts were wrongly reported due to the above mentioned error. So we update our reported counts after correction in this article.

  • On oriented cliques with respect to Push Operation
    Discrete Applied Mathematics, 2017
    Co-Authors: Julien Bensmail, Soumen Nandi, Sagnik Sen
    Abstract:

    An oriented graph is a directed graph without any directed cycle of length at most 2. An oriented clique is an oriented graph whose non-adjacent vertices are connected by a directed 2-path. To Push a vertex v of a directed graph G is to change the orientations of all the arcs incident to v. A Push clique is an oriented clique that remains an oriented clique even if one Pushes any set of vertices of it. We show that it is NP-complete to decide if an undirected graph is the underlying graph of a Push clique or not. We also prove that a planar Push clique can have at most 8 vertices and provide an exhaustive list of planar Push cliques.

  • on oriented cliques with respect to Push Operation
    arXiv: Combinatorics, 2015
    Co-Authors: Julien Bensmail, Soumen Nandi, Sagnik Sen
    Abstract:

    To Push a vertex $v$ of a directed graph $\overrightarrow{G}$ is to change the orientations of all the arcs incident with $v$. An oriented graph is a directed graph without any cycle of length at most 2. An oriented clique is an oriented graph whose non-adjacent vertices are connected by a directed 2-path. A Push clique is an oriented clique that remains an oriented clique even if one Pushes any set of vertices of it. We show that it is NP-complete to decide if an undirected graph is underlying graph of a Push clique or not. We also prove that a planar Push clique can have at most 8 vertices. We also provide an exhaustive list of minimal (with respect to spanning subgraph inclusion) planar Push cliques.