No abstract

Information is wealth of any organization and in present era in which information transferred through digital media and internet, it became a top priority for any organizations to protect this wealth. Whatever technique we adopt for the security purpose, the degree and level of security always remains top concern. Steganography is one such technique in which presence of secret message cannot be detected and we can use it as a tool for security purpose to transmit the cofidential information in a secure way. It is an ongoing research area having vast number of applications in distinct fields such as defense and intelligence, medical, on-line banking, on-line transaction, to stop music piracy and other financial and commercial purposes. There are various steganography approaches exist and they differs depending upon message to be embedded, use of file type as carrier or compression method used etc. The focus of this paper is to classify distinct image steganography techniques besides giving overview, importance and challenges of steganography techniques. Other related security techniques are also been discussed in brief in this paper. The classification of steganography techniques may provide not only understanding and guidelines to researchers in this field but also provide directions for future work in this field.

The antibandwidth maximization problem (AMP) consists of labeling the vertices of a n-vertex graph G with distinct integers from 1 to n such that the minimum difference of labels of adjacent vertices is maximized. This problem can be formulated as a dual problem to the well known bandwidth problem. Exact results have been proved for some standard graphs like paths, cycles, 2 and 3-dimensional meshes, tori, some special trees etc., however, no algorithm has been proposed for the general graphs. In this paper, we propose a memetic algorithm for the antibandwidth maximization problem, wherein we explore various breadth first search generated level structures of a graph-an imperative feature of our algorithm. We design a new heuristic which exploits these level structures to label the vertices of the graph. The algorithm is able to achieve the exact antibandwidth for the standard graphs as mentioned. Moreover, we conjecture the antibandwidth of some 3-dimensional meshes and complement of power graphs, supported by our experimental results.

A bstract Introduction A preferred treatment for cholelithiasis with choledocholithiasis is endoscopic retrograde cholangiopancreaticography (ERCP) followed by laparoscopic cholecystectomy (LC), which can be performed early (within 72 hours) or can be delayed for 6 to 8 weeks. This study is conducted to compare and analyze the outcome of early versus late LC following common bile duct (CBD) clearance by ERCP and determine the optimum timing for performing LC post-ERCP. Materials and methods This comparative analysis was conducted at St Joseph Hospital, Ghaziabad, from September 2019 to March 2021 on 89 cases of cholelithiasis with choledocholithiasis. Patients were divided into two groups. Group I ( n = 45) patients underwent early LC within 72 hours post-ERCP and group II ( n = 44) patients underwent late LC after an interval of 8 weeks. Various preoperative, perioperative, and postoperative clinical parameters like operative difficulty, complications, surgery duration, hospital stay, and conversion to open cholecystectomy were analyzed. Results There was no significant difference in demographic and laboratory findings in both groups. Group I patients had significantly shorter hospital stay and less operative difficulty. The duration of surgery was significantly low in group I. There was no significant difference in rate of conversion to open cholecystectomy. Conclusion Early LC post-ERCP is associated with short hospital stay and duration of surgery and less operative difficulty and complications. Therefore, we recommend that LC can be safely performed within 48 to 72 hours after ERCP. How to cite this article Goel A, Kothari S, Bansal R. Comparative Analysis of Early versus Late Laparoscopic Cholecystectomy Following Endoscopic Retrograde Cholangiopancreaticography in Cases of Cholelithiasis with Choledocholithiasis. Euroasian J Hepato-Gastroenterol 2021;11(1):11–13.

Abstract.With the massive growth in internet applications, there is a continuous need of efficient steganography techniques for the purpose of secret data communication and for the authentication and ownership identification of host data. This paper presents an efficient image hiding scheme using Particle Swarm Optimization (PSO) in the spatial domain of digital images. The proposed technique uses PSO to find the best pixel locations in an image where the secret image pixel data can be embedded. This PSO algorithm uses the Structural similarity Index (SSIM) as the objective function which is based on the simple visual effect of the human visual perception capability. As a result, the pixel positions generated by the proposed method, when used for embedding secret image data, result in minimum distortion of the host image. The results of the proposed technique have been analyzed qualitatively and quantitatively and also compared with some recent LSB techniques. The results show better stego image quality along with high embedding capacity.