Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    A Class of RF-MEMS Switches with Low Pull-In Voltage

    This paper presents a class comprising three series of Ohmic switches, elucidating their design principles, simulation outcomes and the findings derived from measuring the initial batch of manufactured samples. The design of the membranes employs meandered beams to achieve a small actuation voltage. Initial electro-mechanical simulations, conducted within the Ansys Workbench environment, projected actuation voltages ranging from 5 to 8 Volts, whereas the measured values were marginally higher. The electromagnetic behavior of these devices demonstrated a generally qualitative concordance with simulations performed in the Ansys HFSS environment, exhibiting satisfactory performance in terms of return loss (<20.22dB) and isolation (<14.86dB) across the 5–30GHz frequency spectrum.

  • articleNo Access

    Families of not perfectly straight knots

    We present two families of knots which have straight number higher than crossing number. In the case of the second family, we have computed the straight number explicitly. We also give a general theorem about alternating knots that states adding an even number of crossings to a twist region will not change whether the knots are perfectly straight or not perfectly straight.

  • articleNo Access

    On realizabilty of Gauss diagrams and constructions of meanders

    The problem concerning which Gauss diagrams can be realized by knots is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that the needed conditions for realizability of a Gauss diagram can be interpreted as follows “the number of exits = the number of entrances” and the sufficient condition is based on the Jordan curve theorem. Further, using matrices, we redefine conditions for realizability of Gauss diagrams and then we give an algorithm to construct meanders.