Sharif Digital Repository

A 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at least 2, the neighbors of v receive at least two colors. The smallest integer k such that G has a 2-hued coloring with k colors is called the 2-hued chromatic number of G, and is denoted by χ2(G). In this paper, we will show that, if G is a regular graph, then χ2(G)-χ(G)≤2log 2(α(G))+3, and, if G is a graph and δ(G)<2, then χ2(G)-χ(G)≤1+4 Δ2δ-1⌉(1+log 2Δ(G)2Δ(G)-δ(G)(α(G))), and in the general case, if G is a graph, then χ2(G)-χ(G)≤2+min α′(G),α(G)+ω(G)2  

Heat generation from very large-scale integrated (VLSI) circuits increases with the advent of high-density integrated circuit technology. One of the promising techniques is liquid cooling by using microchannel heat sink. Numerical works on the microchannel heat sink in the literature are mostly two dimensional. The purpose of the present study is to develop a three-dimensional analysis procedure to investigate flow and conjugate heat transfer in the microchannel-based heat sink for electronic packaging applications. The micro-heat sink model consists of a 10 mm long silicon substrate, with rectangular microchannels, 57 μm wide and 180 μm deep, fabricated along the entire length. A finite... 

In recent years, there has been a growing interest in the simulation and analysis of piezoelectric transducers with the he help of equivalent electrical circuit simulations (EECS). This paper has been devoted to study of such approach for two designed and fabricated ultrasonic sandwich transducers. By using analytical analysis, the dimensions of components of the two piezoelectric transducers were determined for the assumed resonance frequencies of 30 kHz and 40 kHz. Then, by using a two dimensional finite element model, and regarding two different modeling techniques for the transducers and by application of a current source which was connected directly to the piezoelectric pieces of the... 

The purpose of this paper is to address the question of well-posedness and spectral controllability of the wave equation perturbed by potential on networks which may contain unbounded potentials in the external edges. It has been shown before that in the absence of any potential, there exists an optimal time T∗ (which turns out to be simply twice the sum of all length of the strings of the network) that describes the spectral controllability of the system. We will show that this holds in our case too, i.e., the potentials have no effect on the value of the optimal time T∗. The proof is based on the famous Beurling-Malliavin’s Theorem on the completeness interval of real exponentials and on a... 

The purpose of this paper is to address the question of well-posedness and spectral controllability of the wave equation perturbed by potential on networks which may contain unbounded potentials in the external edges. It has been shown before that in the absence of any potential, there exists an optimal time T∗ (which turns out to be simply twice the sum of all length of the strings of the network) that describes the spectral controllability of the system. We will show that this holds in our case too, i.e., the potentials have no effect on the value of the optimal time T∗. The proof is based on the famous Beurling-Malliavin’s Theorem on the completeness interval of real exponentials and on a... 

The surface area which is defined as the number of vertices at a given distance from a base vertex of a graph is considered to be as one of the most useful yet abstract combinatorial properties of a graph. The applicability of surface area spans many problem spaces such as those in parallel and distributed computing. These problems normally involve combinatorial analysis of underlying graph structures (e.g., spanning tree construction, minimum broadcast algorithms, efficient VLSI layout, performance modeling). In this paper, we focus on the problem of finding the surface area of a class of popular graphs, namely the family of WK-recursive and swapped networks. These are attractive networks... 

This paper presents two different stabilization methods based on the fractional-calculus theory. The first method is proposed via using the fractional differentiator, and the other is constructed based on using the fractional integrator. It has been shown that the proposed techniques can be used to suppress chaotic oscillations in 3-D chaotic systems. To show the practical capability of the methods, some experimental results on the control of chaos in chaotic circuits are presented. © 2008 IEEE  

Wireless ad hoc networks are vulnerable against many types of attacks including black hole. In this paper we investigate the effect of this attack on ad hoc networks. Furthermore, we use hash chain to prevent this type of attack in a network that uses AODV as a routing protocol and results of applying this method has been investigated. Simulation results using OPNET simulator indicates that packet delivery ratio, in the presence of malicious nodes, reduces remarkably and proposed approach can prevent the effect of black hole attacks  

A problem associated with modeling and control of the power factor correction rectifiers is that the ac variations in duty cycle, as well as in the ac input voltage and current are not small, and hence the traditional small signal analysis is not justified. Nonetheless, the low-frequency components of the converter can be modeled via the circuit averaging technique, but the resulting equivalent circuits are, in general, time varying and highly nonlinear. Nonlinear stability analysis methods are not appropriate for analysis and control design of such complicated circuits. In this paper a piecewise affine approximation is introduced for modeling of switching circuits. This approach makes the... 

The plausibility of embedding cycles of different lengths in the graphs of a network (known as the pancyclicity property) has important applications in interconnection networks, parallel processing systems, and the implementation of a number of either computational or graph problems such as those used for finding storage schemes of logical data structures, layout of circuits in VLSI, etc. In this paper, we present the sufficient condition of the pancyclicity property of OTIS networks. The OTIS network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due to its many favorable... 

The plausibility of embedding cycles of different lengths in the graphs of a network (known as the pancyclicity property) has important applications in interconnection networks, parallel processing systems, and the implementation of a number of either computational or graph problems such as those used for finding storage schemes of logical data structures, layout of circuits in VLSI, etc. In this paper, we present the sufficient condition of the pancyclicity property of OTIS networks. The OTIS network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due to its many favorable... 

Performance of a data center is a function of three features; bandwidth, latency, and reliability. By adopting optical technology in data center network, bandwidth increment, in addition to reduction of transmission latency and power consumption, is achieved. Unfortunately, fault tolerance of the optical networks has raised less attention so far. So in this paper, we propose a fault-tolerant, scalable, and high-performance optical architecture built upon previously proposed O-TF network, with the goal of redundancy optimization and reducing the minimum number of wavelength channels required for non-blocking functionality of the network. Moreover, reducing network diameter, in O-FTF network... 

In this work we introduce new model for energy-delay product and the performance of 80-nm SOI-CMOS circuits for the range of Vdd=0.1-1.5V and Vth=0-0.8V, are analyzed to find optimal Vdd and Vth BSIMSOI3.3 model (level 57) is used to verify the answers. We show that Energy-Delay Product (EDP) isn't appropriate metric for gate sizing problem. And a new design metric is introduced as a generalization of EDP. This metric is used to determine the transistor sizing for complex circuits based on the specified delay and energy constrains. In this case, unlike the conventional energy delay product metric, delay and energy can be considered with different emphasis. The complete design flowcharts and... 

Exponential growth of traffic and bandwidth demands in current data center networks requires low-latency high-throughput interconnection networks, considering power consumption. By considering growth of both multicast and unicast applications, power efficient communication becomes one of the main design challenges in today's data center networks. Addressing these demands, optical networks suggest several benefits as well as circumventing most disadvantages of electrical networks. In this paper, we propose an all-optical scalable architecture, named as OMUX, for communicating intra-data centers. This architecture utilizes passive optical devices and enables optical circuit switching without... 

Recovering low-rank and sparse components from missing observations is an essential problem in various fields. In this paper, we have proposed a method to address the missing low-rank and sparse decomposition problem. We have used the smoothed nuclear norm and the L1 norm to impose the low-rankness and sparsity constraints on the components, respectively. Furthermore, we have suggested a linear modeling for the corrupted observations. The problem has been solved with the aid of alternating minimization. Moreover, some simplifications have been applied to the relations to reduce the computational complexity, which makes the algorithm suitable for large-scale problems. To evaluate the proposed... 

3g wireless communication is the next version of mobile networks. Load balancing in networks causes efficient using of network resources. In this paper, we propose an efficient algorithm for load balancing of Radio Network Controllers (RNCs) in Radio Access Networks (RANs). As the characteristics of connections between RNCs and BTSs in a RAN are similar to those of graphs, we make use of graphs to solve our problem. The algorithm is based on the finding a path by which the RNCs could exchange their overloads. By using these paths the algorithm load balances the RNCs in an efficient and fast way. By testing our algorithm on networks with different topology and comparing the results, the... 

Synchronization among a set of networked nodes has attracted much attention in different fields. This paper thoroughly investigates linear formulation of the Kuramoto model, with and without frustration, for an arbitrarily weighted undirected network where all nodes may have different intrinsic frequencies. We develop a mathematical framework to estimate errors of the linear approximation for globally and locally coupled networks. We mathematically prove that the eigenvector corresponding to the largest eigenvalue of the network's Laplacian matrix is enough for examining synchrony alignment and that the functionality of this vector depends on the corresponding eigenvalue. Moreover, we prove... 

Cartesian Genetic Programming (CGP) has an unusual genotype representation which makes it more efficient than Genetic programming (GP) in digital circuit design problem. However, to the best of our knowledge, all methods used in evolutionary design of digital circuits deal with rugged, complex search space, which results in long running time to obtain successful evolution. Therefore, employing a method to guide evolution in these spaces can facilitate achieving more reasonable results. It has been claimed that a two-step evolutionary scenario caused by benefit and cost of learning called Baldwin effect can guide evolution in the biology and artificial life. Therefore, we have been motivated... 

In search of low cost and flexible substrates organic transistors have been suggested as an alternate to silicon transistors. Level 1 model extraction, investigating different circuit styles and proposing two new circuit styles for organic integrated circuits is done in this paper. First, level 1 model of organic transistor is found using ID-VDS characteristics of transistors reported by [9]. After that different design styles used in CMOS digital integrated circuits are reviewed and the functionality of these styles for organic integrated circuits is investigated. Two new circuit styles have been proposed in this section which have better performance for organic circuits comparing with... 

This article reports the first oil-absorbent cross-linked copolymer consisting of modified multiwalled carbon nanotube (MWCNT) and showing high oil absorbency. Also, to investigate and evaluate the effective parameters on oil absorbency, cross-linked dodecyl methacrylate (DDMA)-diphenylacrylamide (DPAA) and DDMA-butyl acrylate (BA) copolymers were synthesized. DDMA was copolymerized with different mol% of DPAA or BA and cross-linked using azobisisobutyronitrile as the initiator and various weight percentages of 1,4-butandiol dimethacrylate, methylene bisacrylamide, or vinyl group-modified MWCNT cross-linkers. The effects of monomer feed composition, cross-linker concentration, and the...