Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, the authors examine the relationship between RPTs and audit risk in India, based on a sample of 1,182 firms covering a period from 31 March 2011 to 31 March 2018.
Abstract: Related Party Transactions (RPTs) are perceived as genuine transactions, which fulfill the economic needs of a company. However, the controlling shareholders may use RPTs as a tool for transferring the firm’s resources for their private benefit. The dual effect of RPTs, i.e., transaction efficiency and conflict of interest between the controlling shareholders and minority shareholders, increase audit risk and as a result, increases the audit fee. The Companies Act, 2013, and Clause 49 of
the SEBI listing agreement mandate arm’s length principle of pricing of RPTs. However, there are situations in which the regulations are silent about the method of pricing, and this increases the risk of auditors for auditing RPTs. This study intends to examine the relationship between RPTs and audit risk in India, based on a sample of 1,182 firms covering a period from 31 March 2011 to 31 March 2018. Panel data methodology has been applied for empirical analysis and the results show that higher audit fee is an indication of resource transferring RPTs. The results prove that instead of reducing the complexity associated with RPTs, the new RPTs regulations increase audit fee as a result of the increases in audit risk.
6 citations
••
6 citations
••
01 Dec 2017TL;DR: This study design and experiment a parallel k-means algorithm using MapReduce programming model and compared the result with sequential k-Means for clustering varying size of document dataset and demonstrates that proposed k- means obtains higher performance and outperformed sequential k -means while clustering documents.
Abstract: One of the significant data mining techniques is clustering. Due to digitalization and globalization of each work space, large datasets are being generated rapidly. Such large dataset clustering is a challenge for traditional sequential clustering algorithms as it requires large execution time to cluster such datasets. Distributed parallel architectures and algorithms are thus helpful to achieve performance and scalability requirement of clustering large datasets. In this study, we design and experiment a parallel k-means algorithm using MapReduce programming model and compared the result with sequential k-means for clustering varying size of document dataset. The result demonstrates that proposed k-means obtains higher performance and outperformed sequential k-means while clustering documents.
6 citations
••
TL;DR: The geometrical parameters for the title compound, C16H13ClO2, are normal as discussed by the authors, and packing in a non-centrosymmetric space group, which is consistent with the non-zero second harmonic generation response, may be influenced by a C-H⋯O inter-action.
Abstract: The geometrical parameters for the title compound, C16H13ClO2, are normal. Packing in a non-centrosymmetric space group, which is consistent with the non-zero second harmonic generation response, may be influenced by a C—H⋯O interaction.
6 citations
Authors
Showing all 298 results
Name | H-index | Papers | Citations |
---|---|---|---|
Shafiqur Rehman | 46 | 212 | 9437 |
Asif Afzal | 23 | 156 | 1653 |
Balladka Kunhanna Sarojini | 22 | 291 | 2659 |
Mohammad Asif Hussain | 18 | 45 | 1665 |
Sher Afghan Khan | 18 | 248 | 1782 |
M.K. Ramis | 13 | 33 | 443 |
Perveiz Khalid | 13 | 63 | 492 |
M. Anaul Kabir | 12 | 20 | 477 |
Zahid Ansari | 10 | 33 | 404 |
P. R. Thyla | 10 | 44 | 293 |
Mohammad Fazle Azeem | 10 | 44 | 421 |
S. Pradeep | 9 | 19 | 893 |
D. Senthilkumar | 9 | 17 | 336 |
J. Mohan | 9 | 12 | 373 |
A. D. Mohammed Samee | 9 | 12 | 254 |