Mining frequent sequences using itemset-based extension

In this paper, we systematically explore an itemset-based extension approach for generating candidate sequence which contributes to a better and more straightforward search space traversal performance than traditional item-based extension approach. Based on this candidate generation approach, we present FINDER, a novel algorithm for discovering the set of all frequent sequences. FINDER is composed oftwo separated steps. In the first step, all frequent itemsets are discovered and we can get great benefit from existing efficient itemset mining algorithms. In the second step, all frequent sequcnces with at least two frequent itemsets are detected by combining depth-first search and item set-based extension candidate generation together. A vertical bitmap data representation is adopted for rapidly support counting reason. Several pruning strategies are used to reduce the search space and minimize cost of computation. An extensive set ofexperiments demonstrate the effectiveness and the linear scalability of proposed algorithm

Ocular fundus manifestation of two patients following long-term chloroquine therapy: a case report

This report describes the typical manifestations of chloroquine retinopathy with some advanced new technology. A series of examinations were performed on the patients, including the fundus fluorescein angiography, optical coherence tomography, GDxVCC Nerve Fiber Analyzer, full-field electroretinography, multifocal electroretinography and visual field examinations, to provide a better understanding of chloroquine retinopathy

Daucosterol pretreatment ameliorates myocardial ischemia reperfusion injury via ROS-mediated NLRP3 inflammasome activation

Purpose: To determine the involvement of NLRP3 signaling pathway in the preventive role of daucosterol in acute myocardial infarction (AMI).Methods: H9C2 cells were pretreated with daucosterol before hypoxia/reoxygenation (HR) injury. Myocardial ischemia reperfusion (IR) was established in male SD rats, followed by reperfusion. Myocardial infarct size was measured. The serum levels of creatine kinase (CK), lactate  dehydrogenase (LDH), total superoxide dismutase (T-SOD), and malondialdehyde (MDA) were determined using commercial kits. NLRP3 inflammasome activation was assessed by western blotting.Results: Myocardial infarct size was smaller after IR injury in rats pretreated with daucosterol (10 and 50 mg/kg) than that pretreated with daucosterol (0 and 1 mg/kg). The increase in LDH, CK, and MDA levels after IR injury was reduced following daucosterol pretreatment. Reactive oxygen species (ROS) production increased, whereas T-SOD activity decreased after IR injury. These changes were prevented by pretreatment of daucosterol (10 and 50 mg/kg). Protein expression of NLRP3 inflammasome increased after IR injury in H9C2 cells while pretreatment with daucosterol inhibited the upregulation of NLRP3 inflammasome.Conclusion: The cardioprotective effect of daucosterol pretreatment appears to be mediated via the inactivation of ROS-related NLRP3 inflammasome, suggesting that daucosteol might be a potential therapeutic drug for AMI. Keywords: Daucosterol, Myocardial ischemia, Reperfusion injury, Reactive oxygen species, NLRP3 inflammasom

Structural reconstruction of the catalytic center of LiPDF through multiple scattering calculation with MXAN

Abstract Peptide deformylase (PDF, EC 3.5.1.27) is essential for the normal growth of eubacterium but not for mammalians. Recently, PDF has been studied as a target for new antibiotics. In this paper, X-ray absorption spectroscopy was employed to determine the local structure around the zinc ion of PDF from Leptospira Interrogans in dry powder, because it is very difficult to obtain the crystallized sample of Li PDF. We performed X-ray absorption near edge structure (XANES) calculation and reconstructed successfully the local geometry of the active center, and the results from calculations show that a water molecule (Wat1) has moved towards the zinc ion and lies in the distance range to coordinate with the zinc ion weakly. In addition, the sensitivity of theoretical spectra to the different ligand bodies was evaluated in terms of goodness-of-fit

A MAP Kinase Dependent Feedback Mechanism Controls Rho1 GTPase and Actin Distribution in Yeast

In the yeast Saccharomyces cerevisiae the guanosine triphosphatase (GTPase) Rho1 controls actin polarization and cell wall expansion. When cells are exposed to various environmental stresses that perturb the cell wall, Rho1 activates Pkc1, a mammalian Protein Kinase C homologue, and Mpk1, a mitogen activated protein kinase (MAPK), resulting in actin depolarization and cell wall remodeling. In this study, we demonstrate a novel feedback loop in this Rho1-mediated Pkc1-MAPK pathway that involves regulation of Rom2, the guanine nucleotide exchange factor of Rho1, by Mpk1, the end kinase of the pathway. This previously unrecognized Mpk1-depedent feedback is a critical step in regulating Rho1 function. Activation of this feedback mechanism is responsible for redistribution of Rom2 and cell wall synthesis activity from the bud to cell periphery under stress conditions. It is also required for terminating Rho1 activity toward the Pkc1-MAPK pathway and for repolarizing actin cytoskeleton and restoring growth after the stressed cells become adapted

Fast and Accurate: Efficient Full-Domain Functional Bootstrap and Digit Decomposition for Homomorphic Computation

The functional bootstrap in FHEW/TFHE allows for fast table lookups on ciphertexts and is a powerful tool for privacy-preserving computations. However, the functional bootstrap suffers from two limitations: the negacyclic constraint of the lookup table (LUT) and the limited ability to evaluate large-precision LUTs. To overcome the first limitation, several full-domain functional bootstraps (FDFB) have been developed, enabling the evaluation of arbitrary LUTs. Meanwhile, algorithms based on homomorphic digit decomposition have been proposed to address the second limitation. Although these algorithms provide effective solutions, they are yet to be optimized. This paper presents four new FDFB algorithms and two new homomorphic decomposition algorithms that improve the state-of-the-art. Our FDFB algorithms reduce the output noise, thus allowing for more efficient and compact parameter selection. Across all parameter settings, our algorithms reduce the runtime by up to $39.2\%$. Furthermore, our FDFB algorithms introduce an error that can be as small as 1/15 of that introduced by previous algorithms when evaluating continuous functions. Our homomorphic decomposition algorithms also run at 2.0x and 1.5x the speed of prior algorithms. We have implemented and benchmarked all previous FDFB and homomorphic decomposition algorithms and our methods in OpenFHE

Faster BGV Bootstrapping for Power-of-Two Cyclotomics through Homomorphic NTT

Power-of-two cyclotomics is a popular choice when instantiating the BGV scheme because of its efficiency and compliance with the FHE standard. However, in power-of-two cyclotomics, the linear transformations in BGV bootstrapping cannot be decomposed into sub-transformations for acceleration with existing techniques. Thus, they can be highly time-consuming when the number of slots is large, degrading the advantage brought by the SIMD property of the plaintext space. By exploiting the algebraic structure of power-of-two cyclotomics, this paper derives explicit decomposition of the linear transformations in BGV bootstrapping into NTT-like sub-transformations, which are highly efficient to compute homomorphically. Moreover, multiple optimizations are made to evaluate homomorphic linear transformations, including modified BSGS algorithms, trade-offs between level and time, and specific simplifications for thin and general bootstrapping. We implement our method on HElib. With the number of slots ranging from 4096 to 32768, we obtain a 7.35x$\sim$143x improvement in the running time of linear transformations and a 4.79x$\sim$66.4x improvement in bootstrapping throughput, compared to previous works or the naive approach