Papers by Dheeresh Mallick
Computer Science & Information Technology ( CS & IT ), 2013
Theoretical analysis of algorithms involves counting of operations and a separate bound is provid... more Theoretical analysis of algorithms involves counting of operations and a separate bound is provided for a specific operation type. Such a methodology is plagued with its inherent limitations. In this paper we argue as to why we should prefer weight based statistical bounds, which permit mixing of operations, instead as a robust approach. Empirical analysis is an important idea and should be used to supplement and compliment its existing theoretical counterpart as empirically we can work on weights (e.g. time of an operation can be taken as its weight). Not surprisingly, it should not only be taken as an opportunity so as to amend the mistakes already committed knowingly or unknowingly but also to tell a new story.
Recent innovation in the field of Very Large Scale Integration has resulted into fabrication of h... more Recent innovation in the field of Very Large Scale Integration has resulted into fabrication of high speed processors. The sequential computers, equipped with such high speed processors, are unable to meet the challenges of various real-life and real- time computational problems in the areas of image processing, climate modeling, remote sensing, medical science etc., that require to process massive volume of data. Parallel processing is one of the most appropriate technologies that can meet the challenges of such application areas. A variety of numeric and non-numeric problems are often required to be solved in the above mentioned areas. Prefix computation, polynomial root finding, matrix-matrix multiplication, conflict graph construction are some of the very important computations, which are frequently used for solving such problems. In this thesis, we mainly focus on the design of parallel algorithms for such computations to map them efficiently on suitable interconnection network...
In this paper we present an adaptable fast matrix multiplication (AFMM) algorithm, for two nxn de... more In this paper we present an adaptable fast matrix multiplication (AFMM) algorithm, for two nxn dense matrices which computes the product matrix with average complexity Tavg(n) = d1d2n3 with the acknowledgement that the average count is obtained for addition as the basic operation rather than multiplication which is probably the unquestionable choice for basic operation in existing matrix multiplication algorithms.
... 130-135, 1997. [9] CF Wang and S. Sahni, “Basic operations on the OTIS-Mesh optoelectronic co... more ... 130-135, 1997. [9] CF Wang and S. Sahni, “Basic operations on the OTIS-Mesh optoelectronic computer,” IEEE Trans. On Parallel and Distributed Systems Vol. ... 831 - 839 Oct. 1980. [14] DACarlson and B. Sugla, “Limited width parallel prefix circuits,” J. Supercomput.,Vol.4, pp. ...
International Journal of Automation and Smart Technology
In wireless sensor networks (WSN), clustering has been shown to effectively prolong network lifet... more In wireless sensor networks (WSN), clustering has been shown to effectively prolong network lifetime, and unequal clustering, which is an extension to traditional clustering, has demonstrated even better results. In unequal clustering, each individual cluster has a different cluster range. To date, clustering range calculations has been performed based on node positions in the network. However, node fitness is an important parameter. If assigned a larger cluster range, nodes with low fitness can create inconsistencies within the network. Moreover, these methods fail to incorporate uncertainties in parametric quantities encountered during cluster head (CH) selection and cluster range assignment. Therefore, we propose a fuzzy logic based chance calculation that handles uncertainties in parametric quantities. The calculated chance value is applied for the selection of CHs and the chance value, is used along with node position to assign a proper cluster range. Compared with some well known approaches shows that the proposed approach creates more balanced clusters, consequently extending network lifetime.
Nano Communication Networks
Nonlinear Engineering
Internet of Things (IoT) opens up the possibility of agglomerations of different types of devices... more Internet of Things (IoT) opens up the possibility of agglomerations of different types of devices, Internet and human elements to provide extreme interconnectivity among them towards achieving a completely connected world of things. The mainstream adaptation of IoT technology and its widespread use has also opened up a whole new platform for cyber perpetrators mostly used for distributed denial of service (DDoS) attacks. In this paper, under the influence of internal and external nodes, a two - fold epidemic model is developed where attack on IoT devices is first achieved and then IoT based distributed attack of malicious objects on targeted resources in a network has been established. This model is mainly based on Mirai botnet made of IoT devices which came into the limelight with three major DDoS attacks in 2016. The model is analyzed at equilibrium points to find the conditions for their local and global stability. Impact of external nodes on the over-all model is critically anal...
Wireless Personal Communications
Journal of ICT Research and Applications
In wireless sensor networks, clustering provides an effective way of organising the sensor nodes ... more In wireless sensor networks, clustering provides an effective way of organising the sensor nodes to achieve load balancing and increasing the lifetime of the network. Unequal clustering is an extension of common clustering that exhibits even better load balancing. Most existing approaches do not consider node density when clustering, which can pose significant problems. In this paper, a fuzzy-logic based cluster head selection approach is proposed, which considers the residual energy, centrality and density of the nodes. In addition, a fuzzy-logic based clustering range assignment approach is used, which considers the suitability and the position of the nodes in assigning the clustering range. Furthermore, a weight function is used to optimize the selection of the relay nodes. The proposed approach was compared with a number of well known approaches by simulation. The results showed that the proposed approach performs better than the other algorithms in terms of lifetime and other metrics.
2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT), 2016
International Journal of Advanced Science and Technology, 2016
Advances in Intelligent Systems and Computing, 2016
Microsystem Technologies, 2017
International Journal of Computational Complexity and Intelligent Algorithms, 2019
2015 1st International Conference on Next Generation Computing Technologies (NGCT), 2015
The present paper gives a statistical adventure towards exploring the average case complexity beh... more The present paper gives a statistical adventure towards exploring the average case complexity behavior of computer algorithms. Rather than following the traditional count based analytical (pen and paper) approach, we instead talk in terms of the weight based analysis that permits mixing of distinct operations into a conceptual bound called the statistical bound and its empirical estimate, the so called "empirical O". Based on careful analysis of the results obtained, we have introduced two new conjectures in the domain of algorithmic analysis. The analytical way of average case analysis falls flat when it comes to a data model for which the expectation does not exist (e.g. Cauchy distribution for continuous input data and certain discrete distribution inputs as those studied in the paper). The empirical side of our approach, with a thrust in computer experiments and applied statistics in its paradigm, lends a helping hand by complimenting and supplementing its theoretical counterpart. Computer science is or at least has aspects of an experimental science as well, and hence hopefully, our statistical findings will be equally recognized among theoretical scientists as well.
In this paper we present an adaptable fast matrix multiplication (AFMM) algorithm, for two nxn de... more In this paper we present an adaptable fast matrix multiplication (AFMM) algorithm, for two nxn dense matrices which computes the product matrix with average complexity Tavg(n) = d1d2n3 with the acknowledgement that the average count is obtained for addition as the basic operation rather than multiplication which is probably the unquestionable choice for basic operation in existing matrix multiplication algorithms.
Uploads
Papers by Dheeresh Mallick