#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2012

2017

- This year (3)
- Last 5 years (23)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- M. H. Heydari, Mohammad Reza Hooshmandasl, Farid Mohammad Maalek Ghaini, Fakhrodin Mohammadi
- J. Applied Mathematics
- 2012

The operational matrices of fractional-order integration for the Legendre and Chebyshev wavelets are derived. Block pulse functions and collocation method are employed to derive a general procedure for forming these matrices for both the Legendre and the Chebyshev wavelets. Then numerical methods based on wavelet expansion and these operational matrices are… (More)

- Ali Akbar Estaji, Mohammad Reza Hooshmandasl, Bijan Davvaz
- Inf. Sci.
- 2012

In this paper, we intend to study a connection between rough sets and lattice theory. We introduce the concepts of upper and lower rough ideals (filters) in a lattice. Then, we offer some of their properties with regard to prime ideals (filters), the set of all fixed points, compact elements, and homomorphisms. 2012 Elsevier Inc. All rights reserved.

- Ali Shakiba, Mohammad Reza Hooshmandasl
- Fundam. Inform.
- 2015

- M. H. Heydari, Mohammad Reza Hooshmandasl, Farid Mohammad Maalek Ghaini, Carlo Cattani
- J. Comput. Physics
- 2014

In this paper, a new computational method based on the generalized hat basis functions is proposed for solving stochastic Itô-Volterra integral equations. In this way, a new stochastic operational matrix for generalized hat functions on the finite interval [0, T ] is obtained. By using these basis functions and their stochastic operational matrix, such… (More)

- M. H. Heydari, Mohammad Reza Hooshmandasl, Fakhrodin Mohammadi
- Applied Mathematics and Computation
- 2014

- Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi
- Discrete Applied Mathematics
- 2016

A set S ⊆ V of the graph G = (V,E) is called a [1, 2]-set of G if any vertex which is not in S has at least one but no more than two neighbors in S. A set S� ⊆ V is called a [1, 2]-total set of G if any vertex ofG, no matter in S� or not, is adjacent to at least one but not more than two vertices in S�. In this paper we introduce a linear algorithm for… (More)

- Ali Shakiba, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi
- I. J. Bifurcation and Chaos
- 2016

- Mohammad Reza Hooshmandasl, A. Karimi, M. Almbardar, Bijan Davvaz
- Int. J. Approx. Reasoning
- 2013

A mixed dominating set for a graph G = (V,E) is a set S ⊆ V ∪ E such that every element x ∈ (V ∪E)\S is either adjacent or incident to an element of S. The mixed domination number of a graphG, denoted by γm(G), is the minimum cardinality of mixed dominating sets ofG and any mixed dominating set with cardinality of γm(G) is called a minimum mixed dominating… (More)

- Ali Shakiba, Mohammad Reza Hooshmandasl, Bijan Davvaz, Seyed Abolfazl Shahzadeh Fazeli
- Journal of Intelligent and Fuzzy Systems
- 2016