THE effect of Srandom DOPANT fluctuation on threshold voltage and drain current variation in junctionless nanotransistors

We investigate the effect of dopant random fluctuation on threshold voltage and drain current variation in a two-gate nanoscale transistor. We used a quantum-corrected technology computer aided design simulation to run the simulation (10000 randomizations). With this simulation, we could study the effects of varying the dimensions (length and width), and thicknesses of oxide and dopant factors of a transistor on the threshold voltage and drain current in subthreshold region (off) and overthreshold (on). It was found that in the subthreshold region the variability of the drain current and threshold voltage is relatively fixed while in the overthreshold region the variability of the threshold voltage and drain current decreases remarkably, despite the slight reduction of gate voltage diffusion (compared with that of the subthreshold). These results have been interpreted by using previously reported models for threshold current variability, load displacement, and simple analytical calculations. Scaling analysis shows that the variability of the characteristics of this semiconductor increases as the effects of the short channel increases. Therefore, with a slight increase of length and a reduction of width, oxide thickness, and dopant factor, we could correct the effect of the short channel.     

Access point selection in the network of Internet of things (IoT) considering the strategic behavior of the things and users

The Journal of Supercomputing - With the expansion in the use of IoT, increasing the efficiency of these networks has become even more significant. Objects need reliable communications at suitable...     

A new adaptation of mapping method to study mixing of multiphase flows in mixers with complex geometries

The main objective of the present work is to modify the traditional mapping method for the simulation of distributive mixing of multiphase flows in geometries involving moving parts such as, internal mixers or twin-screw extruders without a limitation on their geometrical periodicity. The periodicity condition, limits the results of traditional mapping method to tracking mapping mesh between specific discrete time intervals or distances for that geometry is repeated, hence, result is only for fixed orientation of rotors. Imaginary domain method is introduced to track mapping mesh from one state to the next free of geometrical periodicity limitations. In this work the method is introduced and its applicability and accuracy is discussed in details. A two-dimensional (2D) simulation of mixing of two Newtonian fluids with different viscosities in an intermeshing internal mixer is used as a test case study. In this example the key issues of ability to predict mixing state in details for all orientations of rotors is presented. To reduce diffusion errors of mapping method in the boundaries of the rotors, mapping mesh refinement technique that relies upon one single reference mesh is also presented.     

Mesoporous SBA-15@n-Pr-THAM-ZrO organic–inorganic hybrid: as a highly efficient reusable nanocatalyst for the synthesis of polyhydroquinolines and 2,3-dihydroquinazolin-4 (1h)-ones

Journal of Porous Materials - In this work, tris(hydroxymethyl)aminomethane-Zirconium complex supported on modified SBA-15 (SBA-15@n-Pr-THMAM-ZrO) prepared as a novel mesoporous catalyst. The...     

Hesperidin Promotes Osteogenesis and Modulates Collagen Matrix Organization and Mineralization In Vitro and In Vivo

This study evaluated the direct effect of a phytochemical, hesperidin, on pre-osteoblast cell function as well as osteogenesis and collagen matrix quality, as there is little known about hesperidin’s influence in mineralized tissue formation and regeneration. Hesperidin was added to a culture of MC3T3-E1 cells at various concentrations. Cell proliferation, viability, osteogenic gene expression and deposited collagen matrix analyses were performed. Treatment with hesperidin showed significant upregulation of osteogenic markers, particularly with lower doses. Mature and compact collagen fibrils in hesperidin-treated cultures were observed by picrosirius red staining (PSR), although a thinner matrix layer was present for the higher dose of hesperidin compared to osteogenic media alone. Fourier-transform infrared spectroscopy indicated a better mineral-to-matrix ratio and matrix distribution in cultures exposed to hesperidin and confirmed less collagen deposited with the 100-µM dose of hesperidin. In vivo, hesperidin combined with a suboptimal dose of bone morphogenetic protein 2 (BMP2) (dose unable to promote healing of a rat mandible critical-sized bone defect) in a collagenous scaffold promoted a well-controlled (not ectopic) pattern of bone formation as compared to a large dose of BMP2 (previously defined as optimal in healing the critical-sized defect, although of ectopic nature). PSR staining of newly formed bone demonstrated that hesperidin can promote maturation of bone organic matrix. Our findings show, for the first time, that hesperidin has a modulatory role in mineralized tissue formation via not only osteoblast cell differentiation but also matrix organization and matrix-to-mineral ratio and could be a potential adjunct in regenerative bone therapies.     

A Uniform Paradigm to Succinctly Encode Various Families of Trees

We propose a uniform method to encode various types of trees succinctly. These families include ordered (ordinal), k-ary (cardinal), and unordered (free) trees. We will show the approach is intrinsically suitable for obtaining entropy-based encodings of trees (such as the degree-distribution entropy). Previously-existing succinct encodings of trees use ad hoc techniques to encode each particular family of trees. Additionally, the succinct encodings obtained using the uniform approach improve upon the existing succinct encodings of each family of trees; in the case of ordered trees, it simplifies the encoding while supporting the full set of navigational operations. It also simplifies the implementation of many supported operations. The approach applied to k-ary trees yields a succinct encoding that supports both cardinal-type operations (e.g. determining the child label i) as well as the full set of ordinal-type operations (e.g. reporting the number of siblings to the left of a node). Previous work on succinct encodings of k-ary trees does not support both types of operations simultaneously (Benoit et al. in Algorithmica 43(4):275–292, 2005; Raman et al. in ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233–242, 2002). For unordered trees, the approach achieves the first succinct encoding. The approach is based on two recursive decompositions of trees into subtrees. Recursive decomposition of a structure into substructures is a common technique in succinct encodings and has even been used to encode (ordered) trees (Geary et al. in ACM Trans. Algorithms 2(4):510–534, 2006; He et al. in ICALP, pp. 509–520, 2007) and dynamic binary trees (Munro et al. in ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 529–536, 2001; Storm in Representing dynamic binary trees succinctly, Master’s thesis, 2000). The main distinction of the approach in this paper is that a tree is decomposed into subtrees in a manner that the subtrees are maximally isolated from each other. This intermediate decomposition result is interesting in its own right and has proved useful in other applications (Farzan et al. in ICALP (1), pp. 451–462, 2009; Farzan and Munro in ICALP (1), pp. 439–450, 2009; Farzan and Kamali in ICALP, 2011).     

Gain‐scheduled filtering for linear parameter‐varying systems using inexact scheduling parameters with bounded variation rates

This paper is concerned with the problem of full‐order H₂ linear parameter‐varying filter design for continuous‐time systems with bounded rate of variations under the condition that the scheduling parameters do not exactly fit the real ones. The scheduling parameters and their derivatives are supposed to belong to polytopes with known vertices. The synthesis conditions are formulated in terms of parameter‐dependent bilinear matrix inequalities by means of parameter‐dependent Lyapunov function and introducing some extra variables for the filter design. An iterative procedure is presented to cast the bilinear matrix inequalities problem into a linear matrix inequality optimization problem. The design of robust filters for both time‐varying and time‐invariant systems can be viewed as particular cases of the proposed method. The merit of the method presented in this paper lies in two fields. The first pertains to dealing with the measurement uncertainty in a less conservative manner than available approaches in the gain‐scheduled filtering problem. The second is to provide more efficient methods than the existing ones in the literature for the robust filter design. Copyright © 2015 John Wiley & Sons, Ltd.