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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

328 篇 工学
- 249 篇 计算机科学与技术...
- 176 篇 软件工程
- 95 篇 电气工程
- 37 篇 控制科学与工程
- 21 篇 机械工程
- 19 篇 信息与通信工程
- 14 篇 生物医学工程（可授...
- 14 篇 生物工程
- 10 篇 电子科学与技术（可...
- 8 篇 材料科学与工程（可...
- 6 篇 核科学与技术
- 5 篇 石油与天然气工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 2 篇 光学工程
- 2 篇 土木工程
61 篇 理学
- 29 篇 数学
- 14 篇 物理学
- 14 篇 生物学
- 6 篇 系统科学
- 4 篇 统计学（可授理学、...
28 篇 管理学
- 16 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
- 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 篇 eiter thomas
4 篇 azzolini damiano
4 篇 gupta gopal
3 篇 hanbong lee
3 篇 gavanelli marco
3 篇 riguzzi fabrizio
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

语言

504 篇 英文
15 篇 其他

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

共 519 条记录，以下是131-140 订阅

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

详细简洁

排序：

Sallm: Security Assessment of Generated Code

Sallm: Security Assessment of Generated Code

引用

IEEE/ACM international conference on Automated Software Engineering - Workshops (ASE Workshops)

作者： Mohammed Latif Siddiq Joanna Cecilia Da Silva Santos Sajith Devareddy Anna Muller University of Notre Dame Notre Dame IN USA

ISBN: (数字)9798400712494

ISBN: (纸本)9798331523169

With the growing popularity of Large Language Models (LLMs) in software engineers’ daily practices, it is important to ensure that the code generated by these tools is not only functionally correct but also free of vulnerabilities. Although LLMs can help developers to be more productive, prior empirical studies have shown that LLMs can generate insecure code. there are two contributing factors to the insecure code generation. First, existing datasets used to evaluate LLMs do not adequately represent genuine software engineering tasks sensitive to security. Instead, they are often based on competitive programming challenges or classroom-type coding tasks. In real-world applications, the code produced is integrated into larger codebases, introducing potential security risks. Second, existing evaluation metrics primarily focus on the functional correctness of the generated code while ignoring security considerations. therefore, in this paper, we described Sallm, a framework to benchmark LLMs’ abilities to generate secure code systematically. this framework has three major components: a novel dataset of security-centric Python prompts, configurable assessment techniques to evaluate the generated code, and novel metrics to evaluate the models’ performance from the perspective of secure code *** Concepts• Security and privacy → Software security engineering; • Software and its engineering → Software verification and validation; • Computing methodologies → Natural language processing.

关键词： Measurement Codes Large language models programming Transformers Software Natural language processing Security Software engineering Python

来源：评论

学校读者我要写书评

暂无评论

Efficient Table-Based Polynomial on FPGA 39

Efficient Table-Based Polynomial on FPGA

引用

39th IEEE international conference on Computer Design ICCD)

作者： Barbone, Marco Kwaadgras, Bas W. Oelfke, Uwe Luk, Wayne Gaydadjiev, Georgi Imperial Coll London Dept Comp London England Univ Groningen Bernoulli Inst Groningen Netherlands Inst Canc Res Joint Dept Phys London England Royal Marsden NHS Fdn Trust London England Maxeler Technol London England

ISBN: (纸本)9781665432191

Field Programmable Gate Arrays (FPGAs) are gaining popularity in the context of scientific computing due to the recent advances of High-Level Synthesis (HLS) tool-chains for customised hardware implementations combined with the increase in computing capabilities of modern FPGAs. As a result, developers are able to implement more complex scientific workloads which often require the evaluation of univariate numerical functions. In this study, we propose a methodology for table-based polynomial interpolation aiming at producing area-efficient implementations of such functions on FPGAs achieving the same accuracy and at similar performance as direct implementations. We also provide a rigorous error analysis to guarantee the correctness of the results. Our methodology covers the forecast of resource utilisation of the polynomial interpolator and, based on the characteristics of the function, guides the developer to the most area-efficient FPGA implementation. Our experiments show that in the case of a radiation spectrum of a Black Body application based on evaluating Planck's Law, it is possible to reduce resource utilisation by up to 90% when compared to direct implementations not using table-based methods. Moreover, when only the kernels are considered, our method uses up to two orders of magnitude fewer resources with no performance penalties. Based on previous more theoretical works, our study investigates practical applications of table-based methods in the context of high performance and scientific computing where it is used to implement common but more complex functions than the elementary functions widely studied in the related literature.

关键词： Interpolation Scientific computing Error analysis conferences logic gates Hardware Resource management

来源：评论

学校读者我要写书评

暂无评论

Fostering Engagement and Creativity through programming: the Beauty and Joy of Computing in a First-year Engineering class 39

Fostering Engagement and Creativity through Programming: The...

引用

39th international conference of the Chilean-Computer-Science-Society (SCCC)

作者： Meza, Federico Torres, Nicolas Vasquez, Andrea Univ Tecn Federico Santa Maria Dept Informat Valparaiso Chile

ISBN: (纸本)9781728183282

there is a growing interest in learning computer programming even among students from majors other than computer science (CS). Many universities offer a common Introduction to programming (CS1) course, but this approach is usually detrimental to those who are not pursuing a CS major. this article is an experience report that summarizes the results of adapting and implementing the course "the Beauty and Joy of Computing" (BJC) in an Engineering in Product Design first-year class, a group that showed below-average performance in the past. BJC is a course for undergraduate non-CS majors at UC Berkeley, designed to broaden student participation in Computer Science. After a fully online semester of BJC at UTFSM, students showed greater responsibility and commitment when compared to previous cohorts. they also reported greater satisfaction with programming while having a lower attrition rate and comparable final grades to students in the regular CS1 class.

关键词： Computer science education CS0 introduction to programming block-based programming BJC Snap

来源：评论

学校读者我要写书评

暂无评论

OSTIA: A Low Cost Alternative for Short Summative Assessments in Massive programming Courses 39

OSTIA: A Low Cost Alternative for Short Summative Assessment...

引用

39th international conference of the Chilean-Computer-Science-Society (SCCC)

作者： Salas-Morales, Juan Munoz-Gama, Jorge Pontificia Univ Catolica Chile Escuela Ingn Dept Ciencia Comp Santiago Chile

ISBN: (纸本)9781728183282

Nowadays, programming courses are based on the Learning by Doing, where students interactively code, and programming judges automatically assess their codes against testcases. Although the use of students computers is common for both formative and long summative assessments, many short summative assessments (e.g., exams) still rely on institution computers to avoid plagiarism. the number of computers and access to internet necessary for massive courses makes this an inapplicable option for lots of institutions. this works presents OSTIA (Offline System for Testcase Interactive Assessments), a low cost alternative based on the students computers, without requiring internet, but guaranteeing that the assessment is done individually. the system involves a pendrive-based operating system, containing an offline programming judge and testcases. It allows the student to program interactively and assess their codes locally, restricting the access to other resources. the grades are collected using QR codes and an offline mobile app.

关键词： Summative Assessments programming Massive Courses Offline programming Judge Pendrive

来源：评论

学校读者我要写书评

暂无评论

Participatory Coalition Building: Creating an Anti-Racist Scholarly Reviewing Practices Heuristic 21

Participatory Coalition Building: Creating an Anti-Racist Sc...

引用

39th ACM international conference on the Design of Communication: Building Coalitions. Worldwide, SIGDOC 2021

作者： Cagle, Lauren Eble, Michelle Johnson, Meredith Johnson, Nathan R. Lane, Liz McKoy, Temptaous Moore, Kristen R. Reynoso, Enrique Rose, Emma Patterson, Gpat Sanchez, Fernando Simmons, Michele Stone, Erica Chew Kit tham, Jason Walton, Rebecca University of Kentucky United States East Carolina University United States University of South Florida United States University of Memphis United States Bowie State University United States University of Buffalo United States University of Washington Bothell United States Kent State University Tuscarawas United States University of St. Thomas United States Miami University United States Middle Tennessee State University United States Texas Tech University United States Utah State University United States

ISBN: (纸本)9781450386289

this experience report documents the impetus for, process, and result of a coalition of technical and professional communication (TPC) scholars who crafted an anti-racist scholarly reviewing heuristic for editors, reviewers, and authors. In Summer 2020, a coalition of scholars met to respond to calls from Women of Color leaders in the field of TPC for anti-racist action. the coalition engaged in an extended Futures Workshop, a participatory design activity that guided imaginative brainstorming and problem solving which culminated in the development of the heuristic. the heuristic was reviewed by many scholars and iteratively revised before being shared publicly in Spring 2021 on social media platforms, via national listservs, and by professional organizations. this report recounts the specific participatory design practices and activities the coalition employed to create a living and open document that can guide a variety of actors to examine their own practices, with the ultimate goals of intervening in and interrupting bias in reviewing practices. this report demonstrates how enacting participatory values and working in broad coalitions can further anti-racist efforts and generate more inclusive practices and norms for the field of TPC. © 2021 ACM.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

ℬ4: Towards Optimal Assessment of Plausible Code Solutions with Plausible Tests

ℬ4: Towards Optimal Assessment of Plausible Code Solutions ...

引用

IEEE international conference on Automated Software Engineering (ASE)

作者： Mouxiang Chen Zhongxin Liu He Tao Yusu Hong David Lo Xin Xia Jianling Sun The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security Zhejiang University Hangzhou China Singapore Management University Singapore Singapore

ISBN: (数字)9798400712487

ISBN: (纸本)9798331508241

Selecting the best code solution from multiple generated ones is an essential task in code generation, which can be achieved by using some reliable validators (e.g., developer-written test cases) for assistance. Since reliable test cases are not always available and can be expensive to build in practice, researchers propose to automatically generate test cases to assess code solutions. However, when both code solutions and test cases are plausible and not reliable, selecting the best solution becomes challenging. Although some heuristic strategies have been proposed to tackle this problem, they lack a strong theoretical guarantee and it is still an open question whether an optimal selection strategy exists. Our work contributes in two ways. First, we show that within a Bayesian framework, the optimal selection strategy can be defined based on the posterior probability of the observed passing states between solutions and tests. the problem of identifying the best solution is then framed as an integer programming problem. Second, we propose an efficient approach for approximating this optimal (yet uncomputable) strategy, where the approximation error is bounded by the correctness of prior knowledge. We then incorporate effective prior knowledge to tailor code generation tasks. Both theoretical and empirical studies confirm that existing heuristics are limited in selecting the best solutions with plausible test cases. Our proposed approximated optimal strategy ℬ 4 significantly surpasses existing heuristics in selecting code solutions generated by large language models (LLMs) with LLM-generated tests, achieving a relative performance improvement by up to 50% over the strongest heuristic and 246% over the random selection in the most challenging scenarios. Our code is publicly available at https://***/ZJU-CTAG/*** CONCEPTS• Computing methodologies → Artificial intelligence; • Software and its engineering → Software design engineering.

关键词： Integer programming Codes Software design Posterior probability Large language models Computational modeling Reliability theory Software Bayes methods Software engineering

来源：评论

学校读者我要写书评

暂无评论

AlphaForge: A Framework to Mine and Dynamically Combine Formulaic Alpha Factors 39

AlphaForge: A Framework to Mine and Dynamically Combine Form...

引用

39th Annual AAAI conference on Artificial Intelligence, AAAI 2025

作者： Shi, Hao Song, Weili Zhang, Xinting Shi, Jiahe Luo, Cuicui Ao, Xiang Arian, Hamid Seco, Luis Angel School of Computer Science and Technology University of the Chinese Academy of Sciences Beijing China Renaissance Era Investment Management Co. Ltd. Beijing China International College University of the Chinese Academy of Sciences Beijing China Institute of Computing Technology University of Chinese Academy of Sciences Beijing China Financial Development and Credit Management Research Center Hunan University Changsha China CASMINO Ltd. Suzhou China Shangqiu Normal University Shangqiu China York University Toronto Canada University of Toronto Toronto Canada Business School of Hunan University Hunan University Changsha China

ISBN: (纸本)157735897X

the complexity of financial data, characterized by its variability and low signal-to-noise ratio, necessitates advanced methods in quantitative investment that prioritize both performance and *** from early manual extraction to genetic programming, the most advanced approach in the alpha factor mining domain currently employs reinforcement learning to mine a set of combination factors with fixed weights. However, the performance of resultant alpha factors exhibits inconsistency, and the inflexibility of fixed factor weights proves insufficient in adapting to the dynamic nature of financial markets. To address this issue, this paper proposes a two-stage formulaic alpha generating framework AlphaForge, for alpha factor mining and factor combination. this framework employs a generative-predictive neural network to generate factors, leveraging the robust spatial exploration capabilities inherent in deep learning while concurrently preserving diversity. the combination model within the framework incorporates the temporal performance of factors for selection and dynamically adjusts the weights assigned to each component alpha factor. Experiments conducted on real-world datasets demonstrate that our proposed model outperforms contemporary benchmarks in formulaic alpha factor mining. Furthermore, our model exhibits a notable enhancement in portfolio returns within the realm of quantitative investment and real money investment. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Prioritise the Best Variation 41st

Prioritise the Best Variation

引用

41st IFIP WG 6.1 international conference on Formal Techniques for Distributed Objects, Components, and Systems Held as Part of the 16th international Federated conference on Distributed Computing Techniques (DisCoTec)

作者： Kokke, Wen Dardha, Ornela Univ Edinburgh Edinburgh Scotland Univ Glasgow Glasgow Scotland

ISBN: (纸本)9783030780890;9783030780883

Binary session types guarantee communication safety and session fidelity, but alone they cannot rule out deadlocks arising from the interleaving of different sessions. In Classical Processes (CP) [53]-a process calculus based on classical linear logic-deadlock freedom is guaranteed by combining channel creation and parallel composition under the same logical cut rule. Similarly, in Good Variation (GV) [39,54]-a linear concurrent lambda-calculus-deadlock freedom is guaranteed by combining channel creation and thread spawning under the same operation, called fork. In both CP and GV, deadlock freedom is achieved at the expense of expressivity, as the only processes allowed are tree-structured. Dardha and Gay [19] define Priority CP (PCP), which allows cyclic-structured processes and restores deadlock freedom by using priorities, in line with Kobayashi and Padovani [34,44]. Following PCP, we present Priority GV (PGV), a variant of GV which decouples channel creation from thread spawning. Consequently, we type cyclic-structured processes and restore deadlock freedom by using priorities. We show that our type system is sound by proving subject reduction and progress. We define an encoding from PCP to PGV and prove that the encoding preserves typing and is sound and complete with respect to the operational semantics.

关键词： Session types pi-calculus Functional programming Deadlock freedom GV CP

来源：评论

学校读者我要写书评

暂无评论

A General-purpose Parallel and Heterogeneous Task programming System for VLSI CAD 20

A General-purpose Parallel and Heterogeneous Task Programmin...

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Huang, Tsung-Wei Univ Utah Dept ECE Salt Lake City UT 84112 USA

ISBN: (纸本)9781665423243

this paper introduces Taskflow to address the critical question of "How can we make it easier to implement and deploy parallel computer-aided design (CAD) algorithms on large heterogeneous nodes with high performance and simultaneous high productivity?" Parallelizing CAD is an extremely challenging job. Modern CAD applications exhibit unique computational patterns and user requirements that need very strategic decomposition to benefit from parallelism. Taskflow assists researchers and developers in the implementation complexity of parallel algorithms by introducing a new high-level programming model supported by an efficient run-time. By capitalizing on emerging parallelism comprising many-core central processing units (CPUs), graphics processing units (GPUs), and custom accelerators, Taskflow enables CAD to achieve new performance and productivity milestones that were previously out of reach.

关键词： Parallel programming computer-aided design

来源：评论

学校读者我要写书评

暂无评论

2020 39th international conference of the Chilean Computer Science Society, SCCC 2020

2020 39th International Conference of the Chilean Computer S...

引用

39th international conference of the Chilean Computer Science Society, SCCC 2020

ISBN: (纸本)9781728183282

the proceedings contain 82 papers. the topics discussed include: artificial neural network techniques to distinguish children with fetal alcohol spectrum disorder from psychometric data;multi-domain network performance analysis for vehicle tracking in aerial video;COVID-19 transmission during a tsunami evacuation in a lockdown city;data lake architecture proposal for the analysis directorate of a regional university;heuristic function to solve the generalized covering TSP with artificial intelligence search;game-based learning for the appropriation of discrete mathematics concepts: 'hanged on the Moodle platform';fostering engagement and creativity through programming: the beauty and joy of computing in a first-year engineering class;and development effort estimation practices in small software companies: an exploratory study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：