检索结果-内蒙古大学图书馆

9th International Symposium on Dependable software Engineering: Theories, Tools and Applications, SETTA 2023

作者： Yan, Yixuan Su, Weihao Zheng, Lixiao Wang, Mengxi Chen, Haiming Peng, Chengyao Li, Rongchen Chen, Zixuan State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing101400 China College of Computer Science and Technology Huaqiao University Xiamen China

ISBN: (纸本)9789819986637

Real-world regular expressions (regexes for short) have a wide range of applications in software. However, the support for regexes in test generation is insufficient. For example, existing works lack support for some important features such as lookbehind, are not resilient to subtle semantic differences (such as partial/full matching), fall short of Unicode support, leading to loss of test coverage or missed bugs. To address these challenges, in this paper, we propose a novel semantic model for comprehensively modeling the extended features in regexes, with an awareness of different matching semantics (i.e. partial/full matching) and matching precedence (i.e. greedy/lazy matching). To the best of our knowledge, this is the first attempt to consider partial/full matching semantics in modeling and to support lookbehind. Leveraging this model we then develop PowerGen, a tool for deducing matching strings for regexes, which randomly generates matching strings from the input regex effectively. We evaluate PowerGen against nine related state-of-the-art tools. The evaluation results show the high effectiveness and efficiency of PowerGen. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： generation matching string modeling regex semantics

来源：评论

学校读者我要写书评

暂无评论

Executing Natural Language-Described Algorithms with Large Language Models: An Investigation 30

Executing Natural Language-Described Algorithms with Large L...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zheng, Xin Zhu, Qiming Lin, Hongyu Lu, Yaojie Han, Xianpei Sun, Le Chinese Information Processing Laboratory Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9782493814104

Executing computer programs described in natural language has long been a pursuit of computer science. With the advent of enhanced natural language understanding capabilities exhibited by large language models (LLMs), the path toward this goal has been illuminated. In this paper, we seek to examine the capacity of present-day LLMs to comprehend and execute algorithms outlined in natural language. We established an algorithm test set sourced from Introduction to Algorithm, a well-known textbook that contains many representative widely-used algorithms. To systematically assess LLMs' code execution abilities, we selected 30 algorithms, generated 300 random-sampled instances in total, and evaluated whether popular LLMs can understand and execute these algorithms. Our findings reveal that LLMs, notably GPT-4, can effectively execute programs described in natural language, as long as no heavy numeric computation is involved. We believe our findings contribute to evaluating LLMs' code execution abilities and would encourage further investigation and application for the computation power of LLMs. Our code and data are available at https://***/MrZhengXin/natural_language_program. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Can Graph Neural Networks Learn to Solve the MaxSAT Problem? 37

Can Graph Neural Networks Learn to Solve the MaxSAT Problem?

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Liu, Minghao Huang, Pei Jia, Fuqi Zhang, Fan Sun, Yuchen Cai, Shaowei Ma, Feifei Zhang, Jian State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China University of Chinese Academy of Sciences China Inspir.ai

ISBN: (纸本)9781577358800

The paper presents an attempt to bridge the gap between machine learning and symbolic reasoning. We build graph neural networks (GNNs) to predict the solution of the Maximum Satisfiability (MaxSAT) problem, an optimization variant of SAT. Two closely related graph representations are adopted, and we prove their theoretical equivalence. We also show that GNNs can achieve attractive performance to solve hard MaxSAT problems in certain distributions even compared with state-of-the-art solvers through experimental evaluation. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

SAT-based Formal Verification of Fault Injection Countermeasures for Cryptographic Circuits∗

IACR Transactions on Cryptographic Hardware and Embedded Sys...

引用

IACR Transactions on Cryptographic Hardware and Embedded Systems 2024年第4期2024卷 1-39页

作者： Tan, Huiyu Gao, Pengfei Song, Fu Chen, Taolue Wu, Zhilin ShanghaiTech University Shanghai201210 China Wingsemi Technology Co. Ltd. Shanghai201203 China Bytedance Beijing100098 China Key Laboratory of System Software Chinese Academy of Sciences and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing100190 China Nanjing Institute of Software Technology Nanjing211135 China Birkbeck University of London WC1E 7HX United Kingdom

Fault injection attacks represent a type of active, physical attack against cryptographic circuits. Various countermeasures have been proposed to thwart such attacks, however, the design and implementation of which are intricate, error-prone, and laborious. The current formal fault-resistance verification approaches are limited in efficiency and scalability. In this paper, we formalize the fault-resistance verification problem and show that it is coNP-complete. We then devise a novel approach for encoding the fault-resistance verification problem as the Boolean satisfiability (SAT) problem so that modern off-the-shelf SAT solvers can be utilized. The approach is implemented in an open-source tool FIRMER which is evaluated extensively on realistic cryptographic circuit benchmarks. The experimental results show that FIRMER is able to verify fault-resistance of almost all (72/76) benchmarks in 3 minutes (the other three are verified in 35 minutes and the hardest one is verified in 4 hours). In contrast, the prior approach fails on 31 fault-resistance verification tasks even after 24 hours (per task). © 2024, Ruhr-University of Bochum. All rights reserved.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

Adaptive Cost Aggregation in Iterative Depth Estimation for Efficient Multi-view Stereo 12th

Adaptive Cost Aggregation in Iterative Depth Estimation for...

引用

12th International Conference on Image and Graphics, ICIG 2023

作者： Wang, Xiang Bai, Xiao Wang, Chen School of Computer Science and Engineering State Key Laboratory of Software Development Environment Jiangxi Research Institute Beihang University Beijing China

ISBN: (纸本)9783031463075

The deep multi-view stereo (MVS) approaches generally construct 3D cost volumes to regularize and regress the depth map. These methods are limited with high-resolution outputs since the memory and time costs grow cubically as the volume resolution increases. In this paper, we presented an multi-stage iterative depth map estimation method for MVS. In our network, the cost volume is iteratively processed by lightweight 2D convolution based GRU modules, and the multi-stage coarse-to-fine structure is adopted to speed up the depth estimation process. To further improve the 3D reconstruction quality, we make improvements from two different perspectives of adaptive cost aggregation: a view-adaptive weighting module is proposed to account for the occlusion problem in cost volume fusion, and a spatial-adaptive deformable geometric feature encoding module is introduced to the cost volume feature encoding before feeding into GRUs for stronger modeling capability. Experiments on the DTU dataset demonstrated the effectiveness of the proposed network in accuracy with remarkable efficiency performance. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Investigating the Existence of Holey Latin Squares via Satisfiability Testing 20th

Investigating the Existence of Holey Latin Squares via Sa...

引用

20th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2023

作者： Liu, Minghao Han, Rui Jia, Fuqi Huang, Pei Ma, Feifei Zhang, Hantao Zhang, Jian State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China Stanford University StanfordCA United States Computer Science Department The University of Iowa Iowa CityIA52242 United States University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819970216

Holey Latin square (HLS) is a special combinatorial design of interest to mathematicians and is helpful in the construction of many important structures in design theory. In this paper, we investigate the existence of HLSs satisfying the seven kinds of identities with automated reasoning techniques. We formulate this problem as propositional logic formulae. Since state-of-the-art SAT solvers have difficulty solving many HLS problems, we further propose a symmetry breaking method, called partially ordered HLS (POHLS), to eliminate isomorphic solutions. We have achieved the following goals through experimental evaluation. First, we have solved a dozen of open problems interested by mathematicians. Second, we identify the impact of different encodings. Third, we demonstrate the advantages of SAT solver over other FOL-based solvers. Fourth, we show that the proposed POHLS reduction can improve the efficiency of solving and find the complementarity between two types of symmetry breaking techniques. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Hierarchical vectorization for facial images

引用

Computational Visual Media 2024年第1期10卷 97-118页

作者： Qian Fu Linlin Liu Fei Hou Ying He School of Computer Science and Engineering Nanyang Technological University639798SingaporeSingapore Data61 Commonwealth Scientific and Industrial Research OrganisationSydney2015Australia Interdisciplinary Graduate School Nanyang Technological University and Alibaba Group639798SingaporeSingapore State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing100190China University of Chinese Academy of Sciences Beijing100049China

The explosive growth of social media means portrait editing and retouching are in high *** portraits are commonly captured and stored as raster images,editing raster images is non-trivial and requires the user to be highly *** at developing intuitive and easy-to-use portrait editing tools,we propose a novel vectorization method that can automatically convert raster images into a 3-tier hierarchical *** base layer consists of a set of sparse diffusion curves(DCs)which characterize salient geometric features and low-frequency colors,providing a means for semantic color transfer and facial expression *** middle level encodes specular highlights and shadows as large,editable Poisson regions(PRs)and allows the user to directly adjust illumination by tuning the strength and changing the shapes of *** top level contains two types of pixel-sized PRs for high-frequency residuals and fine details such as pimples and *** train a deep generative model that can produce high-frequency residuals *** to the inherent meaning in vector primitives,editing portraits becomes easy and *** particular,our method supports color transfer,facial expression editing,highlight and shadow editing,and automatic *** quantitatively evaluate the results,we extend the commonly used FLIP metric(which measures color and feature differences between two images)to consider *** new metric,illumination-sensitive FLIP,can effectively capture salient changes in color transfer results,and is more consistent with human perception than FLIP and other quality measures for portrait *** evaluate our method on the FFHQR dataset and show it to be effective for common portrait editing tasks,such as retouching,light editing,color transfer,and expression editing.

关键词： face editing vectorization Poisson editing color transfer illumination editing expression editing

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua science and Technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

Enhancing Multi-modal Regular Expression Synthesis via Large Language Models and Semantic Manipulations of Sub-expressions 10th

Enhancing Multi-modal Regular Expression Synthesis via Larg...

引用

10th International Symposium on Dependable software Engineering: Theories, Tools and Applications, SETTA 2024

作者： Tang, Zipan Yan, Yixuan Li, Rongchen Dong, Hanze Chen, Haiming Gao, Hongyu Beijing University of Technology Beijing China and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819606016

Real-world regular expressions (regexes) are widely used in practice. Since regexes are difficult to comprehend and write, automatically synthesizing regexes has been an important research problem. However, current techniques face challenges like weak capability in generalization and severely limited support of extended features of regexes. In this paper, we address these challenges via Large Language Models (LLMs) together with semantic manipulations of sub-expressions, and propose PowerSyn, a framework for regex synthesis based on both natural language descriptions and examples and supports extended features. Specifically, we design the prompt suitable for synthesizing regexes with LLMs and present novel algorithms to manipulate sub-expressions, which consider the matching relation, and are guided by examples. The evaluation results demonstrate the significant efficacy of our approach. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Retrospection on the Performance Analysis Tools for Large-Scale HPC Programs 31

Retrospection on the Performance Analysis Tools for Large-Sc...

引用

31st Annual IEEE International Conference on High Performance Computing, Data, and Analytics, HiPC 2024

作者： Xuan, Zhibo You, Xin Yang, Hailong Li, Mingzhen Luan, Zhongzhi Liu, Yi Qian, Depei School of Computer Science and Engineering Beihang University China State Key Lab of Processors Institute of Computing Technology Chinese Academy China

ISBN: (纸本)9798331509095

As the performance gap between hardware and software widens, performance analysis tools are essential for understanding the behavior of large-scale High-Performance Computing (HPC) programs. These tools provide insights into the performance bottlenecks and help in optimizing the performance of the programs. In this paper, we present a comprehensive study of performance analysis tools for large-scale HPC systems including both sampling-based and instrumentation-based tools that are commonly adopted in the HPC community. We investigate the abundance and overheads of data collection as well as the analysis capabilities of HPCToolkit, TAU, and Scalasca with representative programs at scale. Our study shows that different performance analysis tools have distinct strengths and weaknesses, and the choice of a performance analysis tool depends on the specific requirements of the user. We also discuss the challenges and future directions in the field of performance analysis tools for large-scale HPC systems. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：