We introduce the concepts of Relevancematrix(RM) and Relevance-set(RS). And we construct the association between RM and the knowledge compilation(KC) methods based on Extension rule(ER). Based on the basic parameters ...
详细信息
We introduce the concepts of Relevancematrix(RM) and Relevance-set(RS). And we construct the association between RM and the knowledge compilation(KC) methods based on Extension rule(ER). Based on the basic parameters of RS and the relationship between RM and the KC methods based on ER, we design two efficient heuristics, called M2S(maximum sum of elements in RS and sum of literals in RS) and MNE(minimum number of maximum terms not extended by RS). Both of above heuristics intend to find the minimum set of maximum terms which cannot be extended by RS. Furthermore,we apply M2S and MNE on KCER. M2S KCER(KCER with M2S) and MNE KCER(KCER with MNE) are designed and implemented based on M2S and MNE, respectively. Experimentally, for the SAT instances with random lengths of clauses, M2S KCER and MNE KCER can improve the efficiency and quality of KCER sharply, and they are two best KC algorithms of EPCCL(each pair contains complementary literal) theory in all KC algorithms based on KCER.
The low-altitude economy (LAE), driven by unmanned aerial vehicles (UAVs) and other aircraft, has revolutionized fields such as transportation, agriculture, and environmental monitoring. In the upcoming six-generation...
详细信息
We introduce the concept of Complementary formula(COMF), which is a new and non-equivalent way for knowledge compilation(KC). Based on the Hyper extension rule(HER) which is an expansion of Extension rule(ER), we desi...
详细信息
We introduce the concept of Complementary formula(COMF), which is a new and non-equivalent way for knowledge compilation(KC). Based on the Hyper extension rule(HER) which is an expansion of Extension rule(ER), we design a compilation algorithm which can formula compile each Conjunctive normal form(CNF)formula to complementary Fully complementary connected diagram(c-FCCD), named as C2C(CNF formula to cFCCD). Theoretically, c-FCCD is a kind of complementary formulae of the input formulae and can support all queries and partial transformations in KC map. Experimentally,C2C is competitive with the EPCCL compilers KCER,C2E, UKCHER, DKCHER and IKCHER.
To detect copy-paste tampering,an improved SIFT(Scale invariant feature transform)-based algorithm was *** angle is defined and a maximum angle-based marked graph is *** marked graph feature vector is provided to each...
详细信息
To detect copy-paste tampering,an improved SIFT(Scale invariant feature transform)-based algorithm was *** angle is defined and a maximum angle-based marked graph is *** marked graph feature vector is provided to each SIFT key point via discrete polar coordinate *** points are matched to detect the copy-paste tampering *** experimental results show that the proposed algorithm can effectively identify and detect the rotated or scaled copy-paste regions,and in comparison with the methods reported previously,it is resistant to postprocessing,such as blurring,Gaussian white noise and JPEG *** proposed algorithm performs better than the existing algorithm to dealing with scaling transformation.
Introduction: Activity cliff (AC) is a phenomenon that a pair of similar molecules differ by a small structural alternation but exhibit a large difference in their biochemical activities. This phenomenon affects vario...
详细信息
Introduction: Activity cliff (AC) is a phenomenon that a pair of similar molecules differ by a small structural alternation but exhibit a large difference in their biochemical activities. This phenomenon affects various tasks ranging from virtual screening to lead optimization in drug development. The AC of small molecules has been extensively investigated but limited knowledge is accumulated about the AC phenomenon in pharmaceutical peptides with canonical amino acids. Objectives: This study introduces a quantitative definition and benchmarking framework AMPCliff for the AC phenomenon in antimicrobial peptides (AMPs) composed by canonical amino acids. Methods: This study establishes a benchmark dataset of paired AMPs in Staphylococcus aureus from the publicly available AMP dataset GRAMPA, and conducts a rigorous procedure to evaluate various AMP AC prediction models, including nine machine learning, four deep learning algorithms, four masked language models, and four generative language models. Results: A comprehensive analysis of the existing AMP dataset reveals a significant prevalence of AC within AMPs. AMPCliff quantifies the activities of AMPs by the metric minimum inhibitory concentration (MIC), and defines 0.9 as the minimum threshold for the normalized BLOSUM62 similarity score between a pair of aligned peptides with at least two-fold MIC changes. Our analysis reveals that these models are capable of detecting AMP AC events and the pre-trained protein language model ESM2 demonstrates superior performance across the evaluations. The predictive performance of AMP activity cliffs remains to be further improved, considering that ESM2 with 33 layers only achieves the Spearman correlation coefficient 0.4669 for the regression task of the −log(MIC) values on the benchmark dataset. Conclusion: Our findings highlight limitations in current deep learning-based representation models. To more accurately capture the properties of antimicrobial peptides (AMPs), it is ess
Fault diagnosis of discrete-event system(DES) is important in the preventing of harmful events in the system. In an ideal situation, the system to be diagnosed is assumed to be complete; however, this assumption is ra...
详细信息
Fault diagnosis of discrete-event system(DES) is important in the preventing of harmful events in the system. In an ideal situation, the system to be diagnosed is assumed to be complete; however, this assumption is rather restrictive. In this paper, a novel approach, which uses rough set theory as a knowledge extraction tool to deal with diagnosis problems of an incomplete model, is investigated. DESs are presented as information tables and decision tables. Based on the incomplete model and observations, an algorithm called Optimizing Incomplete Model is proposed in this paper in order to obtain the repaired model. Furthermore, a necessary and sufficient condition for a system to be diagnosable is given. In ensuring the diagnosability of a system, we also propose an algorithm to minimize the observable events and reduce the cost of sensor selection.
In this paper,the authors first apply the Fitzpatrick algorithm to multivariate vectorvalued osculatory rational *** based on the Fitzpatrick algorithm and the properties of an Hermite interpolation basis,the authors ...
详细信息
In this paper,the authors first apply the Fitzpatrick algorithm to multivariate vectorvalued osculatory rational *** based on the Fitzpatrick algorithm and the properties of an Hermite interpolation basis,the authors present a Fitzpatrick-Neville-type algorithm for multivariate vector-valued osculatory rational *** may be used to compute the values of multivariate vector-valued osculatory rational interpolants at some points directly without computing the interpolation function explicitly.
Under the framework of LPU (learning from positive data and unlabeled data), this paper originally proposes a three-step algorithm. First, Co-Training is employed for filtering out the "suspect positive" dat...
详细信息
This paper deals with a novel local arc length estimator for curves in gray-scale *** method first estimates a cubic spline curve fit for the boundary points using the gray-level information of the nearby pixels,and t...
详细信息
This paper deals with a novel local arc length estimator for curves in gray-scale *** method first estimates a cubic spline curve fit for the boundary points using the gray-level information of the nearby pixels,and then computes the sum of the spline segments’*** this model,the second derivatives and y coordinates at the knots are required in the computation;the spline polynomial coefficients need not be computed *** provide the algorithm pseudo code for estimation and preprocessing,both taking linear *** shows that the proposed model gains a smaller relative error than other state-of-the-art methods.
Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman c...
详细信息
Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.
暂无评论