Indoleamine 2,3-dioxygenase (IDO) is emerging as an important new therapeutic drug target for the treatment of cancer characterized by pathological immune suppression. IDO catalyzes the rate-limiting step of tryptophan degradation along the kynurenine pathway. Reduction in local tryptophan concentration and the production of immunomodulatory tryptophan metabolites contribute to the immunosuppressive effects of IDO. Presence of IDO on dentritic cells in tumor-draining lymph nodes leading to the activation of T cells toward forming immunosuppressive microenvironment for the survival of tumor cells has confirmed the importance of IDO as a promising novel anticancer immunotherapy drug target. On the other hand, Withaferin A (WA) – active constituent of Withania Somnifera ayurvedic herb has shown to be having a wide range of targeted anticancer properties. In the present study conducted here is an attempt to explore the potential of WA in attenuating IDO for immunotherapeutic tumor arresting activity and to elucidate the underlying mode of action in a computational approach. Our docking and molecular dynamic simulation results predict high binding affinity of the ligand to the receptor with up to −11.51 kcal/mol of energy and 3.63 nM of IC50 value. Further, de novo molecular dynamic simulations predicted stable ligand interactions with critically important residues SER167; ARG231; LYS377, and heme moiety involved in IDO’s activity. Conclusively, our results strongly suggest WA as a valuable small ligand molecule with strong binding affinity toward IDO.
Intrusion Detection System (IDS) is one of the most important component of network defense mechanism. In an attempt to detect network attacks, network traffic features need to be identified and both attack and normal data need to be profiled. This paper proposes a set of network traffic features that can be extracted for Real-Time Intrusion Detection. This paper also proposes Fuzzy Entropy based heuristic for Ant Colony Optimization (ACO) in-order to search for global best smallest set of network traffic features for Real-Time Intrusion Detection Data set. The proposed feature reduction algorithm was tested on standard bench-mark UCI data sets, and found to be efficient. Further the algorithm was applied to Real-Time IDS data set and found to produce promising results
One of the most crucial tool for network defense is an Intrusion Detection Systems (IDS). Several supervised machine learning algorithms exist that deal with high volumes of training data. However, there is a need to design optimized, low cost semi-supervised IDS model that can perform well with little labelled data. The challenge is also to design adaptive learning algorithms that can update themselves with minimum computational overhead in case new training data is to be included. This work demonstrates a hybrid semi-supervised machine learning technique that uses Active learning Support Vector Machine (ASVM) and Fuzzy C-Means (FCM) clustering in the design of an efficient IDS. This algorithm is tested on NSL KDD bench mark IDS data set and found to be promising.
14 July 2016 in Human-centric Computing and Information Sciences
Achieving data privacy before publishing has been becoming an extreme concern of researchers, individuals and service providers. A novel methodology, Cooperative Privacy Game (CoPG), has been proposed to achieve data privacy in which Cooperative Game Theory is used to achieve the privacy and is named as Cooperative Privacy (CoP). The core idea ofCoPis to play the best strategy for a player to preserve his privacy by himself which in turn contributes to preserving other players privacy.CoPconsiders each tuple as a player and tuples form coalitions as described in the procedure. The main objective of theCoPis to obtain individuals (player) privacy as a goal that is rationally interested in other individuals’ (players) privacy.CoPis formally defined in terms of Nash equilibria, i.e., all the players are in their best coalition, to achievek-anonymity. The cooperative values of the each tuple are measured using the characteristic function of theCoPGto identify the coalitions. As the underlying game is convex; the algorithm is efficient and yields high quality coalition formation with respect to intensity and disperse. The efficiency of anonymization process is calculated using information loss metric. The variations of the information loss with the parameters $$\alpha$$ (weight factor of nearness) and $$\beta$$ (multiplicity) are analyzed and the obtained results are discussed.
18 April 2022 in Multimedia Tools and Applications