Sharif Digital Repository

Low-power wireless stand-alone sensors that can operate without any wiring have received significant attention in sensor network applications. These devices harvest environmental energy resources to supply their power and transfer their collected data using wireless RF links. In many instances, the power supplied from the environment is far less than the power required by the sensor device. In this case, the main solution is to accumulate energy on a storage element, and when enough energy is stored, the sensor node is instantaneously activated using an undervoltage lockout (UVLO) circuit. During this short time burst, the sensor performs the required acquisition, transmits the results, and... 

GitHub's issue reports provide developers with valuable information that is essential to the evolution of a software development project. Contributors can use these reports to perform software engineering tasks like submitting bugs, requesting features, and collaborating on ideas. In the initial versions of issue reports, there was no standard way of using them. As a result, the quality of issue reports varied widely. To improve the quality of issue reports, GitHub introduced issue report templates (IRTs), which pre-fill issue descriptions when a new issue is opened. An IRT usually contains greeting contributors, describing project guidelines, and collecting relevant information. However,... 

We have constructed a collaboration network for physicists based in Iran working in different disciplines. By discussing properties like collaborators per author, shortest path, betweenness, and the concept of power in networks for this local model, and comparing with the global model, we understand how a developing country in the Middle East is contributing to the scientific growth in the world statistically. In this comparison, we found some properties of the local model which were not in accordance with the standard global society of science, which should be considered in developing the future policies. Our results show significant differences in factors like the degree and the diameter... 

Balance theory proposed by Heider for the first time modeled triplet interaction in a signed network, stating that relationships between two people, friendship or enmity, is dependent on a third person. The Hamiltonian of this model has an implicit assumption that all triads are independent, meaning that the type of each triad, being balanced or imbalanced, determined apart from the state of other triads. This independence forces the network to have completely balanced final states. However, there exists evidence indicating that real networks are partially balanced, raising the question of what is the mechanism preventing the system to be perfectly balanced. Our suggestion is to consider a... 

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