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

Africanus I. Scalable, distributed and efficient radio data processing with Dask-MS and Codex Africanus

ASTRONOMY AND COMPUTING 2025年 52卷

作者： Perkins, S. J. Kenyon, J. S. Andati, L. A. L. Bester, H. L. Smirnov, O. M. Hugo, B. V. South African Radio Astron Observ SARAO Cape Town South Africa Rhodes Univ Ctr Radio Astron Tech & Technol RATT Dept Phys & Elect Makhanda EC South Africa Natl Inst Astrophys INAF IRA Inst Radioastron Bologna Italy

The physical configuration of new radio interferometers such as MeerKAT, SKA, ngVLA and DSA-2000 informs the development of software in two important areas. Firstly, tractably processing the sheer quantity of data produced by new instruments necessitates subdivision and processing on multiple nodes. Secondly, the sensitivity inherent in modern instruments due to improved engineering practices and greater data quantities necessitates the development of new techniques to capitalize on the enhanced sensitivity of modern interferometers. This produces a critical tension in radio astronomy software development: a fully optimized pipeline is desirable for producing science products in a tractable amount of time, but the design requirements for such a pipeline are unlikely to be understood upfront in the context of artefacts unveiled by greater instrument sensitivity. Therefore, new techniques must continuously be developed to address these artefacts and integrated into a full pipeline. As Knuth reminds us, "Premature optimization is the root of all evil". This necessitates a fundamental trade-off between a trifecta of (1) performant code (2) flexibility and (3) ease-of-development. At one end of the spectrum, rigid design requirements are unlikely to capture the full scope of the problem, while throw-away research code is unsuitable for production use. This work proposes a framework for the development of radio astronomy techniques within the above trifecta. In doing so, we favour flexibility and ease-of-development over performance, but this does not necessarily mean that the software developed within this framework is slow. Practically this translates to using data formats and software from the Open Source Community. For example, by using NuMPy arrays and/or PANDAS dataframes, a plethora of algorithms immediately become available to the scientific developer. Focusing on performance, the breakdown of Moore's Law in the 2010s and the resultant growth of both multi-core an

关键词： Standards Techniques Interferometric Computer systems organization Pipeline computing software and its engineering Data flow architectures Cloud computing Interoperability Scheduling Distributed systems organizing principles Multithreading

来源：评论

学校读者我要写书评

暂无评论

Demo2Test: Transfer Testing of Agent in Competitive Environment with Failure Demonstrations

引用

ACM TRANSACTIONS ON software engineering AND METHODOLOGY 2025年第2期34卷 1-28页

作者： Chen, Jianming Wang, Yawen Wang, Junjie Xie, Xiaofei Wang, Dandan Wang, Qing Xu, Fanjiang Chinese Acad Sci Inst Software Beijing Peoples R China Singapore Management Univ Singapore Singapore

The competitive game between agents exists in many critical applications, such as military unmanned aerial vehicles. It is urgent to test these agents to reduce the significant losses caused by their failures. Existing studies mainly are to construct a testing agent that competes with the target agent to induce its failures. These approaches usually focus on a single task, requiring much more time for multi-task testing. However, if the previously tested tasks (source tasks) and the task to be tested (target task) share similar agents or task objectives, the transferable knowledge in source tasks can potentially increase the effectiveness of testing in the target task. We propose Demo2Test for conducting transfer testing of agents in the competitive environment, i.e., leveraging the demonstrations of failure scenarios from the source task to boost the testing effectiveness in the target task. It trains a testing agent with demonstrations and incorporates the action perturbation at key states to balance the number of revealed failures and their diversity. We conduct experiments in the simulated robotics competitive environments of MuJoCo. The results indicate that Demo2Test outperforms the best-performing baseline with improvements ranging from 22.38% to 87.98%, and 12.69% to 60.98%, in terms of the number and diversity of discovered failure scenarios, respectively.

关键词： Computer systems organization Reliability software and its engineering software testing and debugging Computing methodologies Adversarial learning

来源：评论

学校读者我要写书评

暂无评论

SURE: A Visualized Failure Indexing Approach Using Program Memory Spectrum

引用

ACM TRANSACTIONS ON software engineering AND METHODOLOGY 2024年第8期33卷 1-43页

作者： Song, Yi Zhang, Xihao Xie, Xiaoyuan Chen, Songqiang Liu, Quanming Gao, Ruizhi Wuhan Univ Sch Comp Sci Wuhan Peoples R China Hong Kong Univ Sci & Technol Hong Kong Hong Kong Peoples R China Sonos Inc Boston MA 02111 USA

This work was partially supported by the National Natural Science Foundation of China under the grant number 62250610224.

关键词： software and its engineering software testing and debugging

来源：评论

学校读者我要写书评

暂无评论

Generic Refinement Types

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2025年第POPL期9卷 1446-1474页

作者： Lehmann, Nico Kurashige, Cole Akiti, Nikhil Krishnakumar, Niroop Jhala, Ranjit Univ Calif San Diego San Diego CA 92093 USA

We present Generic Refinement Types: a way to write modular higher-order specifications that abstract invariants over function contracts, while preserving automatic SMT-decidable verification. We show how generic refinements let us write a variety of modular higher-order specifications, including specifications for Rust's traits which abstract over the concrete refinements that hold for different trait implementations. We formalize generic refinements in a core calculus and show how to synthesize the generic instantiations algorithmically at usage sites via a combination of syntactic unification and constraint solving. We give semantics to generic refinements via the intuition that they correspond to ghost parameters, and we formalize this intuition via a type-preserving translation into the polymorphic contract calculus to establish the soundness of generic refinements. Finally, we evaluate generic refinements by implementing them in FLUX and using it for two case studies. First, we show how generic refinements let us write modular specifications for Rust's vector indexing API that lets us statically verify the bounds safety of a variety of vector-manipulating benchmarks from the literature. Second, we use generic refinements to refine Rust's DIESEL ORM library to track the semantics of the database queries issued by client applications, and hence, statically enforce data-dependent access-control policies in several database-backed web applications.

关键词： Theory of computation- Type structures Logic and verification software and its engineering software verification

来源：评论

学校读者我要写书评

暂无评论

COBIRAS: Offering a Continuous Bit Rate Slide to Maximize DASH Streaming Bandwidth Utilization

引用

ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS 2024年第10期20卷 1-24页

作者： Seufert, Michael Spangenberger, Marius Poignee, Fabian Wamser, Florian Robitza, Werner Timmerer, Christian Hossfeld, Tobias Univ Augsburg Augsburg Germany Univ Wurzburg Wurzburg Germany Lucerne Univ Appl Sci & Arts Luzern Switzerland AVEQ GmbH Vienna Austria Alpen Adria Univ Christian Doppler Lab ATHENA Klagenfurt Austria

Reaching close-to-optimal bandwidth utilization in dynamic adaptive streaming over HTTP (DASH) systems can, in theory, be achieved with a small discrete set of bit rate representations. This includes typical bit rate ladders used in state-of-the-art DASH systems. In practice, however, we demonstrate that bandwidth utilization, and consequently the quality of experience (QoE), can be improved by offering a continuous set of bit rate representations, i.e., a continuous bit rate slide (COBIRAS). Moreover, we find that the buffer fill behavior of different standard adaptive bit rate (ABR) algorithms is sub-optimal in terms of bandwidth utilization. To overcome this issue, we leverage COBIRAS' flexibility to request segments with any arbitrary bit rate and propose a novel ABR algorithm MinOff, which helps maximizing bandwidth utilization by minimizing download off-phases during streaming. To avoid extensive storage requirements with COBIRAS and to demonstrate the feasibility of our approach, we design and implement a proof-of-concept DASH system for video streaming that relies on just-in-time encoding (JITE), which reduces storage consumption on the DASH server. Finally, we conduct a performance evaluation on our testbed and compare a state-of-the-art DASH system with few bit rate representations and our JITE DASH system, which can offer a COBIRAS, in terms of bandwidth utilization and video QoE for different ABR algorithms.

关键词： Information systems Multimedia streaming software and its engineering software performance

来源：评论

学校读者我要写书评

暂无评论

Reward Augmentation in Reinforcement Learning for Testing Distributed Systems

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2024年第OOPSLA2期8卷 1928-1954页

作者： Borgarelli, Andrea Enea, Constantin Majumdar, Rupak Nagendra, Srinidhi MPI SWS Kaiserslautern Germany Inst Polytech Paris LIX Ecole Polytech CNRS Palaiseau France Univ Paris Cite IRIF CNRS Paris France Chennai Math Inst Chennai India

Bugs in popular distributed protocol implementations have been the source of many downtimes in popular internet services. We describe a randomized testing approach for distributed protocol implementations based on reinforcement learning. Since the natural reward structure is very sparse, the key to successful exploration in reinforcement learning is reward augmentation. We show two different techniques that build on one another. First, we provide a decaying exploration bonus based on the discovery of new states-the reward decays as the same state is visited multiple times. The exploration bonus captures the intuition from coverage-guided fuzzing of prioritizing new coverage points;in contrast to other schemes, we show that taking the maximum of the bonus and the Q-value leads to more effective exploration. Second, we provide waypoints to the algorithm as a sequence of predicates that capture interesting semantic scenarios. Waypoints exploit designer insight about the protocol and guide the exploration to "interesting" parts of the state space. Our reward structure ensures that new episodes can reliably get to deep interesting states even without execution caching. We have implemented our algorithm in Go. Our evaluation on three large benchmarks (RedisRaft, Etcd, and RSL) shows that our algorithm can significantly outperform baseline approaches in terms of coverage and bug finding.

关键词： CCS Concepts software and its engineering software testing and debugging Theory of computation Reinforcement learning Computing methodologies Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

QUARE: towards a question-answering model for requirements elicitation

引用

AUTOMATED software engineering 2023年第2期30卷 1-38页

作者： Gallego, Johnathan Mauricio Calle Jaramillo, Carlos Mario Zapata Univ Nacl Colombia Medellin Colombia

Requirements elicitation is a stakeholder-centered approach;therefore, natural language remains an effective way of documenting and validating requirements. As the scope of the software domain grows, software analysts process a higher number of requirements documents, generating delays and errors while characterizing the software domain. Natural language processing is key in such a process, allowing software analysts for speeding up the requirements elicitation process and mitigating the impact of the ambiguity and misinterpretations coming from natural-language-based requirements documents. However, natural-language-processing-based proposals for requirements elicitation are mainly focused on specific domains and still fail for understanding several requirements writing styles. In this paper, we present QUARE, a question-answering model for requirements elicitation. The QUARE model comprises a meta-ontology for requirements elicitation, easing the generation of requirements-elicitation-related questions and the initial structuration of any software domain. In addition, the QUARE model includes a named entity recognition and relation extraction system focused on requirements elicitation, allowing software analysts for processing several requirements writing styles. Although software analysts address a software domain at a time, they use the same kind of questions for identifying and characterizing requirements abstractions such as actors, concepts, and actions from a software domain. Such a process may be framed into the QUARE model workflow. We validate our proposal by using an experimental process including real-world requirements documents coming from several software domains and requirements writing styles. The QUARE model is a novel proposal aimed at supporting software analysts in the requirements elicitation process.

关键词： Information systems Information retrieval Retrieval tasks and goals Question answering software and its engineering software creation and management Designing software Requirements analysis Information extraction Requirements elicitation Question-answering systems Natural language processing Named entity recognition

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Agent APIs for Large-scale Social VR Platforms

Design and Implementation of Agent APIs for Large-scale Soci...

引用

IEEE Conference on Virtual Reality and 3D User Interfaces (VR)

作者： Kurai, Ryutaro Hiraki, Takefumi Hiroi, Yuichi Hirao, Yutaro Perusquia-Hernandez, Monica Uchiyama, Hideaki Kiyokawa, Kiyoshi Cluster Inc Nara Inst Sci & Technol Yonkers NY 10701 USA Cluster Metaverse Lab Tokyo Japan Nara Inst Sci & Technol Nara Japan

ISBN: (纸本)9798350374490;9798350374506

Implementing an autonomous agent on a social VR platform where many users share space requires diverse information. In particular, it is required to recognize the distance from other users, their orientation toward each other, the avatar's pose, and text and voice messages, and to behave accordingly. This paper proposes an API to obtain the above information on "Cluster," a multi-device social VR platform in operation, and an agent that uses the API. We have implemented this API using a network proxy. The agent using this API can connect to ChatGPT [7] and have a conversation in real time. We measured the latency required for the conversation and confirmed that the response time was about 1 second.

关键词： Human-centered computing Human computer interaction (HCI) Interaction paradigms Virtual reality software and its engineering software organization and properties Contextual software domains Virtual worlds software

来源：评论

学校读者我要写书评

暂无评论

Establishing Pattern Sequences Using Stochastic Processes with an Application to Security Patterns 24

Establishing Pattern Sequences Using Stochastic Processes wi...

引用

29th European Conference on Pattern Languages of Programs, People, and Practices

作者： Matovic, Viktor Vranic, Valentino Slovak Univ Technol Bratislava Fac Informat & Informat Technol Inst Informat Informat Syst & Software Engn Bratislava Slovakia

ISBN: (纸本)9798400716836

Security patterns can help organizations develop secure software. While it is typical to encounter isolated applications of one or more software patterns in practice, effectively responding to security threats demands a comprehensive grasp and utilization of an entire pattern language or catalog, comprising numerous intricately interconnected patterns. The composition of software patterns makes them more efficient. Solutions for establishing sequences of software patterns are often found documented in plain text through explicit pattern relationships. This article presents two experiments of establishing pattern sequences using stochastic processes, one based on stochastic trees and the other, based on Bayesian belief network to establish meaningful pattern sequences. We used stochastic trees and Bayesian belief networks to find conditionally dependent patterns between which we tried to find the most expected combinations in pattern sequences. By employing these two processes, we established four envisioned sequences of patterns from the security pattern catalog. The pattern stories based around these pattern sequences demonstrate their meaningfulness. These two processes are not exclusively relevant to security patterns. We consider applying them to the patterns for engineering software for the cloud.

关键词： software and its engineering Security and privacy Probability and statistics

来源：评论

学校读者我要写书评

暂无评论

software Test Case Minimization Using Modified Firefly Technique 9th

Software Test Case Minimization Using Modified Firefly Techn...

引用

9th International Congress on Information and Communication Technology (ICICT)

作者： Sobuj, Md Shazzad Ali Rizwan, Syed Akhond, Mostafijur Rahman Jashore Univ Sci & Technol Jashore 7400 Bangladesh

ISBN: (纸本)9789819735587;9789819735594

The step of software engineering that requires the utmost time and resources is software testing. Techniques for test case reduction are used to condense the test suite, saving time and resources in the process. The basic goal of test case reduction is to get rid of useless test cases while still ensuring that the code being tested is sufficiently covered by the test suite. In this study, a model has been proposed to cut down on complexity and test cases. We have employed a moderated nature-inspired meta-heuristic algorithm called the Firefly Algorithm, to identify essential strings of test cases and eliminate irrelevant test instances. In our research, we have used some synthetic models and succeeded to reduce 36.17% of test cases.

关键词： software testing and debugging software verification and validation software defect analysis software and its engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：