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

Nafas: Breathing Gymnastics Application

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sabouri, Sadra Haghighi, Sepand University of Southern California United States United States

Long sessions of computer use introduce physical and mental health risks, particularly for programmers and intensive computer users. Breathing exercises can improve focus, reduce stress, and overall well-being. However, existing tools for such practices are often app-based, requiring users to leave their workspace. In this technical report, we introduce Nafas, a command-line interface (CLI) application designed specifically for computer users, enabling them to perform breathing exercises directly within the terminal. Nafas offers structured breathing programs with various levels tailored to the needs of busy developers and other intensive computer users. © 2024, CC BY.

关键词： structured programming

Programs Versus Finite Tree-Programs

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Moshkov, Mikhail Thuwal23955-6900 Saudi Arabia

In this paper, we study classes of structures and individual structures for which programs implementing functions defined everywhere are equivalent to finite tree-programs. The programs under consideration may have cycles and at most countably many nodes. We start with programs in which arbitrary terms of a given signature may be used in function nodes and arbitrary formulas of this signature may be used in predicate nodes. We then extend our results to programs that are close in nature to computation trees: if such a program is a finite tree-program, then it is an ordinary computation tree. Copyright © 2025, The Authors. All rights reserved.

关键词： structured programming

Probing the Design Space Parallel Versions for Exploratory programming

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Beckmann, Tom Bergsiek, Joana Krebs, Eva Mattis, Toni Ramson, Stefan Rinard, Martin C. Hischfeld, Robert Hasso Plattner Institute University of Potsdam Germany CSAIL Massachusetts Institute of Technology CambridgeMA United States

Exploratory programming involves open-ended tasks. To evaluate their progress on these, programmers require frequent feedback and means to tell if the feedback they observe is bringing them in the right direction. Collecting, comparing, and sharing feedback is typically done through ad-hoc means: relying on memory to compare outputs, code comments, or manual screenshots. To approach this issue, we designed Exploriants: an extension to example-based live programming. Exploriants allows programmers to place variation points. It collects outputs captured in probes and presents them in a comparison view that programmers can customize to suit their program domain. We find that the addition of variation points and the comparisons view encourages a structured approach to exploring variations of a program. We demonstrate Exploriants’ capabilities and applicability in three case studies on image processing, data processing, and game development. Given Exploriants, exploratory programmers are given a straightforward means to evaluate their progress and do not have to rely on ad-hoc methods that may introduce errors. Copyright © 2025, The Authors. All rights reserved.

关键词： structured programming

Preserving model structure and constraints in scientific computing

学校读者我要写书评

暂无评论

Measurement: Sensors 2025年 38卷

作者： Forbes, Alistair Lines, Keith Forsberg, Fredrik Nordvall McBride, Conor Videla, Andre National Physical Laboratory Teddington United Kingdom University of Strathclyde Glasgow United Kingdom

In this paper, we look at how model structure and constraints can be incorporated into scientific computing using functional programming and, implicitly, category theory, in a way that constraints are automatically satisfied. Category theory is the study of different types of objects (e.g., sets, groups, vector spaces) and mappings between them (e.g., functions, homomorphisms, matrices) and is used in mathematics to model the underlying structure associated with systems we wish to describe and how this underlying structure is preserved under transformations. In this paper, we look at the structure associated with the representation of, and calculations using, quantitative data. In particular, we describe how measurement data can be represented in terms of the product C × D of two groups: the first, C, the counting algebra, and the second, D, the dimension algebra. Different but equivalent unit systems are related through group isomorphisms. The structure associated with this representation can be embedded in software using functional programming. © 2024

关键词： structured programming

SOLIDIFFY: AST Differencing for Solidity Smart Contracts

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Eshghie, Mojtaba Åryd, Viktor Artho, Cyrille Monperrus, Martin KTH Royal Institute of Technology Stockholm Sweden

structured code differencing is the act of comparing the hierarchical structure of code via its abstract syntax tree (AST) to capture modifications. AST-based source code differencing enables tasks such as vulnerability detection and automated repair where traditional line-based differencing falls short. We introduce SOLIDIFFY, the first AST differencing tool for Solidity smart contracts with the ability to generate an edit script that soundly shows the structural differences between two smart-contracts using insert, delete, update, move operations. In our evaluation on 353 262 contract pairs, SOLIDIFFY achieved a 96.1% diffing success rate, surpassing the state-of-the-art, and produced significantly shorter edit scripts. Additional experiments on 925 real-world commits further confirmed its superiority compared to Git line-based differencing. SOLIDIFFY provides accurate representations of smart contract evolution even in the existence of multiple complex modifications to the source code. SOLIDIFFY is publicly available at https://***/mojtabaeshghie/SoliDiffy. Copyright © 2024, The Authors. All rights reserved.

关键词： structured programming

COSMIC: Clique-Oriented Semantic Multi-space Integration for Robust CLIP Test-Time Adaptation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Huang, Fanding Jiang, Jingyan Jiang, Qinting Li, Hebei Khan, Faisal Nadeem Wang, Zhi Shenzhen International Graduate School Tsinghua University China Shenzhen Technology University China University of Science and Technology China

Recent vision-language models (VLMs) face significant challenges in test-time adaptation to novel domains. While cache-based methods show promise by leveraging historical information, they struggle with both caching unreliable feature-label pairs and indiscriminately using single-class information during querying, significantly compromising adaptation accuracy. To address these limitations, we propose COSMIC (Clique-Oriented Semantic Multi-space Integration for CLIP), a robust test-time adaptation framework that enhances adaptability through multi-granular, cross-modal semantic caching and graph-based querying mechanisms. Our framework introduces two key innovations: Dual Semantics Graph (DSG) and Clique Guided Hyper-class (CGH). The Dual Semantics Graph constructs complementary semantic spaces by incorporating textual features, coarse-grained CLIP features, and fine-grained DINOv2 features to capture rich semantic relationships. Building upon these dual graphs, the Clique Guided Hyper-class component leverages structured class relationships to enhance prediction robustness through correlated class selection. Extensive experiments demonstrate COSMIC’s superior performance across multiple benchmarks, achieving significant improvements over state-of-the-art methods: 15.81% gain on out-of-distribution tasks and 5.33% on cross-domain generation with CLIP RN-50. Code is available at ***/hf618/COSMIC. Copyright © 2025, The Authors. All rights reserved.

关键词： structured programming

Diverse In-Context Example Selection After Decomposing Programs and Aligned Utterances Improves Semantic Parsing

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Kothyari, Mayank Sarawagi, Sunita Chakrabarti, Soumen Arora, Gaurav Merugu, Srujana Indian Institute of Technology Bombay India Amazon United States

LLMs are increasingly used as seq2seq translators from natural language utterances to structured programs, a process called semantic interpretation. Unlike atomic labels or token sequences, programs are naturally represented as abstract syntax trees (ASTs). Such structured representation raises novel issues related to the design and selection of in-context examples (ICEs) presented to the LLM. We focus on decomposing the pool of available ICE trees into fragments to minimize interference from irrelevant content and improve generalization on test instances. Next, we propose how to use (additional invocations of) an LLM with prompted syntax constraints to automatically map the fragments to corresponding utterances. Finally, we adapt and extend a recent method for diverse ICE selection to work with whole and fragmented ICE instances. We evaluate our system, SCUD4ICL1, on popular diverse semantic parsing benchmarks, showing visible accuracy gains from our proposed decomposed diverse demonstration method. Benefits are particularly notable for smaller LLMs, ICE pools having larger labeled trees, and programs in lower resource languages. © 2025, CC BY.

关键词： structured programming

Chain of Grounded Objectives: Bridging Process and Goal-oriented Prompting for Code Generation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yeo, Sangyeop Hwang, Seung-Won Ma, Yu-Seung Electronics and Telecommunications Research Institute Seoul National University Korea Republic of

The use of Large Language Models (LLMs) for code generation has gained significant attention in recent years. Existing methods often aim to improve the quality of generated code by incorporating additional contextual information or guidance into input prompts. Many of these approaches adopt sequential reasoning strategies, mimicking human-like step-by-step thinking. However, such strategies may constrain flexibility, as they do not always align with the structured characteristics of programming languages. This paper introduces the Chain of Grounded Objectives (CGO), a method that embeds functional objectives into input prompts to enhance code generation. By leveraging appropriately structured objectives as input and avoiding explicit sequential procedures, CGO adapts effectively to the structured nature of programming tasks. Empirical evaluations demonstrate that CGO effectively enhances code generation, addressing limitations of existing approaches. © 2025, CC BY.

关键词： structured programming

Weak Permission is not Well-Founded, Grounded and Stable

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Governatori, Guido School of Engineering and Technology Central Queensland University 544 Yaamba Road RockhamptonQLD4701 Australia Artificial Intelligence and Cyber Futures Institute Charles Sturt University BathurstNSW4701 Australia

We consider the notion of weak permission as the failure to conclude that the opposite obligation. We investigate the issue from the point of non-monotonic reasoning, specifically logic programming and structured argumentation, and we show that it is not possible to capture weak permission in the presence of deontic conflicts under the well-founded, grounded and (sceptical) stable semantics. © 2024, CC BY-NC-ND.

关键词： structured programming