An excellent reputation earned by initiating and practicing sustainable business practices has additional benefits, of which are reducing environmental incidents and an improvement in operational efficiency as this has the potential to help firms improve on productivity and bring down operating costs. Taken further, with ever-increasing socially and environmentally-conscious investors and the public alike, this act of natural resources management could have a significant implication on market value and income of the practicing firms.

The above proposition has been supported by sustainable business practices literature that is continuously conversing and deliberating upon the impact of efficient resource d

Often there is no well drilling without problems. The solution lies in managing and evaluating these problems and developing strategies to manage and scale them. Non-productive time (NPT) is one of the main causes of delayed drilling operations. Many events or possibilities can lead to a halt in drilling operations or a marginal decrease in the advancement of drilling, this is called (NPT). Reducing NPT has an important impact on the total expenditure, time and cost are considered one of the most important success factors in the oil industry. In other words, steps must be taken to investigate and eliminate loss of time, that is, unproductive time in the drilling rig in order to save time and cost and reduce wasted time. The data of

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed