Sharif Digital Repository

In this paper, a practical simulation method for optimizing of x-ray reflection of nano-multilayer mirrors in three different edge energies: Cr-Kα, Co-Kα, and Ti-Kα is discussed in order to obtain the most reflection based on quarter-wave thickness method (QW). In this method, the reflected x-ray will have a constructive interference, and a peak, called Brag peak, will appear in reflection curve when the tickness of the layer is an odd multiple of the quarter-wave thickness. The quarter-wave thickness is dependent to on the angle and energy of the entrance photon beam. In the mentioned edge energies, for different nano-multilayer mirrors, and for incident angle ranges from 0.5 to 8 degrees,... 

The current work deals with modification of the surface of a silica-polyamine with amine-based ionic liquid (IL) and its application for removal of Cu2+ from an aqueous media. The absorbent is simply prepared from commercially available reagents. The material is characterized by FT-IR spectroscopy, thermogravimetric analysis (TGA), N2 adsorption-desorption, and transmission electronic microscopy (TEM). Effects of several parameters on absorption efficiency, as well as activity of the absorbent to other metals, are also investigated. Moreover, the reusability of the absorbent is studied at the optimized condition. © The Royal Society of Chemistry 2016  

One of the most primary phases of automatic text processing is spelling error detection and grapheme normalization. Storing textual documents faces several problems without passing this phase, which causes a disturbance in retrieving the documents automatically. Therefore, specialists in the fields of natural language processing and computational linguistics usually make an attempt to sample various data through presenting ideal methods and algorithms in order to reach the normalized data. Several researches have been conducted on English and some other languages, which have been followed by a certain amount of researches on Farsi too. Sometimes, these several researches have remained to be... 

An essential requirement for performing robotic assisted surgery on a freely beating heart is a prediction algorithm which can estimate the future trajectory of the heart in the varying heart rate (HR) conditions of real surgery with a high accuracy. In this study, a hybrid amplitude modulation- (AM) and autoregressive- (AR) based algorithm was developed to enable estimating the global and local oscillations of the beating heart, raised from its major and minor physiological activities. The AM model was equipped with an estimator of the heartbeat frequency to compensate for the HR variations. The RMS of the prediction errors of the hybrid algorithm was in the range of 165–361 μm for the... 

Background: An essential requirement for performing robotic-assisted surgery on a freely beating heart is a prediction algorithm that can estimate the future heart trajectory. Method: Heart motion, respiratory volume (RV) and electrocardiogram (ECG) signal were measured from two dogs during thoracotomy surgery. A comprehensive multimodality prediction algorithm was developed based on the multivariate autoregressive model to incorporate the heart trajectory and cardiorespiratory data with multiple inherent measurement rates explicitly. Results: Experimental results indicated strong relationships between the dominant frequencies of heart motion with RV and ECG. The prediction algorithm... 

Present work illustrated that the performance of ultrafine silica (Si) particles was improved considerably by rational hybridization with nanodiamond (ND). For this, Si@ND hybrid particles synthesized by chemical hybridization were incorporated into styrene-butadiene rubber (SBR) up to 10 phr. Scanning electron microscopy revealed coarse flower-like clusters for Si@ND nanohybrids, while Si exhibited rigid agglomerates in SBR. Comparing with physical hybrid (Si&ND) and single Si particles, it was revealed that chemical hybrids synergistically improved tensile properties, like 100% and 135% improvements in tensile strength and elongation at break, respectively. Dynamic mechanical analysis of... 

Background: Accurate tracking of the heart surface motion is a major requirement for robot assisted beating heart surgery. Method: The feasibility of a stereo infrared tracking system for measuring the free beating heart motion was investigated by experiments on a heart motion simulator, as well as model surgery on a dog. Results: Simulator experiments revealed a high tracking accuracy (81 μm root mean square error) when the capturing times were synchronized and the tracker pointed at the target from a 100 cm distance. The animal experiment revealed the applicability of the infrared tracker with passive markers in practical heart surgery conditions. Conclusion: With the current technology,... 

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