Sharif Digital Repository

Controlling networked dynamical systems is a complex endeavor, specifically keeping in mind the fact that in many scenarios the actors that are engaged in the dynamism behave selfishly and therefore only take into account their own individual utility, a setting that has been widely studied in the field of game theory. One way that we can control the system dynamics is through the use of control parameters that are at our disposal, but finding optimal values for these parameters is a complex and time consuming task. In this paper we use the relation between network structural properties and control parameters to create a mathematical model that uses learning methods to find optimal values... 

The basic goal of this article is to present an abstract system-theoretic approach to morphological filtering and the theory of translation invariant systems which is mainly based on residuated semigroups. Some new results as well as a number of basic questions are also introduced  

In a previous paper we introduced a generalized model for translation invariant (TI) operators. In this model we considered the space, φ of all maps from an abelian group G to ω U {-∞}, called LG-fuzzy sets, where ω is a complete lattice-ordered group; and we defined TI operators on this space. Also, in that paper, we proved strong reconstruction theorem to show the consistency of this model. This theorem states that for an order-preserving TI operator Y one can explicitly compute Y(A), for any A, from a specific subset of φ called the base of Y. In this paper duality is considered in the same general framework, and in this regard, continuous TI operators are studied. This kind of operators... 

We consider translation invariant (TI) operators on Φ, the set of maps from an abelian group G to Ω ∪ {−∞} , called LG-fuzzy sets, where 0 is a complete lattice ordered group. By defining Minkowski and morphological operations on Φ and considering order preserving operators, we prove a reconstruction theorem. This theorem, which is called the Strong Reconstruction Theorem (SRT), is similar to the Convolution Theorem in the theory of linear and shift invariant systems and states that for an order preserving TI operator Y one can explicitly compute Y ( A ), for any A , from a specific subset of Φ called the base of Y . The introduced framework is a general model for the theory of translation... 

The main goal of this paper is to verify classical properties of morphological operators within the general model of translation invariant (TI) systems. In this model, TI operators are defined on the space of LG-fuzzy sets Φ i.e. Φ = {A: G → Ω ∪ {− ∞}} in which G is an abelian group and Ω is a complete lattice ordered group. A TI operator Y is an operator on Φ which is invariant under translation on G and Ω as groups. We consider the generalization of Minkowski addition (D on Φ and we emphasize that (Φ,⊛) is an involutive residuated topological monoid. We verify all properties of traditional (set-theoretic) morphological operators as well as classical representations (Matheron, 1967) for... 

Let G be a simple undirected uniquely vertex k-colorable graph, or a k-UCG for short. M. Truszczyński [Some results on uniquely colorable graphs, in Finite and Infinite Sets, North-Holland, Amsterdam, 1984, pp. 733--748] introduced $e^{^{*}}(G)=|V(G)|(k-1)-{k \choose 2}$ as the minimum number of edges for a k-UCG and S. J. Xu [J. Combin. Theory Ser. B, 50 (1990), pp. 319--320] conjectured that any minimal k-UCG contains a Kk as a subgraph. In this paper, first we introduce a technique called forcing. Then by applying this technique in conjunction with a feedback structure we construct a k-UCG with clique number k-t, for each $t \geq 1$ and each k, when k is large enough. This also... 

In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher’s inequality for G-designs  

Let d(σ)d(σ) stand for the defining number of the colouring σσ. In this paper we consider View the MathML sourcedmin=minγd(γ) and View the MathML sourcedmax=maxγd(γ) for the onto χχ-colourings γγ of the circular complete graph Kn,dKn,d. In this regard we obtain a lower bound for dmin(Kn,d)dmin(Kn,d) and we also prove that this parameter is asymptotically equal to χ-1χ-1. Also, we show that when χ⩾4χ⩾4 and s≠0s≠0 then dmax(Kχd-s,d)=χ+2s-3dmax(Kχd-s,d)=χ+2s-3, and, moreover, we prove an inequality relating this parameter to the circular chromatic number for any graph G  

Passive radars use illuminators of opportunity to detect target and measure its parameters. The usual processing routine consists of direct path interference and clutter removal and computation of cross ambiguity function (CAF) to estimate ampIitude-range-Doppler surface. Main parameters affecting this procedure are direct path interference and clutter, receiver thermal noise and near large targets. This paper presents an investigation on effect of each parameter and tries to estimate processing gain of each Block. A comparison between different adaptive interference removal methods also presented  

Herein, we demonstrated a facile method for the fabrication of magnetic and superhydrophobic polyurethane sponge with water contact angle of 159° as an adsorbent for cleanup the marine oil spill pollution. For this aim, a polyurethane sponge was coated with carbon black (CB), hexagonal boron nitride (h-BN)@Fe3O4, and acrylic resin and then characterized by different techniques. Owing to the chemical and thermal stability of h-BN and CB, the modified sponge was stable under corrosive conditions (pH = 1–14 and salt solutions) and at different temperatures (−12 °C–105 °C). In addition to common oils and organic solvents, we also used the real spilled oils containing monoaromatics and... 

The rapid and effective separation of high-viscosity heavy crude oil from seawater is a worldwide challenge. Herein, an ultralow density, photothermal, superhydrophobic, and thermally conductive polyurethane/polyaniline/hexagonal boron nitride@Fe3O4/polyacrylic-oleic acid resin sponge (PU/PANI/h-BN@Fe3O4/AR) was fabricated with a water contact angle (WCA) of 158°, thermal conductivity of 0.76 W m-1 K-1, density of 0.038 g cm-3, limited oxygen index (LOI) of 28.82%, and porosity of 97.97% and used for solar-assisted separation of high-viscosity crude oil from water. Photothermal components were composed of PANI and Fe3O4, while h-BN particles were used as thermally conductive and flame... 

Herein, a series of superhydrophobic thin polyacrylic resin-coated carbon black (CB)/hexagonal boron nitride (h-BN)@Fe3O4/cellulose composite papers with good flexibility, low density (~0.67 g/cm3), high electrical conductivity (~0.065 S/cm), good thermal conductivity (0.462 W.m−1. K−1), and with water contact angle (WCA) of 153° were successfully fabricated by a facile dip-coating/spraying method. The CB-BN@Fe3O4 distribution in cellulose matrix provided high electrical conductivity in the in-plane and thickness directions. The electrical conductivity in both in-plane and thickness directions increased by increasing the number of vacuum-assisted dip-coating cycles. Moreover, these...