Sharif Digital Repository

The extent of the self-association of water in supercritical CO2 has been investigated in a wide range of density and temperature by the test particle insertion technique. The results show that the association constant for water decreases with temperature and weakly depends on CO2 density. This weak density dependence provides evidence for the lack of a strong specific CO2-water interaction. Comparing calculated association constants with its gas-phase values shows that the association constant is at most ca. 38% lower than its gas-phase value in the high density-low temperature region. Inspection of the simulated radial distribution functions revealed that forming modest water-CO2 complexes... 

In 1974 Dijkstra introduced the seminal concept of self-stabilization that turned out to be one of the main approaches to fault-tolerant computing. We show here how his three solutions can be formalized and reasoned about using the concepts of game theory. We also determine the precise number of steps needed to reach self-stabilization in his first solution. © Springer International Publishing AG, part of Springer Nature 2018  

Temporal and spatial analysis of dynamics of hybrid transversely excited atmospheric pressure (TEA)-CO2 lasers is studied using two different models with four and eight energy levels. These models are used for simulation of the laser and computing the output energy. Effects of several parameters such as input energies and gas mixture concentrations (especially presence of CO molecules) are also studied. © 2007 Elsevier Ltd. All rights reserved  

When the periodic permittivity of two-dimensional (2D) photonic crystal (PC) can be separated in x- and y- coordinates, one can consider the structure as two separate 1D photonic crystals, one of them being periodic in x coordinate and the other in y coordinate. If it is possible to find a proper separable permittivity function, we can approximate a 2D PC with two distinct 1D structures. One of the advantages is rapid calculation the density of state of a 2D PC. In this article an analytical calculation of the density of states for such a 2D PC has been done with the aim of taking this advantage. For calculating the density of states we use the effective resonance approach to analyze the 1D... 

The spin structure in a magnetic dot is studied as a function of the exchange coupling strength and dot size within the semiclassical approximation on a discrete lattice. As the exchange coupling is decreased or the size is increased, the ground state undergoes a phase change from a homogeneous single-domain ferromagnet (HSDF) to a spin vortex. The line separating these two phases has been calculated numerically for small system sizes. The dipolar interaction has been fully included in our calculations. Magnon frequencies in such a dot have also been calculated in both phases by the linearized equation of motion method. These results have also been reproduced from the Fourier transform of... 

Future communication and computation devices require mechanisms for on-the-fly reconfiguration in their protocol stack to operate in different situations and networks. This paper proposes a component-based framework for dynamic-reconfigurable protocol stack. Considering that every running protocol component communicates with at least one peer component, unlike related work our framework supports synchronous reconfiguration of two peer protocol components in two communicating protocol stacks. © Springer-Verlag Berlin Heidelberg 2007  

With the increasing use of pervasive computing environments (PCEs), developing dynamic reconfigurable software in such environments becomes an important issue. The ability to change software components in running systems has advantages such as building adaptive, long-life, and self-reconfigurable software as well as increasing invisibility in PCEs. As dynamic reconfiguration is performed in error-prone wireless mobile systems frequently, it can threaten system safety. Therefore, a mechanism to support assured dynamic reconfiguration at run-time for PCEs is required. In this paper, we propose an Assured Dynamic Reconfiguration Framework (ADRF) with emphasis on assurance analysis. The... 

Block motion estimation is an important field of video processing. This paper presents a new scheme to reach in faster block motion estimation based on motion prediction. The scheme exploits an adaptive filter to predict the block motion from its spatio-temporal motion compensated adjacent blocks, the predicted motion determines the initial candidate block for search methods with biased search center, in special case of partial distortion search, this strategy reduces search time by preventing from complete distortion calculation for more loser candidates, after comparison of three conventional adaptive filters, a normalized least mean square filter with convergence monitoring is recommended... 

Measuring semantic similarity of web services has several benefits and most of the proposed service discovery algorithms are based on measuring the similarity of the requested service with each of the advertised services. In this paper, we propose a method for measuring the similarity of web services which are annotated with OWL-S ontology. First, a semantic similarity measure for determining the similarity of OWL concepts is discussed and then based on this measure, the functional similarity of services is defined. Then it is showed that the precision of algorithms that only take into account the functional properties of services for measuring their similarity are low. Therefore the textual... 

The main purpose of this work is to improve the efficiency and performance of a primitive finite volume element method which provides superior capability on a single platform. This method is suitably extended in order to use the advantages of parallel computing on multiprocessors or multicomputers. The method is fully implicit which renders huge sparse linear algebraic kernels. Nevertheless, the attention is focused on solving the sparse system rather than constructing it. The current method is a cell-centered scheme. Since the grid is unstructured, each non-boundary node engages with nodes on three or more surrounding elements around that node. Depending on global node numbering, the... 

In this paper, we introduce the problem of private sequential function computation, where a user wishes to compute a composition of a sequence of K linear functions, in a specific order, for an arbitrary input. The user does not run these computations locally, rather it exploits the existence of N non-colluding servers, each can compute any of the K functions on any given input. However, the user does not want to reveal any information about the desired order of computations to the servers. For this problem, we study the capacity, defined as the supremum of the number of desired computations, normalized by the number of computations done at the servers, subject to the privacy constraint. In... 

Predictions of the gas temperature and pressure profiles are vital to the design and operation of gas transmission lines. Available analytical methods for the calculation of these profiles are evaluated and a numerical framework for the rigorous calculation has been developed. The predictions from both the analytical and numerical procedure have been compared to field data from the Iranian Gas Trunk-lines (IGAT). These comparisons showed that all the available methods were tuned using data obtained from small to medium diameter pipes extrapolated poorly to large diameter pipelines. In order to improve the predictions for large diameter pipelines, the effect of model parameters such as soil... 

Based on a new derived radial distribution function (RDF) for potentials with a hard-core we have presented in this paper a method to apply the derived RDF for calculating thermodynamic properties of real fluids up to moderate densities. In order to use the derived RDF for real fluids, one of the potential parameters is chosen in such a way that the RDF behaves more like that for a real fluid. Hence we have been able to calculate all thermodynamic properties of a simple fluid analytically. We have then applied our procedure to a Lennard-Jones fluid and compared the results with simulation data. The agreement is good up to moderate densities, i.e. ρ* ≤ 0.6, which lies in the liquid range of... 

Composite field arithmetic is known as an alternative method for lookup tables in implementation of S-box block of AES algorithm. The idea is to breakdown the computations to lower order fields and compute the inverse there. Recently this idea have been used both for reducing the area in implementation of S-boxes and masking implementations of AES algorithm. The most compact design using this technique is presented by Canright using only 92 gates for an S-box block. In another approach, IAIK laboratory has presented a masked implementation of AES algorithm with higher security comparing common masking methods using Composite field arithmetic. Our work in this paper is to use basic ideas of... 

Motion estimation is an important field of video processing. Conventional block motion estimation methods consider all pixels equally. In this paper a new edge sensitive algorithm is proposed in which distortion of ridgelet coefficients is calculated partially and compared over all candidates. Using an edge boosting distortion function, edge pixels will have more important role since they introduce larger ridgelet coefficients. Inherent ability of ridgelet in representing edges with various directions in multi scale, makes it a powerful tool for edge pursuit. Proposed partial ridgelet distortion search (PRDS) do not reject any candidate without assessment while performs relatively fast since... 

Recognition of cursive handwritings such as Persian script is a hard task as there is no fixed segmentation and simultaneous segmentation and recognition is required. This paper presents a novel comparison method for such tasks which is based on a Multiple States Machine to perform robust elastic comparison of small segments with high speed through generation and maintenance of a set of concurrent possible hypotheses, The approach is implemented on Persian (Farsi) language using a typical feature set and a specific tailored genetic algorithm and the recognition and computation time is compared with dynamic programming comparison approach. Copyright - World Automation Congress (WAC) 2006  

In ubiquitous computing environments, many devices and agents interoperate with each other and use services provided by others. But the problem is that there may be requests that can not be fulfilled by available services. A solution to this problem is to use service brokers that compose existing services and create new value added services that can fulfill the clients' requests. In this paper, we present an architecture for a context-aware service broker that not only is able to compose services for responding to new requests, but also considers the context of its clients for providing customized and personalized outputs and behaviors. © 2006 IEEE