Sharif Digital Repository

Abstract We design a thermo-photovoltaic Tandem cell which produces high open circuit voltage (Voc) that causes to increase efficiency (η). The currently used materials (AlAsSb-InGaSb/InAsSb) have thermo-photovoltaic (TPV) property which can be a p-n junction of a solar cell, but they have low bandgap energy which is the reason for lower open circuit voltage. In this paper, in the bottom cell of the Tandem, there is 30 quantum wells which increase absorption coefficients and quantum efficiency (QE) that causes to increase current. By increasing the current of the bottom cell, the top cell thickness must be increased because the top cell and the bottom cell should have the same current. In... 

In this paper, a novel structure for a dual-gated graphene nanoribbon field-effect transistor (GNRFET) is offered, which combines the advantages of high and low dielectric constants. In the proposed Two Different Insulators GNRFET (TDI-GNRFET), the gate dielectric at the drain side is a material with low dielectric constant to form smaller capacitances, while in the source side, there is a material with high dielectric constant to improve On-current and reduce the leakage current. Simulations are performed based on self-consistent solutions of the Poisson equation coupled with Non-Equilibrium Green's Function (NEGF) formalism in the ballistic regime. We assume a tight-binding Hamiltonian in... 

The conventional time-modulated arrays (TMAs) have a low radiation efficiency, since each antenna turns off at specific time slots. In this paper, first, the efficiency of TMA is investigated analytically. Next, the optimized switching sequences are proposed to enhance the radiation efficiency of a specific sideband, while preserving the level of the other sidebands. The practical hardware limitations are considered in the switching sequence design. Moreover, a low-cost flexible eight-element printed dipole array operating at 1.2-1.4 GHz is implemented to verify the proposed algorithms. The measured radiation patterns indicate that by applying the proposed sequences, the TMA efficiency... 

We consider D3-brane action in the maximally supersymmetric type IIB plane-wave background. Upon fixing the light-cone gauge, we obtain the light-cone Hamiltonian which is manifestly supersymmetric. The 1/2 BPS solutions of this theory (solutions which preserve 16 supercharges) are either of the form of spherical three branes, the giant gravitons, or zero size point like branes. We then construct specific classes of 1/4 BPS solutions of this theory in which static electric field on the brane is turned on. These solutions are deformations about either of the two 1/2 BPS solutions. In particular, we study in some detail 1/4 BPS configurations with electric dipole on the three sphere giant,... 

Let R be a ring and X R be a non-empty set. The regular graph of X, Γ(X), is defined to be the graph with regular elements of X (non-zero divisors of X) as the set of vertices and two vertices are adjacent if their sum is a zero divisor. There is an interesting question posed in BCC22. For a field F, is the chromatic number of Γ( GLn(F)) finite? In this paper, we show that if G is a soluble subgroup of GLn(F), then χ(Γ(G))<∞. Also, we show that for every field F, χ(Γ( Mn(F)))=χ(Γ( Mn(F(x)))), where x is an indeterminate. Finally, for every algebraically closed field F, we determine the maximum value of the clique number of Γ(), where denotes the subgroup generated by A∈ GLn(F)  

Several methods have been used for the evaluation of liquefaction potential, among which the simplified method is mostly used. In this method, which is mainly based on standard penetration test (SPT), cone penetration test (CPT) and shear wave velocity (Vs) measurement, a boundary curve is provided to separate the liquefiable and non-liquefiable soil zones. Vs measurement is a good alternative method of penetration-based methods (SPT and CPT). This is especially true in micro-zonation of liquefaction potential. Although relatively large studies have been carried out to establish the correlation between Vs and liquefaction resistance for sands; there are uncertainties about the effects of... 

The use of shear wave velocity (Vs) measurements as an in situ test for evaluation of liquefaction potential has increased substantially due to its advantages. Relatively large numbers of studies have been performed to establish the correlation between Vs and liquefaction resistance (CRR) of clean sands. Usually, natural sands contain silt and/or clay, and previous studies have shown that both the amount of fines and their nature influence the values of CRR as well as Vs. Therefore, the CRR–Vs correlations may also be affected by fines content and type of sandy soils. However, effect of fines content and especially fines type of sandy soils on the correlation between Vs and CRR is... 

The inventory system under consideration consists of one central warehouse and an arbitrary number of retailers controlled by a continuous review inventory policy (R,Q). Independent Poisson demands are assumed with constant transportation times for all retailers and a constant lead time for replenishing orders from an external supplier for the warehouse. Unsatisfied demands are assumed to be lost in the retailers and unsatisfied retailer orders are backordered in the warehouse. An approximate cost function is developed to find optimal reorder points for given batch sizes in all installations and the related accuracy is assessed through simulation. © Sharif University of Technology, January... 

For a set S of positive integers, a spanning subgraph F of a graph G is called an S-factor of G if degF(x) ∈ S for all vertices x of G, where degF(x) denotes the degree of x in F. We prove the following theorem on {a, b}-factors of regular graphs. Let r ≥ 5 be an odd integer and k be either an even integer such that 2 ≤ k < r/2 or an odd integer such that r/3 ≤ k < r/2. Then every r-regular graph G has a {k, r-k}-factor. Moreover, for every edge e of G, G has a {k, r-k}-factor containing e and another {k, r-k}-factor avoiding e  

We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n2) and after preprocessing, visibil- ity change events for weak and strong visibility can be handled in O(log VP) and O(log(VP1 + VP2)) re- spectively, or O(log n) in which VP is the size of the line segment's visibility polygon and VP 1 and VP2 represent the number of vertices in the visibility poly- gons of the line segment endpoints  

Let F be an algebraically closed field and T: Mn(F) → Mn(F) be a linear transformation. In this paper we show that if T preserves at least one eigenvalue of each matrix, then T preserves all eigenvalues of each matrix. Moreover, for any infinite field F (not necessarily algebraically closed) we prove that if T: Mn(F) → M n(F) is a linear transformation and for any A ∈ Mn(F) with at least an eigenvalue in F, A and T(A) have at least one common eigenvalue in F, then T preserves the characteristic polynomial  

Let G be a graph. The core of G, denoted by GΔ, is the subgraph of G induced by the vertices of degree Δ(G), where Δ(G) denotes the maximum degree of G. A k -edge coloring of G is a function f: E(G) → L such that {pipe}L{pipe} = k and f(e1) ≠ f(e2) for all two adjacent edges e1 and e2 of G. The chromatic index of G, denoted by χ′(G), is the minimum number k for which G has a k-edge coloring. A graph G is said to be Class 1 if χ′(G) = Δ(G) and Class 2 if χ′(G) = Δ(G) + 1. In this paper it is shown that every connected graph G of even order whose core is a cycle of order at most 13 is Class 1  

This paper considers the problem of a vendor-buyer integrated production-inventory model. The vendor manufactures the item at a finite rate and delivers the final goods at a lot-for-lot shipment policy to the buyer. We relax the assumption of uniform demand in the hitherto existing joint economic lot sizing models and analyze the problem where the end customer demand is price-sensitive. The relation between demand and price is considered to be linear. The model proposed, based on the integrated expected total relevant profits of both buyer and vendor, finds out the optimal values of order quantity and mark-up percentage, using an analytical approach. Some numerical examples are also used to... 

Let G be a simple graph of order n. A dominating set of G is a set S of vertices of G so that every vertex of G is either in S or adjacent to a vertex in 5. The domination polynomial of G is the polynomial D(G, x) = Σn i=1 d(G, i) xi, where d(G, i) is the number of dominating sets of G of size i. In this paper we show that cycles are determined by their domination polynomials  

In this note, bounded-input bounded-output (BIBO)-stability of a large class of neutral type fractional delay systems is investigated. Necessary and sufficient conditions of BIBO-stability are presented for the intended class of systems (the sufficient conditions have been provided for a more general case in the previous studies). Two lemmas are provided for checking a prerequisite imposed on the considered class of systems. Finally, two numerical examples are given to illustrate the obtained results  

This paper considers a closed-loop system consisting of a fractional/integer order system and a fractional PID controller. Assuming that the uncertain coefficients of the fractional PID controller lie in some known intervals independently (i.e. that controller is a member of an interval family), the paper presents some easy to use theorems to investigate the robust bounded-input bounded-output stability of the resultant closed-loop system. Moreover, a finite frequency bound required in drawing the related graphs has also been provided. Finally, some numerical examples are presented to illustrate the results  

Let G be a simple graph of order n and size m. An edge covering of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set. In this paper we introduce a new graph polynomial. The edge cover polynomial of G is the polynomial E(G,x)=∑i=1me(G,i)xi, where e (G, i) is the number of edge coverings of G of size i. Let G and H be two graphs of order n such that δ(G)≥n2, where δ (G) is the minimum degree of G. If E (G, x) = E (H, x) , then we show that the degree sequence of G and H are the same. We determine all graphs G for which E (G, x) = E (P n, x) , where P n is the path of order n. We show that if δ (G) ≥ 3, then E (G, x) has at least one...