Home Latest Articles
Latest Articles
  • Husheng Guo, Yanjie Liu, Wenjian Wang
    Journal of Computer Research and Development. 2024, 61(6): 1497-1510.

    In the era of big data, more and more data are generated in the form of data streams, which makes concept drift an important but difficult problem in streaming data mining due to its fast, infinite, unstable and dynamically changing characteristics. Most of the current concept drift processing methods have limited information extraction capability and do not fully consider the temporal features of streaming data. To address these problems, a concept drift processing method of streaming data based on mixed feature extraction (MFECD) is proposed. The method first uses convolutional kernels of different scales to model the data to construct splicing features, and uses a gating mechanism to fuse shallow inputs and splicing features for adaptive integration as different network level inputs to obtain data features that can take into account both detailed and semantic information. Based on this, attention mechanism and similarity calculation are used to evaluate the importance of stream data at different moments in order to enhance the temporal features of key site of the data stream. The experimental results show that our method can effectively extract the complex data features and temporal features contained in the streaming data, and improve the processing capability of concept drift in the data stream.

  • Qihong Wang, Hongjie Jia, Longxia Huang, Qirong Mao
    Journal of Computer Research and Development. 2024, 61(6): 1511-1524.

    Given the excellent performance of contrastive learning on downstream tasks, contrastive clustering has received much more attention recently. However, most approaches only utilize a simple kind of data augmentation. Although augmented views keep the majority of information from original samples, they also inherit a mixture of characteristic of features, including semantic and non-semantic features, which limits model’s learning ability of semantic information under similar or identical view patterns. Even some approaches regard two different augmentation views being from the same sample and keeping similar view patterns as positive pairs, which results in sample pairs lacking of semantics. In this paper, we propose a semantic contrastive clustering method with federated data augmentation to solve these problems. Two different types of data augmentations, namely strong data augmentation and weak data augmentation, are introduced to produce two very different view patterns. These two view patterns are utilized to mitigate the disturbance of non-semantic information and improve the semantic awareness of the proposed approach. Moreover, a global k-nearest neighbor graph is used to bring global category information, which instructs the model to treat different samples from the same cluster as positive pairs. Extensive experiments on six commonly used and challenging image datasets show that the proposed method achieves the state-of-the-art performance and confirms the superiority and validity of it.

  • Jingyi Wang, Haibin Kan
    Journal of Computer Research and Development. 2024, 61(6): 1525-1535.

    With the rapid development of Internet technology, the emergence of mobile health (mHealth) is expected to improve the quality of medical care. However, data security and user privacy issues in the mHealth field have not been fully resolved. The access control protocol based on ciphertext-policy attribute-based encryption (CP-ABE) is a promising technique for the sharing of personal health records (PHRs). However, direct adoption of the traditional CP-ABE in mHealth causes many problems. Firstly, centralized attribute authority has low ability to resist risks. Secondly, the access policies are in cleartext and leak the patient’s privacy in the encrypted PHRs. Finally, it is difficult for the traditional CP-ABE scheme to track down the user who intentionally discloses the private key. Therefore, to solve these problems, we propose a fine-grained policy-hiding and traceable decentralized access control in mHealth. This scheme implements a decentralized attribute authority mechanism. Each attribute is expressed by an attribute name and an attribute value. In the encryption phase, the attribute value is hidden in ciphertext and only generic attribute name is exposed. When the private key is maliciously leaked, the regulator can use the identity mapping table to trace the malicious user. Through experimental simulation and comparative analysis, our scheme is suitable for the actual mHealth environment in terms of security and performance.

  • Wanli Lü, Yun Tang, Zhaoxia Yin, Bin Luo
    Journal of Computer Research and Development. 2024, 61(6): 1536-1544.

    Reversible data hiding in encrypted domain enables the secure and confidential embedding of additional information in encrypted multimedia, ensuring the privacy and integrity of both the carrier and the embedded data during transmission. The authorized recipients can extract the data without any loss and recover the media successfully. In the realm of digital media, 3D mesh models, being a relatively nascent form, possesses a distinctive file structure markedly different from that of conventional image media. Consequently, limited research has been conducted in this domain. Augmenting the embedding capacity of 3D mesh models in the encrypted domain poses an enduring challenge. The direct application of multiple most significant bit prediction algorithm from the image domain to 3D mesh models is impeded by disparities in data storage formats, thus encumbering the predictive performance of algorithms. To effectively tackle this issue, we propose the adoption of coordinate standardization to eliminate the influence of the sign bit and ameliorate the prediction algorithm’s overall performance. In order to further mitigate the inclusion of redundant auxiliary information, we introduce the integration of the selection of embedding set vertices into our experiments, which effectively generates additional payload space. The experimental results affirm that our purposed methodology attains the maximum embedding capacity while guaranteeing lossless and separable recovery of both the model and the embedded information, surpassing the capabilities of existing techniques.

  • Yicai Huang, Bin Yu
    Journal of Computer Research and Development. 2024, 61(6): 1545-1558.

    Searchable symmetric encryption (SSE) has been widely concerned because of its high search efficiency. Supporting conjunctive queries can effectively improve the usability of the scheme. However, most of the existing schemes with supporting conjunctive queries just work on static databases, which do not support dynamic updates of encrypted database, such as add or delete operation. Combined with the definition of symmetric hidden vectors encryption (SHVE), a new definition, called dynamic symmetric hidden vectors encryption (DSHVE), is proposed. On the basis of this definition, a DSHVE scheme supporting update operations is constructed. At the same time, by designing oblivious dynamic cross-tags and critical data access structures based on blinded exponentiations, a dynamic searchable symmetrical encryption scheme with supporting conjunctive queries is constructed. Then details about our proposal are introduced and a formal analysis of its security is presented. Theoretic analysis and experimental results show that, without significantly increasing the storage and computing costs, only documents identifications that match the query are revealed, which avoiding revealing more result patterns. In addition, by a single round of communication for conjunctive queries, the proposed scheme has lower communication overhead and higher search efficiency.

  • Yuxuan Lu, Lanju Kong, Baochen Zhang, Xinping Min
    Journal of Computer Research and Development. 2024, 61(6): 1559-1572.

    The existing blockchain presents a multi-chain trend. Traditional consensus algorithms do not have dynamic scalability for multi-chain, making it difficult to cope with the contradiction between open use and closed maintenance of large-scale permissioned blockchain. For this problem, a novel multi-chain consensus algorithm, MC-RHotStuff, is proposed: Nodes have different roles, including alternative nodes, candidate nodes, and consensus nodes. Each working chain has consensus nodes and alternative nodes. After the admission verification, the candidate node will become an alternative node; A consensus node has a reputation value that other nodes do not have, and a consensus node that performs the correct behavior will increase the reputation value, while a consensus node that performs the wrong behavior will deduct the reputation value, then the node with abnormal reputation value will be found through the node reputation calculation and filtering algorithm MC-Scan, and a new consensus node will be selected from the alternative nodes to exchange with the abnormal node. In addition, a dynamic node adjustment algorithm, MC-Schedule, is proposed to achieve optimization by detecting the transaction volume of each blockchain and dynamically adjusting the number of consensus nodes, which not only ensures the efficient execution of the blockchain system but also improves the speed of node filtering. MC-RHotStuff proposes a node state synchronization mechanism, MC-Syn, to ensure that the consensus operates normally when the node number change or the consensus group change. Compared with existing systems, transaction throughput and latency have been comprehensively improved by about 15%.

  • Sibo Xia, Minghua Ma, Pengxiang Jin, Liyue Cui, Shenglin Zhang, Wa Jin, Yongqian Sun, Dan Pei
    Journal of Computer Research and Development. 2024, 61(6): 1573-1584.

    The timely response of network services is crucial to improving user experience. Taking search engine as a typical example of network services, service providers need to ensure that the search response time is within one second. In practice, the search response time can be affected by many service attributes, such as user browsers, ISPs, and page loading methods. To optimize effectively, service providers need to identify the rules that cause high search response time, which are combinations of the above attributes. However, existing work encounters three challenges. First, the amount of search logs is large. Second, the search logs are unevenly distributed. Third, the rules with high generality are needed. Therefore, we propose a framework called Miner (multi-dimensional extraction of rules). Miner takes advantage of self-paced sampling to overcome the first and second challenges. To address the third challenge, Miner employs Corels to generate rules with high generality and recall. Our experiments use search logs provided from two top-tier search engine companies in China. The results show that Miner outperforms the state-of-the-art methods in terms of generality and recall. Operators adopt rules generated by Miner and optimize the performance of the search engine.

  • Meng Xu, Sihan Wang, Renzhong Guo, Xiuping Jia, Sen Jia
    Journal of Computer Research and Development. 2024, 61(6): 1585-1607.

    Remote sensing images are the data resource that can acquire information about the ocean, atmosphere, and the earth’s surface, and have been widely applied in many fields, such as agriculture, military, and urban planning. However, clouds and hazes are inevitable factors when collecting images from satellites, resulting in the loss of information and causing a huge waste of data resources in practical applications. Therefore, how to detect and remove clouds from remote sensing images is a challenging and difficult task that draws a lot of experts’ attention. We comprehensively review current research progress and summarize the challenges of cloud detection and removal in remote sensing images. Cloud detection methods are divided into two categories based on whether using deep learning technology, and cloud removal methods are divided into three categories based on whether auxiliary images are used. Then, according to the characteristics of different methods, these methods are reviewed and analyzed systematically, including their advantages and disadvantages, respectively. Afterward, four cloud detection, four thin cloud removal and four thick cloud removal methods are evaluated on two remote sensing datasets. Finally, we discuss future challenges and predict future research directions. This review paper can provide valuable advice to scientists who are involved in remote sensing image processing.

  • Huimin Chen, Zhiyuan Liu, Maosong Sun
    Journal of Computer Research and Development. 2024, 61(5): 1094-1103.

    Large language models such as ChatGPT have recently gained widespread attention in society due to their high level of generality and intelligence. This technological advancement has sparked not only a technological revolution, but also a social revolution. Against this backdrop, exploring the evolution and characteristics of large language models based on the underlying technology of ChatGPT, as well as their potential opportunities and challenges for society, has become a crucial topic in contemporary times. We first review the technological development of large language models, then summarize the revolution into three stages and discuss their key technical features, respectively. Subsequently, from the perspective of the interaction between technology and society, we explore the social opportunities brought about by large language models: serving as a personal universal information assistant, turning into a new paradigm of scientific research, contributing to industrial infrastructure, and becoming a powerful tool for modernizing national governance capabilities. What’s more, we address potential challenges that arise from large language models. These include issues of information pollution, distribution of social power, ethical and legal concerns, and ideological security. Finally, we conclude with reflections and discussions on the future development of large language models and their relationship with societal progress.

  • Xiaochen Wang, Kun Zhang, Peng Zhang
    Journal of Computer Research and Development. 2024, 61(5): 1104-1112.

    With the widespread application of big models in the field of artificial intelligence, the security issues of large models, especially large language models, have received attention. As an emerging technology, the security situation analysis of large models and the construction of security systems need further exploration. We analyze the overall trend of large model security from two perspectives: society and technology application. Based on the characteristics of large models, we sort out the practice of large model security building, and provide a reference plan for building a security system for large model development and large model application construction. The large model security practice plan introduced in this article includes three parts: security benchmark construction, model values alignment method, and model online service security system construction.