Design and analysis of wideband U‐slot patch antenna with U‐shaped parasitic elements

A single layer single probe‐fed wideband microstrip antenna is presented and investigated. By cutting a U‐slot in the rectangular patch, and by incorporating two identical U‐shaped parasitic patches around both the radiating edges and the nonradiating edges of the rectangular patch, three resonant frequencies are excited to form the wideband performance. Details of the antenna design is presented. The measured and simulated results are in good agreement, the measured impedance bandwidth is GHz ( GHz), or centered at GHz, which covers WLAN GHz ( GHz), WLAN GHz ( GHz), and WIMAX GHz ( GHz) bands. The measured peak gains at the three resonant frequencies are dB, dB, and dB, respectively. An equivalent circuit model which is based on the transmission line theory, the asymmetric coupled microstrip lines theory, and the π‐network theory is established. This equivalent circuit model is used to give an insight into the wideband mechanism of the proposed antenna, and is also used to explain why the three resonant frequencies shift at the variations of different parameters from a physical point of view. The error analysis is given to demonstrate the validity of the equivalent circuit model.     

Thin‐slot formalism for the split‐field FDTD analysis of periodic structure

An expression of the thin‐slot formalism is presented to alleviate the gridding of the split‐field finite‐difference time‐domain (FDTD) solution for periodic structure. The varying auxiliary‐field ( , ) and split‐field ( , ) distributions near the slots are analytically derived from the varying field ( , ). The update equations for the split‐field FDTD are obtained by incorporating those varying field distributions into the split‐field equations in integral form. A frequency selective surface (FSS) structure is applied to verify the proposed method. The results indicate that the computational efficiency is improved.     

Broadband polarization rotator for arbitrary angles with enhanced substrate integrated waveguide cavities

A broadband polarization rotator for rotating linear polarization to every intended angle is introduced. The proposed rotator is constituted of frequency selective surface and enhanced substrate integrated waveguide (SIW) cavities. Considering the current distribution of circular or square SIW cavity dominant modes, two slots are inserted on the front and back surfaces of the enhanced SIW cavities where the arrows of distributed current are orthogonal to them. Accordingly, the angle between the input and output slots determines the amount of polarization rotation. Moreover, a method of cascading enhanced circular and square SIW cavities for the proposed structure is analyzed to produce a sharper roll‐off response in stop‐bands. Design and simulation of the proposed method are presented for , _, and polarization rotators in Ka frequency band with 35 GHz central frequency. To verify the proposed method, a prototype of polarization rotator is fabricated and measured. The measurement demonstrates 18.8% bandwidth which proves broadband performance of the proposed structure.     

A novel stealth Vivaldi antenna with low radar cross section

A novel stealth Vivaldi antenna with low radar cross section (RCS) is proposed in this article that covers the ultrawide band (UWB) from 2 to 12 GHz. As a special scatterer, the antenna can be responsible for the larger part of the total RCS of many military platforms. In this article, the configuration of the metal patch is modified, based on the difference of the current distribution while the antenna radiates and scatters. The monostatic radar cross section of proposed antenna is reduced in most parts of the band with polarized and polarized. Maximally 14 dBsm RCS reduction is achieved. The gain of the proposed antenna and reference antenna are in good agreement in most of the impedance bandwidth. Results are provided to demonstrate that the excellent radiation and perfect stealth performance is achieved. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:255–261, 2015.     

A novel combined structure for decoupling E/H‐plane microstrip antenna array

A novel structure combined of an I‐shaped microstrip line and eight slots etched from the ground plane is proposed to decouple both E‐plane and H‐plane antenna arrays. Five types of antenna arrays at 5.25 GHz with different linear placements are discussed for the first time and the decoupling structure is valid to them all. The edge‐to‐edge distances of the H‐plane arrays and the E‐plane arrays are 0.09 and 0.17 _, respectively. Simulated and measured results indicate that the combined structure can effectively reduce the mutual coupling, with the maximum values reaching to 22.62, 28.41, 21.04, 22.33, and 26.04 dB for five types, respectively. The proposed structure is potential in the application of multielement arrays and communication MIMO system.     

Antenna current optimization for optimal antenna design in different frequency bands using VSO‐NM algorithm

In this article, the antenna partial gain to ‐factor based on the antenna current optimization is used as figure of merit for antenna design proposing an efficient global hybrid technique that combining very simple optimization (VSO) and Nelder‐Mead (NM) algorithm. To validate the strength of the approach, a set of three antennas operating within different frequency bands of super high frequency, submillimeter, and light spectrum are addressed and optimized. The antennas are analyzed completely using finite difference time domain method. The results showed the strength of the approach of optimizing antenna gain to ‐factor based on antenna current optimization using the hybrid VSO‐NM algorithm in different frequency bands. Compared to stand‐alone VSO, the hybrid VSO‐NM algorithm showed the ability to reduce the processing time on average by 58.73% in addition to enhancing the search capability by 43%.     

An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganized 2D Points

We present anefficient algorithm for determining an aesthetically pleasing shape boundary connecting all the points in a given unorganized set of 2D points, with no other information than point coordinates. By posing shape construction as a minimisation problem which follows the Gestalt laws, our desired shape is non‐intersecting, interpolates all points and minimizes a criterion related to these laws. The basis for our algorithm is an initial graph, an extension of the Euclidean minimum spanning tree but with no leaf nodes, called as the minimum boundary complex . and can be expressed similarly by parametrizing a topological constraint. A close approximation of , termed can be computed fast using a greedy algorithm. is then transformed into a closed interpolating boundary in two steps to satisfy ’s topological and minimization requirements. Computing exactly is an NP (Non‐Polynomial)‐hard problem, whereas is computed in linearithmic time. We present many examples showing considerable improvement over previous techniques, especially for shapes with sharp corners. Source code is available online.     

Determinization and minimization of finite acyclic automata by incremental techniques

The determinization of a nondeterministic finite automaton (FA) is the process of generating a deterministic FA (DFA) equivalent to (sharing the same regular language of) . The minimization of is the process of generating the minimal DFA equivalent to . Classical algorithms for determinization and minimization are available in the literature for several decades. However, they operate monolithically, assuming that the FA to be either determinized or minimized is given once and for all. By contrast, we consider determinization and minimization in a dynamic context, where augments over time: after each augmentation, determinization and minimization of into is required. Using classical monolithic algorithms to solve this problem is bound to poor performance. An algorithm for incremental determinization and minimization of acyclic finite automata, called IDMA, is proposed. Despite being conceived within the narrow domain of model‐based diagnosis and monitoring of active systems, the algorithm is general‐purpose in nature. Experimental evidence indicates that IDMA is far more efficient than classical algorithms in solving incremental determinization and minimization problems. Copyright © 2015 John Wiley & Sons, Ltd.     

Full complexity analysis of the diameter‐constrained reliability

Let be a simple graph with nodes and links, a subset of “terminals,” a vector , and a positive integer d, called “diameter.” We assume that nodes are perfect but links fail stochastically and independently, with probabilities . The “diameter‐constrained reliability” (DCR) is the probability that the terminals of the resulting subgraph remain connected by paths composed of d links, or less. This number is denoted by . The general DCR computation belongs to the class of ‐hard problems, since it subsumes the problem of computing the probability that a random graph is connected. The contributions of this paper are twofold. First, a full analysis of the computational complexity of DCR subproblems is presented in terms of the number of terminal nodes and the diameter d. Second, we extend the class of graphs that accept efficient DCR computation. In this class, we include graphs with bounded co‐rank, graphs with bounded genus, planar graphs, and, in particular, Monma graphs, which are relevant to robust network design.     

Application of generally weighted moving average method to tracking signal state space model

In predicting time series, if a trend includes a structural break, then a state space model can be applied to revise the predictive method. Some scholars suggest that restricted damped trend models yield excellent prediction results by automatically revising unforeseen structural break factors in the prediction process. Restricted damped trend models add a smoothed error statistic to a local‐level model and use the exponentially weighted moving average (EWMA) method to make corrections. This paper applies the generally weighted moving average (GWMA) concept and method to a restricted damped trend model that changes the smoothed error statistic from the EWMA form to the GWMA form and adds the correction parameter λ, which distinguishes three situations , , and . The original restricted damped trend model applies only to , enabling the model to capture situations in which and increases its generality. This paper also compares the effect of various parameter values on the predictive model and finds the range of parameter settings that optimize the model.     

The Mixed Robust /FTS Control Problem Analysis and State Feedback Control

In this paper we deal with the mixed  /finite‐time stability control problem. More specifically, given an open loop uncertain linear system, we provide a necessary and sufficient condition for quadratic input‐output finite‐time stability with an  bound. Exploiting this result we also give a sufficient condition to solve the related synthesis problem via state‐feedback. The property of quadratic input‐output finite‐time stability with an  bound implies that the system under consideration satisfies an  performance bound between the disturbance input and the controlled output and, at the same time, is input‐output finite‐time stable for all admissible uncertainties. This condition requires the solution of a feasibility problem constrained by a pair of differential linear matrix inequalities (LMIs) coupled with a time‐varying LMI. The proposed technique is illustrated by means of both a numerical and a physical example.     

Mixed control of hidden Markov jump systems

In this work, we study the mixed control for Markov jump linear systems with hidden Markov parameters. The hidden Markov process is denoted by , where the nonobservable component θ(k) represents the mode of operation of the system, whereas represents the observable component provided by a detector. The goal is to obtain design techniques for mixed control problems, with the controllers depending only on the estimate , for problems formulated in 3 different forms: (i) minimizing an upper bound on the norm subject to a given restriction on the norm; (ii) minimizing an upper bound on the norm, while limiting the norm; and (iii) minimizing a weighted combination of upper bounds of both the and norms. We propose also new conditions for synthesizing robust controllers under parametric uncertainty in the detector probabilities and in the transition probabilities. The so‐called cluster case for the mixed control problem is also analyzed under the detector approach. The results are illustrated by means of 2 numerical examples.     

Enhancing Bayesian Estimators for Removing Camera Shake

The aim of removing camera shake is to estimate a sharp version x from a shaken image y when the blur kernel k is unknown. Recent research on this topic evolved through two paradigms called and . only solves for k by marginalizing the image prior, while recovers both x and k by selecting the mode of the posterior distribution. This paper first systematically analyses the latent limitations of these two estimators through Bayesian analysis. We explain the reason why it is so difficult for image statistics to solve the previously reported failure. Then we show that the leading methods, which depend on efficient prediction of large step edges, are not robust to natural images due to the diversity of edges. , although much more robust to diverse edges, is constrained by two factors: the prior variation over different images, and the ratio between image size and kernel size. To overcome these limitations, we introduce an inter‐scale prior prediction scheme and a principled mechanism for integrating the sharpening filter into . Both qualitative results and extensive quantitative comparisons demonstrate that our algorithm outperforms state‐of‐the‐art methods.     

A compact printed multistubs loaded resonator rectangular monopole antenna design for multiband wireless systems

In the present article, a compact triple‐band multistubs loaded resonator printed monopole antenna is proposed. The antenna consists of a quarter wavelength two asymmetrical inverted L‐shaped stubs to excite two resonant modes for 3.5/5.5 GHz bands and one integrated horizontally T‐shaped stub with inverted long L‐shaped stub to excite resonant mode for 2.5 GHz band. By loading these stub resonators along y‐axis with distinct gaps, the antenna resonates at three frequencies 2.57/3.52/5.51 GHz covering the desired bands while keeping compact size of 24 × 30 mm² (0.2 × 0.25 ). The proposed antenna is fabricated on Rogers RT/duroid 5880 substrate with thickness 0.79 mm and its performance experimentally verified. The measured results reveal that the antenna has the impedance bandwidths of about 210 MHz (2.50‐2.71 GHz), 260 MHz (3.37‐3.63 GHz), and 650 MHz (5.20‐5.85 GHz), for 2.5/3.5/5.5 GHz WiMAX and 5.2/5.8 GHz WLAN band systems. The antenna provides omnidirectional radiation patterns and flat antenna gains over the three operating bands. In addition, the design approach and effects of multistubs resonator lengths on the operating bands are also examined and discussed in detail.     

Computational and structural analysis of the contour of graphs

Let be a finite, simple, and connected graph. The closed interval of a set is the set of all vertices lying on a shortest path between any pair of vertices of S. The set S is geodetic if . The eccentricity of a vertex v is the number of edges in the greatest shortest path between v and any vertex w of G. A vertex v is a contour vertex if no neighbor of v has eccentricity greater than v. The contour of G is the set formed by the contour vertices of G. We consider two problems: the problem of determining whether the contour of a graph class is geodetic; the problem of determining if there exists a graph such that is not geodetic. We obtain a sufficient condition that is useful for both problems; we prove a realization theorem related to problem and show two infinite families such that is not geodetic. Using computational tools, we establish the minimum graphs for which is not geodetic; and show that all graphs with , and all bipartite graphs with , are such that is geodetic.     

Polynomial time approximation algorithms for proportionate open‐shop scheduling

This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open‐shop scheduling, where the processing times are only machine‐dependent. This variant of scheduling is called proportionate scheduling and its applications are used in many real‐world environments. This paper develops three polynomial time algorithms for the problem. First, we present a polynomial time algorithm that solves the problem optimally if , where n and m denote the numbers of jobs and machines, respectively. If, on the other hand, , we develop a polynomial time approximation algorithm with a worst‐case performance ratio of that improves the bound existing for general open‐shops. Next, in the case of , we take into account the problem under consideration as a master problem and convert it into a simpler secondary approximation problem. Furthermore, we formulate both the master and secondary problems, and compare their complexity sizes. We finally present another polynomial time algorithm that provides optimal solution for a special case of the problem where .     

Another view on q‐rung orthopair fuzzy sets

In this paper, two new approaches have been presented to view q‐rung orthopair fuzzy sets. In the first approach, these can viewed as L‐fuzzy sets, whereas the second approach is based on the notion of orbits. Uncertainty index is the quantity , which remains constant for all points in an orbit. Certain operators can be defined in q‐ROF sets, which affect when applied to some q‐ROF sets. Operators , , and have been defined. It is studied that how these operators affect when applied to some q‐ROF set A.     

Graphical tuning method of FOPID controllers for fractional order uncertain system achieving robust ‐stability

This paper focuses on the graphical tuning method of fractional order proportional integral derivative (FOPID) controllers for fractional order uncertain system achieving robust ‐stability. Firstly, general result is presented to check the robust ‐stability of the linear fractional order interval polynomial. Then some alternative algorithms and results are proposed to reduce the computational effort of the general result. Secondly, a general graphical tuning method together with some computational efficient algorithms are proposed to determine the complete set of FOPID controllers that provides ‐stability for interval fractional order plant. These methods will combine the results for fractional order parametric robust control with the method of FOPID ‐stabilization for a fixed plant. At last, two important extensions will be given to the proposed graphical tuning methods: determine the ‐stabilizing region for fractional order systems with two kinds of more general and complex uncertainty structures: multi‐linear interval uncertainty and mixed‐type uncertainties. Numerical examples are followed to illustrate the effectiveness of the method. Copyright © 2015 John Wiley & Sons, Ltd.     

Greedy Geometric Algorithms for Collection of Balls,with Applications to Geometric Approximation and Molecular Coarse‐Graining

Choosing balls that best approximate a 3D object is a non‐trivial problem. To answer it, we first address the inner approximation problem, which consists of approximating an object defined by a union of n balls with balls defining a region . This solution is further used to construct an outer approximation enclosing the initial shape, and an interpolated approximation sandwiched between the inner and outer approximations. The inner approximation problem is reduced to a geometric generalization of weighted max k‐cover, solved with the greedy strategy which achieves the classical lower bound. The outer approximation is reduced to exploiting the partition of the boundary of by the Apollonius Voronoi diagram of the balls defining the inner approximation. Implementation‐wise, we present robust software incorporating the calculation of the exact Delaunay triangulation of points with degree two algebraic coordinates, of the exact medial axis of a union of balls, and of a certified estimate of the volume of a union of balls. Application‐wise, we exhibit accurate coarse‐grain molecular models using a number of balls 20 times smaller than the number of atoms, a key requirement to simulate crowded cellular environments.     

Spline Based Pseudo‐Inversion of Sampled Data Non‐Minimum Phase Systems for an Almost Exact Output Tracking

This paper considers the problem of achieving a very accurate tracking of a pre‐specified desired output trajectory , for linear, multiple input multiple output, non‐minimum phase and/or non hyperbolic, sampled data, and closed loop control systems. The proposed approach is situated in the general framework of model stable inversion and introduces significant novelties with the purpose of reducing some theoretical and numerical limitations inherent in the methods usually proposed. In particular, the new method does not require either a preactuation or null initial conditions of the system. The desired and the corresponding sought input are partitioned in a transient component ( and u_t(k), respectively) and steady‐state ( and u_s(k), respectively). The desired transient component is freely assigned without requiring it to be null over an initial time interval. This drastically reduces the total settling time. The structure of u_t(k) is a priori assumed to be given by a sampled smoothing spline function. The spline coefficients are determined as the least‐squares solution of the over‐determined system of linear equations obtained imposing that the sampled spline function assumed as reference input yield the desired output over a properly defined transient interval. The steady‐state input u_s(k) is directly analytically computed exploiting the steady‐state output response expressions for inputs belonging to the same set of .