Loading...
Search for:
gohari-derakhshande--parviz
0.112 seconds
Total 140 records
Synthesis and Study of Catalytic Activity of[Ru(oxazine)2(EtOH)2]Cl complex in epoxidation of Olefins and Oxidation of Alkanes, Alcohol and Sulfide with TBHP and UHP
, M.Sc. Thesis Sharif University of Technology ; Bagherzadeh, Mojtaba (Supervisor)
Abstract
Ruthenium complexes with their wide range of stable but chemically accessible oxidation states have been extensively studied as catalyst of hydrocarbon oxidation. In recent years, these complexes with various ligands have been reported as new catalysts with better selectivity and several co-oxidations. Ruthenium complexes act as oxidation catalyst, often via ruthenium-oxo species as active intermediates in the oxygen transfer process, oxidizing alcohols or alkanes and epoxidizing alkane. Here, we reported the synthesis and catalytic activity of a ruthenium(III) complex with bidentate oxazine ligand. The new synthesized Ru(III)-oxazine complex was characterized by IR and UV-Vis spectra and...
Conduct an Investigation on Nanostructure of Al-20Si-5Fe Alloy, Produced by Melt Spinning Process and Observation of Mechanical-Metallurgical Properties
, M.Sc. Thesis Sharif University of Technology ; Davami, Parviz (Supervisor)
Abstract
In this study, Al-20Si-5Fe ribbons produced by melt-spinning method. Nanostructure and growth morphology of rapidly solidified products explored using optical microscope, scanning electron microscope and x-ray diffraction. Microstructural investigations depicted two distinctive zones of featureless (faceted morphology) and dendritic. In addition, no intermetallic phases could be observed in the rapidly solidified ribbons in comparison with coarsed and needle shaped intermetallic phases of as cast alloys which it demonstrates the extension of solid solubility of Si and Fe in the matrix and consequently intermetallics formation was hindered by higher cooling rates. Subsequently, ribbons...
Infeasibility proof and information state in network information theory
, Article IEEE Transactions on Information Theory ; Vol. 60, Issue. 10 , 2014 , Pages 5992-6004 ; ISSN: 00189448 ; Anantharam, V ; Sharif University of Technology
2014
Abstract
In this paper, we revisit the structure of infeasibility results in network information theory, based on a notion of information state. We also discuss ideas for generalizing a known outer bound for lossless transmission of independent sources over a network to one of lossy transmission of dependent sources over the same network. To concretely demonstrate this, we apply our ideas and prove new results for lossy transmission of dependent sources by generalizing: 1) the cut-set bound; 2) the best known outer bound on the capacity region of a general broadcast channel; and 3) the outer bound part of the result of Maric, Yates, and Kramer on strong interference channels with a common message
Comments on 'Information-Theoretic Key Agreement of Multiple Terminals - Part I'
, Article IEEE Transactions on Information Theory ; Volume 63, Issue 8 , 2017 , Pages 5440-5442 ; 00189448 (ISSN) ; Anantharam, V ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2017
Abstract
Theorem 5 of A. Gohari, V. Anantharam, IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3973-3996, 2010, states an upper bound on the secrecy capacity for the source model problem. It has a three page proof given in Appendix B of the paper. Unfortunately, we show that this bound does not provide any improvement over the simpler bound given in Corollary 1 of the paper. We also provide an example of a family of two agent source model problems where the one-way secrecy rate in each direction is zero, but the secrecy rate is nonzero and can be determined exactly as a conditional mutual information. © 1963-2012 IEEE
Optimal Design of Feeding System in Steel Castings
, Ph.D. Dissertation Sharif University of Technology ; Davami, Parviz (Supervisor)
Abstract
n the present study, the optimal design of feeding system in steel sand-mold castings is considered. The first part of this research includes fundamental studies on the physics of shrinkage defect formation during the casting process. The results of these studies lead to new findings on the mechanism of shrinkage defect formation, effect of melt quality on the distribution of defects within the castings and the connection between shrinkage and gases defects. The theoretical analysis of thermal criterion functions for the prediction of shrinkage defects in castings and introducing new criterion function with fewer shortcomings can be accounted as the other finding of this part. A new model...
Generating dependent random variables over networks
, Article 2011 IEEE Information Theory Workshop, ITW 2011 ; 2011 , Pages 698-702 ; 9781457704376 (ISBN) ; Anantharam, V ; Sharif University of Technology
2011
Abstract
In this paper we study the problem of generation of dependent random variables, known as the coordination capacity [4], [5], in multiterminal networks. In this model m nodes of the network are observing i.i.d. repetitions of X (1), X (2),⋯, X (m) distributed according to q(x (1),⋯, x (m)). Given a joint distribution q(x (1),⋯,x (m), y (1), ⋯, y (m)), the final goal of the i th node is to construct the i.i.d. copies of Y (i) after the communication over the network where X (1), X (2),⋯, X (m), Y (1), Y (2),⋯, Y (m) are jointly distributed according to q(x (1), , x (m), y (1),⋯,y (m)). To do this, the nodes can exchange messages over the network at rates not exceeding the capacity constraints...
On group-characterizability of homomorphic secret sharing schemes
, Article Theoretical Computer Science ; Volume 891 , 2021 , Pages 116-130 ; 03043975 (ISSN) ; Khazaei, S ; Parviz, M ; Sharif University of Technology
Elsevier B. V
2021
Abstract
A group-characterizable (GC) random variable is induced by a finite group, called main group, and a collection of its subgroups. The notion extends directly to secret sharing schemes (SSSs). It is known that linear and abelian SSSs can be equivalently described in terms of GC SSSs. In this paper, we present a necessary and sufficient condition for a SSS to be equivalent to a GC one. Using this result, we show that homomorphic SSSs (HSSSs) are equivalent to GC SSSs whose subgroups are normal in the main group. We also present two applications for this equivalent description of HSSSs. One concerns lower bounding the information ratio of access structures for the class of HSSSs, and the other...
Probabilistic thermal stability of laminated composite plates with temperature-dependent properties under a stochastic thermal field
, Article Acta Mechanica ; Volume 233, Issue 4 , 2022 , Pages 1351-1370 ; 00015970 (ISSN) ; Fakoor, M ; Hosseini, F ; Sharif University of Technology
Springer
2022
Abstract
Probabilistic thermal buckling analysis of composite plates with temperature-dependent properties under stochastic thermal fields is performed by developing a new temperature increment-based algorithm for solving the stochastic nonlinear equation. The temperature distribution is assumed to be a stochastic Gaussian field which leads to spatially varying stochastic mechanical properties. The stochastic thermal field is decomposed by applying the Karhunen–Loeve theorem. The combination of stochastic assumed mode method and polynomial chaos is proposed as an alternative solution for the time-consuming stochastic finite element method. The uncertainty of the critical temperature is studied by...
On ideal and weakly-ideal access structures
, Article Advances in Mathematics of Communications ; Volume 17, Issue 3 , 2023 , Pages 697-713 ; 19305346 (ISSN) ; Khazaei, S ; Parviz, M ; Sharif University of Technology
American Institute of Mathematical Sciences
2023
Abstract
For more than two decades, proving or refuting the following statement has remained a challenging open problem in the theory of secret sharing schemes (SSSs): every ideal access structure admits an ideal perfect multi-linear SSS. The class of group-characterizable (GC) SSSs include the multi-linear ones. Hence, if the above statement is true, then so is the following weaker statement: every ideal access structure admits an ideal perfect GC SSS. One contribution of this paper is to show that ideal SSSs are not nec-essarily GC. Our second contribution is to study the above two statements with respect to several variations of weakly-ideal access structures. Recently, Mejia and Montoya studied...
On the Applications of Grobner Basis
, M.Sc. Thesis Sharif University of Technology ; Pournaki, Mohammad Reza (Supervisor)
Abstract
Grobner bases were introduced by Bruno Buchberger in 1965. The terminology acknowledges the influence of Wolfgang Grobner on Buchberger’s work. He introduced a specific generator for ideals in the ring of polynomials over a field and then gave an algorithm for computing of that generator. It leads to solutions to a large number of algorithmic problems that are related to polynomials in several variables. Most notably, algorithms that involve Grobner basis computations allow exact conclusions on the solutions of systems of nonlinear equations, such as the (geometric) dimension of the solution set,the exact number of solutions in case there are finitely many, and their actual computation with...
The Effect of Mn on Microstructure and Mechanical Properties on Splat Cooled Al-20Si-5Fe-3Cu-1Mg Alloy
, M.Sc. Thesis Sharif University of Technology ; Davami, Parviz (Supervisor)
Abstract
In this research ,Al-20Si-5Fe-3Cu-1Mg-XMn alloys were produced by gas atomizing and melt spinning processes. Microstructure and growth morphology of powder and ribbons were investigated using optical microscopy , scanning electron microscopy. powders were hot pressed at 400ºC/250Mpa and microstractural variations, mechanical properties were evaluated after consolidation. Results show that relatively high cooling rate in gas-atomized powders lead to refinement of microstructure and formation of semi-equilibrium δ intermetallic phase . As the powder particle size decrease , the growth morphology changes from primary silicon + euthectic to euthectic + primary dendritic aluminum . Mn changed the...
Critical graphs in index coding
, Article IEEE International Symposium on Information Theory - Proceedings ; 2014 , p. 281-285 ; Shahrasbi, A ; Gohari, A ; Sharif University of Technology
2014
Abstract
In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph with minimum number of edges for both one-shot and asymptotic cases. For the general case of possibly distinct rates, we show that for one-shot and asymptotic linear index coding, as well as asymptotic non-linear index coding, each critical graph is a union of disjoint strongly connected subgraphs (USCS). On the other hand, we identify a non-USCS critical graph for a one-shot non-linear index coding problem. In addition, we show that the capacity region of...
When is it possible to simulate a DMC channel from another?
, Article 2013 IEEE Information Theory Workshop, ITW 2013 ; Sept , 2013 , Page(s): 1 - 5 ; 9781479913237 (ISBN) ; Yassaee, M. H ; Aref, M. R ; Gohari, A
2013
Abstract
In this paper, we study the problem of simulating a DMC channel from another DMC channel. We assume that the input to the channel we are simulating is i.i.d. and that the transmitter and receivers are provided with common randomness at limited rates. We prove bounds for simulating point-to-point, MAC and broadcast channels. As a special case, we recover the achievability part of the result of Cuff for point-to-point channel simulation via a noiseless link and shared randomness
On Marton's inner bound for broadcast channels
, Article IEEE International Symposium on Information Theory - Proceedings, 1 July 2012 through 6 July 2012 ; July , 2012 , Pages 581-585 ; 9781467325790 (ISBN) ; Nair, C ; Anantharam, V ; Sharif University of Technology
2012
Abstract
Marton's inner bound is the best known achievable region for a general discrete memoryless broadcast channel. To compute Marton's inner bound one has to solve an optimization problem over a set of joint distributions on the input and auxiliary random variables. The optimizers turn out to be structured in many cases. Finding properties of optimizers not only results in efficient evaluation of the region, but it may also help one to prove factorization of Marton's inner bound (and thus its optimality). The first part of this paper formulates this factorization approach explicitly and states some conjectures and results along this line. The second part of this paper focuses primarily on the...
Deterministic randomness extraction from generalized and distributed santha-vazirani sources
, Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6 July 2015 through 10 July 2015 ; Volume 9134 , 2015 , Pages 143-154 ; 03029743 (ISSN) ; 9783662476710 (ISBN) ; Etesami, O ; Gohari, A ; Sharif University of Technology
Springer Verlag
2015
Abstract
A Santha-Vazirani (SV) source is a sequence of random bits where the conditional distribution of each bit, given the previous bits, can be partially controlled by an adversary. Santha and Vazirani show that deterministic randomness extraction from these sources is impossible. In this paper, we study the generalization of SV sources for nonbinary sequences. We show that unlike the binary case, deterministic randomness extraction in the generalized case is sometimes possible. We present a necessary condition and a sufficient condition for the possibility of deterministic randomness extraction. These two conditions coincide in “non-degenerate” cases. Next, we turn to a distributed setting. In...
The value of information-theoretic content of help bits for computation
, Article IWCIT 2015 - Iran Workshop on Communication and Information Theory, 6 May 2015 through 7 May 2015 ; 2015 ; 9781479982356 (ISBN) ; Etesami, O ; Gohari, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2015
Abstract
'Help bits' are some limited trusted information about an instance or instances of a computational problem that may reduce the computational complexity of solving that instance or instances. Assume that we can efficiently solve k instances of a decision problem using some help bits whose entropy is less than k when the k instances are drawn independently from a particular distribution. Then there is an upper bound on the average-case complexity of the problem, namely we can efficiently solve an instance drawn from that distribution correctly with probability better than 1/2
The value of help bits in randomized and average-case complexity
, Article Computational Complexity ; Volume 26, Issue 1 , 2017 , Pages 119-145 ; 10163328 (ISSN) ; Etesami, O ; Gohari, A ; Sharif University of Technology
Birkhauser Verlag AG
2017
Abstract
“Help bits" are some limited trusted information about an instance or instances of a computational problem that may reduce the computational complexity of solving that instance or instances. In this paper, we study the value of help bits in the settings of randomized and average-case complexity. If k instances of a decision problem can be efficiently solved using ℓ< k help bits, then without access to help bits one can efficiently compute a k-bit vector that is not equal to the k-bit vector of solutions to the k instances. A decision problem with this property is called k-membership comparable. Amir, Beigel, and Gasarch (1990) show that for constant k, all k-membership comparable languages...
Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
, Article SIAM Journal on Computing ; Volume 46, Issue 1 , 2017 , Pages 1-36 ; 00975397 (ISSN) ; Etesami, O ; Gohari, A ; Sharif University of Technology
Society for Industrial and Applied Mathematics Publications
2017
Abstract
A Santha-Vazirani (SV) source is a sequence of random bits where the conditional distribution of each bit, given the previous bits, can be partially controlled by an adversary. Santha and Vazirani show that deterministic randomness extraction from these sources is impossible. In this paper, we study the generalization of SV sources for nonbinary sequences. We show that unlike the binary setup of Santha and Vazirani, deterministic randomness extraction in the generalized case is sometimes possible. In particular, if the adversary has access to s "nondegenerate" dice that are c-sided and can choose one die to throw based on the previous realizations of the dice, then deterministic randomness...
How compressible are innovation processes?
, Article IEEE Transactions on Information Theory ; Volume 64, Issue 7 , 2018 , Pages 4843-4871 ; 00189448 (ISSN) ; Amini, A ; Gohari, A ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2018
Abstract
The sparsity and compressibility of finite-dimensional signals are of great interest in fields, such as compressed sensing. The notion of compressibility is also extended to infinite sequences of independent identically distributed or ergodic random variables based on the observed error in their nonlinear $k$ -term approximation. In this paper, we use the entropy measure to study the compressibility of continuous-domain innovation processes (alternatively known as white noise). Specifically, we define such a measure as the entropy limit of the doubly quantized (time and amplitude) process. This provides a tool to compare the compressibility of various innovation processes. It also allows us...
Power control to enable QoS for indoor wireless infrared CDMA networks
, Article HUT-ICCE 2006 1st International Conference on Communications and Electronics, Hanoi, 10 October 2006 through 11 October 2006 ; Volume PART 1 , 2006 , Pages 246-252 ; 1424405688 (ISBN); 9781424405688 (ISBN) ; Pakravan, M. R ; Sharif University of Technology
2006
Abstract
Wireless infrared optical CDMA (W-OCDMA) is a new developing technique with some useful applications. Control and efficient use of optical power is a key issue in analysis and design of these systems. Also, multi user interference is a major source if impairment in these system. As a result, power control is a key issue in design and implementation of these systems. In this article we investigate a Dynamic Resource Management Algorithm (DRMA) as a framework, which employs power control to enable QoS in terms of reliability for multimedia traffic in W-OCDMA networks using Optical Orthogonal Codes (OOC's). A numerical method is also proposed to overcome computational difficulties of call...