Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Judgment document summarization method combining large language model and dynamic prompts
Binbin ZHANG, Yongbin QIN, Ruizhang HUANG, Yanping CHEN
Journal of Computer Applications    2025, 45 (9): 2783-2789.   DOI: 10.11772/j.issn.1001-9081.2024091393
Abstract48)   HTML0)    PDF (1239KB)(253)       Save

In view of the problems of complex case structure, redundant facts involved in cases, and wide distribution of cases in judgment documents, the existing Large Language Models (LLMs) are difficult to focus on structural information effectively and may generate factual errors, resulting in missing structural information and factual inconsistency. To this end, a judgment document summary method combining LLMs and dynamic prompts, named DPCM (Dynamic Prompt Correction Method), was proposed. Firstly, LLMs were used for single-sample learning to generate a judgment document summary. Secondly, high-dimensional similarity between the original text and the summary was calculated to detect possible missing structure or factual inconsistency problems in the summary. If a problem was found, the wrong summary was spliced with the original text, and the prompt words were added. Then, one-shot learning was performed again to correct and generate a new summary, and a similarity test was performed again. If the problem still existed, the generation and detection process would be repeated. Finally, through this iterative method, the prompt words were adjusted dynamically to optimize the generated summary gradually. Experimental results on the CAIL2020 public justice summary dataset show that compared with Least-To-Most Prompting, Zero-Shot Reasoners, Self_Consistency_Cot and other methods, the proposed method has improvements in Rouge-1, Rouge-2, Rouge-L, BERTscore, FactCC (Factual Consistency) indicators.

Table and Figures | Reference | Related Articles | Metrics
Mixed key management scheme based on domain for wireless sensor network
WANG Binbin ZHANG Yanyan ZHANG Xuelin
Journal of Computer Applications    2014, 34 (1): 90-94.   DOI: 10.11772/j.issn.1001-9081.2014.01.0090
Abstract594)      PDF (768KB)(533)       Save
Concerning the existing problems in the current key management strategies, lower connectivity, higher storage consumption and communication cost, this paper proposed a mixed key management scheme based on domain for Wireless Sensor Network (WSN). The scheme divided the deployment area into a number of square areas, which consisted of member nodes and head nodes. According to their pre-distribution key space information, any pair of nodes in the same area could find a session key, but the nodes in different areas could only communicate with each other through head nodes. The eigenvalues and eigenvectors of the multiple asymmetric quadratic form polynomials were computed, and then the orthogonal diagonalization information was got, by which the head nodes could achieve identification and generate the session key between its neighbor nodes. The analysis of performance shows that compared with the existing key management schemes, this scheme has full connectivity and a bigger improvement in terms of communication overhead, storage consumption and safety.
Related Articles | Metrics