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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

491 篇 会议
13 篇 期刊文献
7 册 图书

馆藏范围

511 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

320 篇 工学
- 241 篇 计算机科学与技术...
- 176 篇 软件工程
- 95 篇 电气工程
- 29 篇 控制科学与工程
- 21 篇 机械工程
- 18 篇 信息与通信工程
- 14 篇 生物医学工程（可授...
- 14 篇 生物工程
- 10 篇 电子科学与技术（可...
- 8 篇 材料科学与工程（可...
- 6 篇 核科学与技术
- 5 篇 石油与天然气工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 2 篇 光学工程
- 2 篇 建筑学
61 篇 理学
- 29 篇 数学
- 14 篇 物理学
- 14 篇 生物学
- 6 篇 系统科学
- 4 篇 统计学（可授理学、...
28 篇 管理学
- 17 篇 管理科学与工程(可...
- 8 篇 图书情报与档案管...
- 6 篇 工商管理
- 3 篇 公共管理
12 篇 农学
- 12 篇 作物学
5 篇 医学
4 篇 法学
- 2 篇 法学
- 2 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
2 篇 教育学
- 2 篇 教育学
1 篇 文学

主题

48 篇 programming
38 篇 logic gates
31 篇 logic programmin...
28 篇 programming prof...
28 篇 software enginee...
25 篇 linear programmi...
23 篇 software
15 篇 computational mo...
14 篇 java
14 篇 logic
14 篇 probabilistic lo...
12 篇 computer program...
11 篇 optimization
11 篇 detectors
11 篇 dynamic programm...
11 篇 testing
10 篇 object oriented ...
10 篇 fuzzy logic
10 篇 parallel program...
10 篇 data models

机构

3 篇 nasa ames resear...
3 篇 george mason uni...
3 篇 carnegie mellon ...
3 篇 stillman school ...
3 篇 imperial coll lo...
2 篇 mayo fdn rochest...
2 篇 iran univ sci & ...
2 篇 univ copenhagen ...
2 篇 chalmers univers...
2 篇 university of fe...
2 篇 school of comput...
2 篇 ludwig maximilia...
2 篇 texas tech unive...
2 篇 tu wien austria
2 篇 graz university ...
2 篇 katholieke univ ...
2 篇 graduate school ...
2 篇 zagazig universi...
2 篇 iran university ...
2 篇 agh university o...

作者

5 篇 toni francesca
4 篇 azzolini damiano
4 篇 gupta gopal
3 篇 hanbong lee
3 篇 gavanelli marco
3 篇 riguzzi fabrizio
3 篇 eiter thomas
3 篇 coblenz michael
3 篇 satoh ken
3 篇 džeroski sašo
2 篇 lucarini stephen
2 篇 thevapalan andre
2 篇 liu yanhong a.
2 篇 m.a. farahat
2 篇 lavrac nada
2 篇 v. kodaganallur
2 篇 rose emma
2 篇 osaka naotoshi
2 篇 radoslaw klimek
2 篇 gebser martin

语言

506 篇 英文
5 篇 其他

检索条件"任意字段=39th International Conference on Logic Programming"

共 511 条记录，以下是41-50 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Geometric reasoning on the Traveling Salesperson Problem: comparing Answer Set programming and Constraint logic programming Approaches 39

Geometric reasoning on the Traveling Salesperson Problem: co...

引用

39th international conference on logic programming Workshops, ICLP Workshops 2023

作者： Bertagnon, Alessandro Gavanelli, Marco Department of Environmental and Prevention Sciences University of Ferrara C.so Ercole I D’Este 32 Ferrara Italy Department of Engineering University of Ferrara Via Saragat 1 Ferrara Italy

the Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science. Many instances and real world applications fall into the Euclidean TSP special case, in which each node is identified by its coordinates on the plane and the Euclidean distance is used as cost function. It is worth noting that in the Euclidean TSP more information is available than in the general case;in a previous publication, the use of geometric information has been exploited to speedup TSP solving for Constraint logic programming (CLP) solvers. In this work, we study the applicability of geometric reasoning to the Euclidean TSP in the context of an ASP computation. We compare experimentally a classical ASP approach to the TSP and the effect of the reasoning based on geometric properties. We also compare the speedup of the additional filtering based on geometric information on an Answer Set programming (ASP) solver and a CLP on Finite Domain (CLP(FD)) solver. 2023 Copyright for this paper by its authors.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Nuclear Medicine Scheduling via Answer Set programming 39

Nuclear Medicine Scheduling via Answer Set Programming

引用

39th Italian conference on Computational logic, CILC 2024

作者： Dodaro, Carmine Galatà, Giuseppe Marte, Cinzia Maratea, Marco Mochi, Marco DeMaCS University of Calabria Rende Italy SurgiQ srl Genova Italy DIBRIS University of Genoa Genoa Italy

the Nuclear Medicine Scheduling (NMS) problem consists of assigning patients to a day, in which the patient will undergo the medical check, the preparation, and the actual image detection process. the schedule of the patients should consider the different requirements of the patients and the available resources, e.g., varying time required for different diseases and radiopharmaceuticals used, number of injection chairs, and tomographs available. In this paper we present a solution where modeling and solving are done via Answer Set programming. Experiments employing real data show that the solution provides satisfying results in a short time. © 2024 Copyright for this paper by its authors.

关键词： Nuclear medicine

来源：评论

学校读者我要写书评

暂无评论

the Janus System: Multi-paradigm programming in Prolog and Python 39

The Janus System: Multi-paradigm Programming in Prolog and P...

引用

39th international conference on logic programming

作者： Swift, theresa Andersen, Carl Johns Hopkins Appl Phys Lab Laurel MD 20723 USA

Python and Prolog express different programming paradigms, with different strengths. Python is wildly popular because it is well-structured, easy to use, and mixes well with thousands of scientific and machine learning programs written in C. Prolog's logic-based approach provides powerful reasoning capabilities, especially when combined with constraint evaluation, probabilistic reasoning, well-founded negation, and other advances. Both languages have commonalities as well: both are usually written in C, both are dynamically typed, and both use data structures based on a small number of recursive *** paper describes the design and implementation of Janus, a system that tightly combines Prolog and Python into a single process. Janus bi-translates data structures and offers performance of many hundreds of thousands of round-trip inter-language calls per second. Although Janus is still new, it has been used in commercial applications including natural language processing, visual query answering and robotic automation. Janus was developed for XSB, but porting Janus code to a second Prolog has been straightforward, indicating that Janus is a tool that other Prologs may easily adopt.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 2024 39th international conference on Image and Vision Computing New Zealand, IVCNZ 2024

Proceedings of the 2024 39th International Conference on Ima...

引用

39th international conference on Image and Vision Computing New Zealand, IVCNZ 2024

ISBN: (纸本)9798331518776

the proceedings contain 52 papers. the topics discussed include: GroupLearning: label noise mitigation through multi-expert collaboration for medical image analysis;spectral neural attenuation fields for cone beam CT;gaze estimation via synthetic event-driven neural networks;automatic detection of peripheral facial landmarks using 3D facial data;on feed-forward neural-network-based atmospheric tomography;image segmentation with a deep declarative network;automated flow tracking software for capillary microfluidic devices;genetic programming-based multi-object matching for mussel floats in mussel farm images;vote-based line aggregation for sports field registration;and disentanglement-based unsupervised domain adaptation for nuclei instance segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Program Synthesis Meets Visual What-Comes-Next Puzzles 24

Program Synthesis Meets Visual What-Comes-Next Puzzles

引用

39th ACM/IEEE international conference on Automated Software Engineering (ASE)

作者： Lahiri, Sumit Kalita, Pankaj Kumar Chittora, Akshay Kumar Vankudre, Varun Roy, Subhajit Indian Inst Technol Kanpur Kanpur Uttar Pradesh India

ISBN: (数字)9798400712487

ISBN: (纸本)9798400712487

What-Comes-Next (WCN) puzzles challenge us to identify the next figure that "logically follows" a provided sequence of figures. WCN puzzles are a favorite of interviewers and examiners-there is hardly any aptitude test that misses WCN puzzles. In this work, we propose to automatically synthesize WCN puzzles. the key insight to our methodology is that generation of WCN problems can be posed as a program synthesis problem. We design a small yet expressive language, PUZZLERLANG, to capture solutions to WCN puzzles. PUZZLERLANG is expressive enough to explain almost all human generated WCN puzzles that we collected, and yet, small enough to allow synthesis in a reasonable time. To ensure that the generated puzzles are appealing to humans, we infer a machine learning model to approximate the appeal factor of given WCN puzzle to humans. We use this model within our puzzle synthesizer as an optimization function to generate highly appealing and correct-by-construction WCN puzzles. We implemented our ideas in a tool, PUZZLEGEN;we found that PUZZLEGEN is fast, clocking an average time of about 3.4s per puzzle. Further, statistical tests over the responses from a user-study supported that the PuzzleGen generated puzzles were indistinguishable from puzzles created by humans.

关键词： Training Visualization Synthesizers Software algorithms Machine learning Probabilistic logic Inference algorithms Reliability Optimization Software engineering

来源：评论

学校读者我要写书评

暂无评论

Repairing Regex-Dependent String Functions 24

Repairing Regex-Dependent String Functions

引用

39th ACM/IEEE international conference on Automated Software Engineering (ASE)

作者： Chida, Nariyoshi Terauchi, Tachio NTT Social Informat Labs Tokyo Japan Waseda Univ Tokyo Japan

ISBN: (数字)9798400712487

ISBN: (纸本)9798400712487

Regex-dependent string functions are string functions that take regular expressions (regexes) as parameters and are popular means of manipulating strings. they are frequently used for, e.g., string transformation and substring search. Despite the importance, writing these functions is far from easy. To rectify this situation, recent research made significant progress by proposing automated methods for synthesizing regexes based on programming by Examples (PBE). However, there still is a gap between these methods and the goal of synthesizing regex-dependent string functions. First, the existing methods focus on whole-string matching, whereas most regex-dependent string functions adopt substring matching. Second, the existing methods focus only on the regex, but many commonly used regex-dependent string functions, such as replace and replaceAll, also take as parameter a replacement to specify how the substrings matched to the regex will be replaced. this paper fills the gap by presenting the first PBE-based method for repairing regex-dependent string functions. Like the recent methods for regex synthesis, our algorithm builds on enumerative search with pruning and SMT constraint solving, but with extensions to support substring matching and replacement. the main challenge is the large search space. We address the challenge by novel ideas such as incorporation of origin information in examples to identify the locations of substrings to be matched, a new substring-context-aware pruning technique, and a novel use of SMT constraints to insert captures that can be referred from the replacement. Additionally, we identify a novel necessary and sufficient condition that can be used to detect and filter unrepairable instances. We implemented our algorithm as a prototype tool called R2-DS and evaluated it on real-world benchmarks. Results show that our algorithm efficiently repairs the bugs in the real world and finds high-quality repairs.

关键词： Regular Expression programming by Example Program Repair

来源：评论

学校读者我要写书评

暂无评论

JavaBench: A Benchmark of Object-Oriented Code Generation for Evaluating Large Language Models 24

JavaBench: A Benchmark of Object-Oriented Code Generation fo...

引用

39th ACM/IEEE international conference on Automated Software Engineering (ASE)

作者： Cao, Jialun Chen, Zhiyong Wu, Jiarong Cheung, Shing-Chi Xu, Chang Hong Kong Univ Sci & Technol Hong Kong Peoples R China Guangzhou HKUST Fok Ying Tung Res Inst Guangzhou Peoples R China Nanjing Univ Nanjing Peoples R China

ISBN: (数字)9798400712487

ISBN: (纸本)9798400712487

Code generation benchmarks such as HumanEval are widely adopted to evaluate LLMs' capabilities. However, after consolidating the latest 24 benchmarks, we noticed three significant imbalances. First, imbalanced programming language. 95.8% of benchmarks involve Python, while only 5 benchmarks involve Java, resulting in an insufficient understanding of LLMs' capability to generate Java code. Second, imbalanced code granularity. Function-/statementlevel benchmarks account for over 83.3% of benchmarks. Only a mere handful extends to class-/project-levels, and all are limited to Python. third, lacking advanced features. Existing benchmarks primarily assess basic coding skills (e.g., variables, operators, and control structures), while overlooking advanced Object-Oriented programming (OOP) features (i.e., encapsulation, inheritance, and polymorphism). Considering the prevalence of these advanced features in real-world Java project development, constructing benchmarks to test LLMs on handling OOP features is necessary. To fill these gaps, we propose JavaBench, a project-level Java benchmark that exercises OOP features. It comprises four Java projects with 389 methods in 106 Java classes. the test coverage is up to 92%, and JavaBench is attested by 282 undergraduate students, reaching a 90.93/100 average score (i.e., pass rate against the test suite), ensuring the quality of documentation, code skeleton, and tests. To better evaluate LLM's capability against JavaBench, we introduce a systematic evaluation design covering three context settings and five synthesis strategies at two granularities using three hierarchical metrics. Our extensive experiment yields several interesting findings. First, we noticed that regarding project-level Java programming, LLMs are far behind undergraduate students (no project can be correctly completed by any studied LLMs, and at most 48.24% Pass@5 in a more relaxed evaluation). Second, using method signature as prompt context may strike an idea

关键词： Large Language Model Program Synthesis Object-Oriented programming

来源：评论

学校读者我要写书评

暂无评论

A logic programming Approach to Global Logistics in a Co-Design Environment 39

A Logic Programming Approach to Global Logistics in a Co-Des...

引用

39th international conference on logic programming (ICLP)

作者： Dietz, Emmanuelle Philipp, Tobias Schramm, Gerrit Zindel, Andreas Airbus Cent Res & Technol Manching Germany Secunet Secur Networks AG Essen Germany

In a co-design environment changes need to be integrated quickly and in an automated manner. this paper considers the challenge of creating and optimizing a global logistics system for the construction of a passenger aircraft within a co-design approach with respect to key performance indicators (like cost, time or resilience). the product in question is an aircraft, comprised of multiple components, manufactured at multiple sites worldwide. the goal is to find an optimal way to build the aircraft taking into consideration the requirements for its industrial system. the main motivation for approaching this challenge is to develop the industrial system in tandem with the product and making it more resilient against unforeseen events, reducing the risks of bottlenecks in the supply chain. this risk reduction ensures continued efficiency and operational success. To address this challenging and complex task we have chosen Answer Set programming (ASP) as the modeling language, formalizing the relevant requirements of the investigated industrial system. the approach presented in this paper covers three main aspects: the extraction of the relevant information from a knowledge graph, the translation into logic programs and the computation of existing configurations guided by optimization criteria. Finally we visualize the results for an effortless evaluation of these models. Internal results seem promising and yielded several new research questions for future improvements of the discussed use case.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Counterexamples in Safe Rust 39

Counterexamples in Safe Rust

引用

39th ACM/IEEE international conference on Automated Software Engineering Workshops, ASEW 2024

作者： Hassnain, Muhammad Stanford, Caleb University of California Davis United States

ISBN: (纸本)9798400712494

the Rust programming language is a prominent candidate for a C and C++ replacement in the memory-safe era. However, Rust's safety guarantees do not in general extend to arbitrary third-party code. the main purpose of this short paper is to point out that this is true even entirely within safe Rust - which we illustrate through a series of counterexamples. To complement our examples, we present initial experimental results to investigate: do existing program analysis and program verification tools detect or mitigate these risks? Are these attack patterns realizable via input to publicly exposed functions in real-world Rust libraries? And to what extent do existing supply chain attacks in Rust leverage similar attacks? All of our examples and associated data are available as an open source repository on Github. We hope this paper will inspire future work on rethinking safety in Rust - especially, to go beyond the safe/unsafe distinction and harden Rust against a stronger threat model of attacks that can be used in the wild. © 2024 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

On the Independencies Hidden in the Structure of a Probabilistic logic Program 39

On the Independencies Hidden in the Structure of a Probabili...

引用

39th international conference on logic programming (ICLP)

作者： Rueckschloss, Kilian Weitkaemper, Felix Ludwig Maximilians Univ Munchen Oettingenstr 67 D-80538 Munich Germany

Pearl and Verma developed d-separation as a widely used graphical criterion to reason about the conditional independencies that are implied by the causal structure of a Bayesian network. As acyclic ground probabilistic logic programs correspond to Bayesian networks on their dependency graph, we can compute conditional independencies from d-separation in the latter. In the present paper, we generalize the reasoning above to the non-ground case. First, we abstract the notion of a probabilistic logic program away from external databases and probabilities to obtain so-called program structures. We then present a correct meta-interpreter that decides whether a certain conditional independence statement is implied by a program structure on a given external database. Finally, we give a fragment of program structures for which we obtain a completeness statement of our conditional independence oracle. We close with an experimental evaluation of our approach revealing that our meta-interpreter performs significantly faster than checking the definition of independence using exact inference in ProbLog 2.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共52页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：