Binary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin

      Strong and ∆-convergence for a two-step iteration process utilizing asymptotically nonexpansive and total asymptotically nonexpansive noneslf mappings in the CAT(0) spaces have been studied. As well, several strong convergence theorems under semi-compact and condition (M) have been proved. Our results improve and extend numerous familiar results from the existing literature.

The growing interest in the use of chaotic techniques for enabling secure communication in recent years has been motivated by the emergence of a number of wireless services which require the service provider to provide low bit error rates (BER) along with information security. This paper investigates the feasibility of using chaotic communications over Multiple-Input-Multiple-Output (MIMO) channels. While the use of Chaotic maps can enhance security, it is seen that the overall BER performance gets degraded when compared to conventional communication schemes. In order to overcome this limitation, we have proposed the use of a combination of Chaotic modulation and Alamouti Space Time Block Code. The performance of Chaos Shift Keying (CSK) wi

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.