A novel high dynamic range differential LNA using quartet topology

In some applications such as short-range radars, a large target can desensitize the receiver. A high dynamic range low-noise amplifier (LNA), as a key component of a transmitter/receiver module, can improve the entire system performance. This study presents a high dynamic range differential LNA that uses a differential quartet topology for the first time. The LNA shows more linearity than the conventional differential common source LNAs. For a typical 0.18 µm CMOS technology, it achieves a power gain of about 5.5 dB at 24 GHz, a low noise figure (NF) of 3.5 dB, very good linearity performance, an input-referred third-order intercept point (IIP3) of +?6.3 dBm, and an input-referred 1 dB compression point (P1dB) of ??4.5 dBm.     

Improving on Linear Scan Register Allocation

Register allocation is a major step for all compilers. Various register allocation algorithms have been developed over the decades. This work describes a new class of rapid register allocation algorithms and presents experimental data on their behavior. Our research encourages the avoidance of graphing and graph-coloring based on the fact that precise graph-coloring is nondeterministic polynomial time-complete (NP-complete), which is not suitable for real-time tasks. In addition, practical graph-coloring algorithms tend to use polynomial-time heuristics. In dynamic compilation environments, their super linear complexity makes them unsuitable for register allocation and code generation. Existing tools for code generation and register allocation do not completely fulfill the require- ments of fast compilation. Existing approaches either do not allow for the optimization of register allocation to be achieved compre- hensively with a sufficient degree of performance or they require an unjustifiable amount of time and/or resources. Therefore, we pro- pose a new class of register allocation and code generation algorithms that can be performed in linear time. These algorithms are based on the mathematical foundations of abstract interpretation and the computation of the level of abstraction. They have been implemen- ted in a specialized library for just-in-time compilation. The specialization of this library involves the execution of common intermedi- ate language (CIL) and low level virtual machine (LLVM) with a focus on embedded systems.     

Embedding cycles and paths on solid grid graphs

Despite many algorithms for embedding graphs on unbounded grids, only a few results on embedding graphs on restricted grids have been published. In this paper, we study the problem of embedding paths and cycles on solid grid graphs. We show that a cycle of length k is unit-length embeddable on a solid grid graph G if k is an even integer between four and the length of the longest cycle of G. In addition, our result shows that a path of length k is unit-length embeddable on G, between its two given vertices s and t, if \(k\le L\) and \(k\equiv L (\mathrm{mod}\ 2)\), in which L is the length of the longest path between s and t. Our presented two algorithms show that such embeddings can be found in linear time for cycles and quadratic time for paths, with respect to the size of graph G. In the case of rectangular grid graphs, the running time of the algorithms can be improved to O(k) and O\((k^2)\), respectively. In addition, we extend our results to \(m\times n\times o\) 3D grids. A application of our result is in the interconnection network mapping in parallel processing.     

A linear-time algorithm for finding Hamiltonian (<Emphasis Type="Italic">s</Emphasis>, <Emphasis Type="Italic">t</Emphasis>)-paths in odd-sized rectangular grid graphs with a rectangular hole

A grid graph \(G_{\mathrm{g}}\) is a finite vertex-induced subgraph of the two-dimensional integer grid \(G^\infty \). A rectangular grid graph R(m, n) is a grid graph with horizontal size m and vertical size n. A rectangular grid graph with a rectangular hole is a rectangular grid graph R(m, n) such that a rectangular grid subgraph R(k, l) is removed from it. The Hamiltonian path problem for general grid graphs is NP-complete. In this paper, we give necessary conditions for the existence of a Hamiltonian path between two given vertices in an odd-sized rectangular grid graph with a rectangular hole. In addition, we show that how such paths can be computed in linear time.     

Simultaneous optimization of repair and control-limit policy in condition-based maintenance

In condition-based maintenance (CBM) planning, collected information from system condition monitoring is the basis of making decision about conducting the maintenance and repair activities. Recently, ample number of studies has been conducted in CBM field especially, in control-limit policy. In control-limit policy, using proportional Hazards model and results of monitoring system condition, one can estimate hazard rate function and its condition’s transition probability matrix. Then, considering replacement costs, optimal control-limit can be determined minimizing the average cost in the long run. The presented model considers repair policy and their implementation cost, and the assumptions of repair during interval inspection is ignored. Then, a model is presented to determine the optimal control-limit and the best repair policy, in which the average total cost per unit time in the long-run, is minimized. At the end, a numerical example is illustrated.     

The Density Functional Study of Structural,Electronic, Magnetic and Thermodynamic Properties of XFeSi (X = Gd,Tb, La) and GdRuSi Compounds

The structural, electronic, magnetic, and thermodynamic properties of XFeSi (X = Gd, Tb, La) and GdRuSi compounds are investigated using density functional theory by the WIEN2k code. Using the first-principle procedure, the Hubbard parameter of Gd and Tb 4f electrons and La 5d electrons of XFeSi (X = Gd, Tb, La) and GdRuSi compounds is calculated. The structural and electronic and magnetic properties of these compounds within GGA and GGA + U approaches in the presence of spin-orbit coupling are calculated and compared. The calculated results indicate that the ferromagnetic phase is the most stable phase of XFeSi (X = Gd, Tb) and GdRuSi compounds and the nonmagnetic phase is the stable phase of LaFeSi. The magnetic moment of GdFeSi, GdRuSi, and TbFeSi compounds is due to Gd and Tb atoms. The calculated electronic band structures of these compounds show that these compounds have metallic behavior. Furthermore, the thermodynamic properties of these compounds using the quasi-harmonic Debye model as a function of temperature and pressure within GGA and GGA + U approaches are investigated.     

Semantic tagging and linking of software engineering social content

Social online communities and platforms play a significant role in the activities of software developers either as an integral part of the main activities or through complimentary knowledge and information sharing. As such techniques become more prevalent resulting in a wealth of shared information, the need to effectively organize and sift through the information becomes more important. Top-down approaches such as formal hierarchical directories have shown to lack scalability to be applicable to these circumstanes. Light-weight bottom-up techniques such as community tagging have shown promise for better organizing the available content. However, in more focused communities of practice, such as software engineering and development, community tagging can face some challenges such as tag explosion, locality of tags and interpretation differences, to name a few. To address these challenges, we propose a semantic tagging approach that benefits from the information available in Wikipedia to semantically ground the tagging process and provide a methodical approach for tagging social software engineering content. We have shown that our approach is able to provide high quality tags for social software engineering content that can be used not only for organizing such content but also for making meaningful and relevant content recommendation to the users both within a local community and also across multiple social online communities. We have empirically validated our approach through four main research questions. The results of our observations show that the proposed approach is quite effective in organizing social software engineering content and making relevant, helpful and novel content recommendations to software developers and users of social software engineering communities.     

Optimal fuzzy controller based on non-monotonic Lyapunov function with a case study on laboratory helicopter

This paper presents a new approach to design an observer-based optimal fuzzy state feedback controller for discrete-time Takagi–Sugeno fuzzy systems via LQR based on the non-monotonic Lyapunov function. Non-monotonic Lyapunov stability theorem proposed less conservative conditions rather than common quadratic method. To compare with optimal fuzzy feedback controller design based on common quadratic Lyapunov function, this paper proceeds reformulation of the observer-based optimal fuzzy state feedback controller based on common quadratic Lyapunov function. Also in both methodologies, the dependence of optimisation problem on initial conditions is omitted. As a practical case study, the controllers are implemented on a laboratory twin-rotor helicopter to compare the controllers' performance.     

Hybrid intelligent method for fuzzy reliability analysis of corroded X100 steel pipelines

Epistemic uncertainties are critical for reliable design of corroded pipes made of high-strength grade steel. In this work, corrosion defects geometries and operating pressure are provided as the epistemic uncertainties in reliability analysis. A framework of an iterative approach-based bi-loop is presented for fuzzy reliability analysis (FRA) of corroded pipelines to evaluate the fuzzy reliability index-based various fuzzy-random variables (FRVs). In the inner loop, the conjugate first-order reliability method using adaptive finite-step size is applied for carried out the reliability analysis. The outer loop is structured based on the fuzzy analysis corresponding to a modified particle swarm optimization as an intelligent tool. The adaptive conjugate fine step size is dynamically computed to adjust the conjugate sensitivity vector in the reliability loop. The sufficient descent condition is satisfied based on three-term conjugate first-order reliability method. The performance function of corroded pipelines is defined based on average shear stress yield-based plastic flow theory, remaining strength factor, and operating pressure. Two applicable examples as corroded pipelines made from X100 high-strength steel are given to illustrate the effects of epistemic uncertainties under corrosion defects. Investigation the results has shown that modeling of epistemic uncertainty in the reliability analysis of high-grade steel pipelines could result more reasonable reliability indexes. In addition, results indicate that FRVs have significant influence on fuzzy reliability index calculations, especially corrosion defect depth and operating pressure (as FRVs). The sensitivity measure of FRA demonstrated that fuzzy reliability index of corroded X100 steel pipelines is more sensitive to the FRVs means.

     

NP-completeness of chromatic orthogonal art gallery problem

The Journal of Supercomputing - The chromatic orthogonal art gallery problem is a well-known problem in the computational geometry. Two points in an orthogonal polygon P see each other if there is...