Search Results (26)

This paper proposes a novel sparse twin parametric insensitive support vector regression (STPISVR) model, designed to enhance sparsity and improve generalization performance. Similar to twin parametric insensitive support vector regression (TPISVR), STPISVR constructs a pair of nonparallel parametric insensitive bound functions to indirectly determine the regression function. The optimization problems are reformulated as two sparse linear programming problems (LPPs), rather than traditional quadratic programming problems (QPPs). The two LPPs are originally derived from initial L1-norm regularization terms imposed on their respective dual variables, which are simplified to constants via the Karush–Kuhn–Tucker (KKT) conditions and consequently disappear. This simplification reduces model complexity, while the constraints constructed through the KKT conditions— particularly their geometric properties—effectively ensure sparsity. Moreover, a two-stage hybrid tuning strategy—combining grid search for coarse parameter space exploration and Bayesian optimization for fine-grained convergence—is proposed to precisely select the optimal parameters, reducing tuning time and improving accuracy compared to a singlemethod strategy. Experimental results on synthetic and benchmark datasets demonstrate that STPISVR significantly reduces the number of support vectors (SVs), thereby improving prediction speed and achieving a favorable trade-off among prediction accuracy, sparsity, and computational efficiency. Overall, STPISVR enhances generalization ability, promotes sparsity, and improves prediction efficiency, making it a competitive tool for regression tasks, especially in handling complex data structures. Full article

Hepatitis C virus (HCV) infection remains a significant global health burden, driven by the emergence of drug-resistant strains and the limited efficacy of current antiviral therapies. A promising strategy for therapeutic intervention involves targeting the NS3 protease, a viral enzyme essential for replication. In this study, we present the first computational model specifically designed to identify NS3 protease inhibitory peptides (NS3IPs). Using amino acid composition (AAC) and K-spaced amino acid pair composition (CKSAAP) features, we developed machine learning classifiers based on support vector machine (SVM) and random forest (RF), achieving accuracies of 98.85% and 97.83%, respectively, validated through 5-fold cross-validation and independent testing. To support the accessibility of the strategy, we implemented a web-based tool, iDNS3IP, which enables real-time prediction of NS3IPs. In addition, we performed feature space analyses using PCA, t-SNE, and LDA based on AAindex descriptors. The resulting visualizations showed a distinguishable clustering between NS3IPs and non-inhibitory peptides, suggesting that inhibitory activity may correlate with characteristic physicochemical patterns. This study provides a reliable and interpretable platform to assist in the discovery of therapeutic peptides and supports continued research into peptide-based antiviral strategies for drug-resistant HCV. To enhance its flexibility, the iDNS3IP web tool also incorporates a BLAST-based similarity search function, enabling users to evaluate inhibitory candidates from both predictive and homology-based perspectives. Full article

As a digital representation of buildings, building information models (BIMs) encapsulate geometric, semantic, and topological features (GSTFs), to express the visual and functional characteristics of building components and their connections to create building systems. However, searching for BIMs pays much attention to semantic features, while overlooking geometric and topological features, making it difficult to find and reuse rich knowledge in BIMs. Thus, this study proposes a novel approach to intelligent BIM searching by embedding GSTFs via deep learning (DL). First, algorithms for extracting GSTFs from BIMs and identifying required GSTFs from search queries are developed. Then, different GSTFs are embedded via DL models, creating vector-based representations of BIMs or search queries. Finally, similarity-based ranking is adopted to find BIMs highly related to the queries. Experiments show that the proposed approach demonstrates an efficiency of 780 times greater than manual retrieval methods and 4–6% more efficient than traditional methods. This study advances the field of BIM searching by providing a more comprehensive, accurate, and efficient method for finding and reusing rich knowledge in BIMs, ultimately contributing to better building design and knowledge management. Full article

This paper addresses the problem of IoT security caused by code cloning when developing a massive variety of different smart devices. A clone detection method is proposed to identify clone-caused vulnerabilities in IoT software. A hybrid solution combines syntactic and semantic analyses of the code. Based on the recovered code, an attributed abstract syntax tree is constructed for each code fragment. All nodes of the commonly used abstract syntax tree are proposed to be weighted with semantic attribute vectors. Each attributed tree is then encoded as a semantic vector using a Deep Graph Neural Network. Two graph networks are combined into a Siamese neural model, allowing training to generate semantic vectors and compare vector pairs within each training epoch. Semantic analysis is also applied to clones with low similarity metric values. This allows one to correct the similarity decision in the case of incorrect matching of functions at the syntactic level. To automate the search for clones, the BinDiff algorithm is added in the first stage to accurately select clone candidates. This has a positive impact on the ability to apply the proposed method to large sets of binary code. In an experimental study, the developed method—compared to BinDiff, Gemini, and Asteria tools—has demonstrated the highest efficiency. Full article

This paper presents the application of self-supervised deep contrastive learning in clustering signals detected in the wideband RF spectrum, presented in the form of spectrograms. Radio clustering is a method of searching for similar signals within the analyzed part of the radio spectrum. Typically, it is based on one or several specific parameters processed from the signal in a given channel. The authors propose a slightly different, innovative approach; thanks to the self-supervised learning of neural networks, there is no need to define specific parameters, and the feature vector, enabling comparison of Euclidean distances between signals, is generated by a deep neural network trained using a contrastive loss function on a dataset containing different radio modulations. The authors describe self-supervised solutions based on contrastive learning and the methods of signal segmentation and augmentation. The training process utilizes a custom database and the Resnet-50 network with a contrastive cost function. Radio clustering is used for autonomous spectrum analysis across wide frequency ranges and enables, among other things, the detection of tactical radio stations operating with widely dispersed frequency-hopping or a significant reduction in computational power required for real-time analysis of a large number of radio signals. Full article

Mycobacterium tuberculosis is the main causal agent of pulmonary tuberculosis (TB); the treatment of this disease is long and involves a mix of at least four different antibiotics that frequently lead to abandonment, favoring the surge of drug-resistant mycobacteria (MDR-TB), whose treatment becomes more aggressive, being longer and more toxic. Thus, the search for novel strategies for treatment that improves time or efficiency is of relevance. In this work, we used a murine model of pulmonary TB produced by the MDR-TB strain to test the efficiency of gene therapy with adenoviral vectors codifying TNF (AdTNF), a pro-inflammatory cytokine that has protective functions in TB by inducing apoptosis, granuloma formation and expression of other Th1-like cytokines. When compared to the control group that received an adenoviral vector that codifies for the green fluorescent protein (AdGFP), a single dose of AdTNF at the chronic active stage of the disease produced total survival, decreasing bacterial load and tissue damage (pneumonia), which correlated with an increase in cells expressing IFN-γ, iNOS and TNF in pneumonic areas and larger granulomas that efficiently contain and eliminate mycobacteria. Second-line antibiotic treatment against MDR-TB plus AdTNF gene therapy reduced bacterial load faster within a week of treatment compared to empty vector plus antibiotics or antibiotics alone, suggesting that AdTNF is a new potential type of treatment against MDR-TB that can shorten second-line chemotherapy but which requires further experimentation in other animal models (non-human primates) that develop a more similar disease to human pulmonary TB. Full article

In recent years, there has been rapid development in computer technology, leading to an increasing number of medical systems utilizing electronic medical records (EMRs) to store their clinical data. Because EMRs are very private, healthcare institutions usually encrypt these data before transferring them to cloud servers. A technique known as searchable encryption (SE) can be used by healthcare institutions to encrypt EMR data. This technique enables searching within the encrypted data without the need for decryption. However, most existing SE schemes only support keyword or range searches, which are highly inadequate for EMR data as they contain both textual and digital content. To address this issue, we have developed a novel searchable symmetric encryption scheme called SSE-RK, which is specifically designed to support both range and keyword searches, and it is easily applicable to EMR data. We accomplish this by creating a conversion technique that turns keywords and ranges into vectors. These vectors are then used to construct index tree building and search algorithms that enable simultaneous range and keyword searches. We encrypt the index tree using a secure K-Nearest Neighbor technique, which results in an effective SSE-RK approach with a search complexity that is quicker than a linear approach. Theoretical and experimental study further demonstrates that our proposed scheme surpasses previous similar schemes in terms of efficiency. Formal security analysis demonstrates that SSE-RK protects privacy for both data and queries during the search process. Consequently, it holds significant potential for a wide range of applications in EMR data. Overall, our SSE-RK scheme, which offers improved functionality and efficiency while protecting the privacy of EMR data, generally solves the shortcomings of the current SE schemes. Full article

In the analysis of rock slope stability and rock mass hydraulics, the dominant partitioning of discontinuities of rock masses is a very important concept, and it is still a key for establishing the three-dimensional (3-D) network model of random discontinuities. The traditional graphical analysis method is inadequate and greatly influenced by subjective experience. A new method using density-based spatial clustering of applications with noise (DBSCAN) algorithm is proposed for the dominant partitioning of discontinuities of rock mass. In the proposed method, we do not need to determine the centers of every cluster before clustering, and the acnodes or outliers can be eliminated effectively after clustering. Firstly, the spatial coordinate transformation of the discontinuity occurrence is carried out and the objective function is established by using the sine value of the angle of the unit normal vector as the similarity measure standard. The DBSCAN algorithm is used to establish the optimal clustering centers by searching the global optimal solution of the objective function, and the fuzzy C-means clustering algorithm is optimized and the mathematical model of the advantage grouping of rock discontinuities is established. The new method and the fuzzy C-means method are compared and verified by using the artificially randomly generated discontinuity occurrence data. The proposed method is a better method than the fuzzy C-means method in general cases, and it can provide more accurate results by eliminating the acnodes or outliers. Finally, the proposed method is applied to discontinuity orientation partition data at Maji dam site, Nujiang River, and there is good agreement with the in situ measurement. Full article

Recently, the Hypervolume Newton Method (HVN) has been proposed as a fast and precise indicator-based method for solving unconstrained bi-objective optimization problems with objective functions. The HVN is defined on the space of (vectorized) fixed cardinality sets of decision space vectors for a given multi-objective optimization problem (MOP) and seeks to maximize the hypervolume indicator adopting the Newton–Raphson method for deterministic numerical optimization. To extend its scope to non-convex optimization problems, the HVN method was hybridized with a multi-objective evolutionary algorithm (MOEA), which resulted in a competitive solver for continuous unconstrained bi-objective optimization problems. In this paper, we extend the HVN to constrained MOPs with in principle any number of objectives. Similar to the original variant, the first- and second-order derivatives of the involved functions have to be given either analytically or numerically. We demonstrate the applicability of the extended HVN on a set of challenging benchmark problems and show that the new method can be readily applied to solve equality constraints with high precision and to some extent also inequalities. We finally use HVN as a local search engine within an MOEA and show the benefit of this hybrid method on several benchmark problems. Full article

Third-party library (TPL) reuse may introduce vulnerable or malicious code and expose the software, which exposes them to potential risks. Thus, it is essential to identify third-party dependencies and take immediate corrective action to fix critical vulnerabilities when a damaged reusable component is found or reported. However, most of the existing methods only rely on syntactic features, which results in low recognition accuracy and significantly discounts the detection performance by obfuscation techniques. In addition, a few semantic-based approaches face the efficiency problem. To resolve these problems, we propose and implement a more precise and scalable TPL detection method BBDetector. In addition to syntactic features, we consider the rich function-level semantic features and form a feature vector for each function. Moreover, we design a scalable function vector similarity search method to identify anchor functions and the candidate libraries, based upon which we carry out TPL detection. The experiment results demonstrate that BBDetector outperforms B2SFinder and ModX in terms of effectiveness, efficiency, and obfuscation-resilient capability. For the nix binaries, the F1-score of BBDetector is 1.11% and 11.21% higher than that of ModX and B2SFinder, respectively. Moreover, for the Ubuntu binaries, the F1-score of BBDetector is 1.32% and 14.93% is higher than that of ModX and B2SFinder, respectively. And in terms of efficiency, the detection time of BBDetector is only 30.02% of ModX. Besides, for the obfuscation-resilient capability, BBDetector is much stronger than B2SFinder. BBDetector achieves a F1-score of 71%, slightly lower than the F1-score of 77% achieved with the non-obfuscated binary programs. However, B2SFinder only achieves an F1-score of 28%, much lower than that of 67% achieved with the non-obfuscated binary programs. Full article

The mRNA destabilizing factor tristetraprolin (TTP) functions as a tumor suppressor by down-regulating cancer-associated genes. TTP expression is significantly reduced in various cancers, which contributes to cancer processes. Enforced expression of TTP impairs tumorigenesis and abolishes maintenance of the malignant state, emphasizing the need to identify a TTP inducer in cancer cells. To search for novel candidate agents for inducing TTP in cancer cells, we screened a library containing 1019 natural compounds using MCF-7 breast cancer cells transfected with a reporter vector containing the TTP promoter upstream of the luciferase gene. We identified one molecule, of which the enantiomers are betamethasone 21-phosphate (BTM-21-P) and dexamethasone 21-phosphate (BTM-21-P), as a potent inducer of TTP in cancer cells. We confirmed that BTM-21-P, DXM-21-P, and dexamethasone (DXM) induced the expression of TTP in MDA-MB-231 cells in a glucocorticoid receptor (GR)-dependent manner. To identify potential pathways linking BTM-21-P and DXM-21-P to TTP induction, we performed an RNA sequencing-based transcriptome analysis of MDA-MB-231 cells at 3 h after treatment with these compounds. A heat map analysis of FPKM expression showed a similar expression pattern between cells treated with the two compounds. The KEGG pathway analysis results revealed that the upregulated DEGs were strongly associated with several pathways, including the Hippo signaling pathway, PI3K-Akt signaling pathway, FOXO signaling pathway, NF-κB signaling pathway, and p53 signaling pathway. Inhibition of the FOXO pathway using a FOXO1 inhibitor blocked the effects of BTM-21-P and DXM-21-P on the induction of TTP in MDA-MB-231 cells. We found that DXM enhanced the binding of FOXO1 to the TTP promoter in a GR-dependent manner. In conclusion, we identified a natural compound of which the enantiomers are DXM-21-P and BTM-21-P as a potent inducer of TTP in breast cancer cells. We also present new insights into the role of FOXO1 in the DXM-21-P- and BTM-21-P-induced expression of TTP in cancer cells. Full article

In recent years, searching and retrieving relevant images from large databases has become an emerging challenge for the researcher. Hashing methods that mapped raw data into a short binary code have attracted increasing attention from the researcher. Most existing hashing approaches map samples to a binary vector via a single linear projection, which restricts the flexibility of those methods and leads to optimization problems. We introduce a CNN-based hashing method that uses multiple nonlinear projections to produce additional short-bit binary code to tackle this issue. Further, an end-to-end hashing system is accomplished using a convolutional neural network. Also, we design a loss function that aims to maintain the similarity between images and minimize the quantization error by providing a uniform distribution of the hash bits to illustrate the proposed technique’s effectiveness and significance. Extensive experiments conducted on various datasets demonstrate the superiority of the proposed method in comparison with state-of-the-art deep hashing methods. Full article

The arithmetic optimization algorithm (AOA) is a new metaheuristic algorithm inspired by arithmetic operators (addition, subtraction, multiplication, and division) to solve arithmetic problems. The algorithm is characterized by simple principles, fewer parameter settings, and easy implementation, and has been widely used in many fields. However, similar to other meta-heuristic algorithms, AOA suffers from shortcomings, such as slow convergence speed and an easy ability to fall into local optimum. To address the shortcomings of AOA, an improved arithmetic optimization algorithm (IAOA) is proposed. First, dynamic inertia weights are used to improve the algorithm’s exploration and exploitation ability and speed up the algorithm’s convergence speed; second, dynamic mutation probability coefficients and the triangular mutation strategy are introduced to improve the algorithm’s ability to avoid local optimum. In order to verify the effectiveness and practicality of the algorithm in this paper, six benchmark test functions are selected for the optimization search test verification to verify the optimization search ability of IAOA; then, IAOA is used for the parameter optimization of support vector machines to verify the practical ability of IAOA. The experimental results show that IAOA has a strong global search capability, and the optimization-seeking capability is significantly improved, and it shows excellent performance in support vector machine parameter optimization. Full article

Orthoimage mosaicking with obvious parallax caused by geometric misalignment is a challenging problem in the field of remote sensing. Because the obvious objects are not included in the digital terrain model (DTM), large parallax exists in these objects. A common strategy is to search an optimal seamline between orthoimages, avoiding the majority of obvious objects. However, stitching artifacts may remain because (1) the seamline may still cross several obvious objects and (2) the orthoimages may not be precisely aligned in geometry when the accuracy of the DTM is low. While applying general image warping methods to orthoimages can improve the local geometric consistency of adjacent images, these methods usually significantly modify the geometric properties of orthophoto maps. To the best of our knowledge, no approach has been proposed in the field of remote sensing to solve the problem of local geometric misalignments after orthoimage mosaicking with obvious parallax. In this paper, we creatively propose a method to optimize local alignment along the seamline after seamline detection. It consists of the following main processes. First, we locate regions with geometric misalignments along the seamline based on the similarity measure. Second, for any one region, we find one-dimensional (1D) feature matches along the seamline using a semi-global matching approach. The deformation vectors are calculated for these matches. Third, these deformation vectors are robustly and smoothly propagated into the buffer region centered on the seamline by minimizing the associated energy function. Finally, we directly warp the orthoimages to eliminate the local parallax under the guidance of dense deformation vectors. The experimental results on several groups of orthoimages show that our proposed approach is capable of eliminating the local parallax existing in the seamline while preserving most geometric properties of digital orthophoto maps, and that it outperforms state-of-the-art approaches in terms of both visual quality and quantitative metrics. Full article

Cement-slag concrete has become one of the most widely used building materials considering its economical advantage and satisfying uniaxial compressive strength (UCS). In this study, an AI-based method for cement-slag concrete design was developed based on the balance of economic and mechanical properties. Firstly, the hyperparameters of random forest (RF), decision tree (DT), and support vector machine (SVM) were tuned by the beetle antennae search algorithm (BAS). The results of the model evaluation showed the RF with the best prediction effect on the UCS of concrete was selected as the objective function of UCS optimization. Afterward, the objective function of concrete cost optimization was established according to the linear relationship between concrete cost and each mixture. The obtained results showed that the weighted method can be used to construct the multi-objective optimization function of UCS and cost for cement-slag concrete, which is solved by the multi-objective beetle antennae search (MOBAS) algorithm. An optimal concrete mixture ratio can be obtained by Technique for Order Preference by Similarity to Ideal Solution. Considering the current global environment trend of “Net Carbon Zero”, the multi-objective optimization design should be proposed based on the objectives of economy-carbon emission-mechanical properties for future studies. Full article