This paper focuses on the combination of method moments and wire-grid approximation as an effective computational technique for modeling symmetrical antennas with low cost accurate results. The criteria conditions use surface from various sources are presented together new recommendations antenna structures using approximation. These used to calculate characteristics biconical horn at different...

Direct parameter extraction is believed to be the most accurate method for equivalent-circuits modeling of heterojunction bipolar transistors (HBT’s). Using this method, the parasitic elements, followed by the intrinsic elements, are determined analytically. Therefore, the quality of the extrinsic elements extraction plays an important role in the accuracy and robustness of the entire extractio...

New algorithms for deciding the injectivit y of the global update funct ion associat ed with a cellular automaton C A of dimension one are presented. This is done by interpreting each ordered pair dete rmined by the local update function as th e edge of a labeled directed graph GR which has the prope rty that each bi-infinite sequence of states of the cellular automaton is th e sequence of inpu...

— The paper is devote d to the finit e element analysis of second order e Hipt ie eigenvalue problems in the case when the approximate domains Oh are not subdomains of the original domain fl a U. The considérations are restricted to piecewise linear approximations and in the case of eigenfunctions to simple eigenvalues. The optimum rates of convergence for hoth the approximate eigenvalues and t...

Traditionally, invariant assertions are used to verify the partial correctness of while loops with respect to pre/post specifications. In this paper we discuss a related but distinct concept, namely invariant relations, and show how invariant relations are a more potent tool in the analysis of while loops: whereas invariant assertions can only be used to prove partial correctness, invariant rel...

A bst ract. A one-dimensional cellular automaton rule with specified boundary conditions can be considered as acting simultaneously on all finite lattices, which gives a mapping between formal languages. Regular lang uages are always mapped to regular langu ages, contex t-free to context-free, context-sensitive to context-sensitive, and recursive sets to recursive sets . In particular, the fini...