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

1st International workshop on AI for Research, AI4Research 2024 and 4th International workshop on Democracy and AI, DemocrAI 2024, held in conjunction with 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024

作者： Lee, Jungmin Shin, Huigon Yoo, YoungJoon Choi, Jongwon Kim, Mi Song Department of Advanced Imaging GSAIM Chung-Ang University Seoul Korea Republic of Computer Programming and Analysis School of Information Technology Fanshawe College London Canada Department of Artificial Intelligence Chung-Ang University Seoul Korea Republic of Curriculum Studies Western University London Canada

ISBN: (纸本)9789819795352

Multimodal learning analytics have become increasingly important in enabling a deeper understanding of teaching and learning in educational research. However, in comparison to other multimodal learning data, there is a limited understanding of the trends within gaze learning data. To address this challenge, this study aims to identify latent topics in gaze learning data through topic modeling and scientometric analysis. We analyzed the abstracts of 573 peer-reviewed and conference proceeding papers that used gaze learning data, written in English, and published between 2008 and February 2024. The findings are as follows. First, three main topics were identified through topic modeling analysis: (learning analytics, multimodal learning, and inclusive learning). Second, the scientometric analysis revealed the structure in which diverse clusters in cited references and institutions are connected around the emerging topics. Based on these findings, the study would provide insights into research directions in both educational research and applications using gaze learning data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A blockchain-oriented covert communication technology with controlled security level based on addressing confusion ciphertext

引用

Frontiers of Computer Science 2025年第2期19卷 133-135页

作者： Lejun ZHANG Bo ZHANG Ran GUO Zhujun WANG Guopeng WANG Jing QIU Shen SU Yuan LIU Guangxia XU Zhihong TIAN Sergey GATAULLIN Cyberspace Institute Advanced Technology Guangzhou UniversityGuangzhou 510006China Research and Development Center for E-Learning Ministry of EducationBeijing 100039China College of Information Engineering Yangzhou UniversityYangzhou 225009China School Math and Computer Science Quanzhou Normal UniversityQuanzhou 362000China Pazhou Lab Guangzhou 510330China School of Physics and Materials Science Guangzhou UniversityGuangzhou 510006China Central Economic and Mathematics Institute Russian Academy of SciencesMoscow 117418Russia Industrial Programming Department MIREA-Russian Technological UniversityMoscow 119454Russia

1 Introduction Traditional covert communication[1]usually relies on centralized channels,which are efficient in transmission but susceptible to eavesdropping and attacks,leading to information ***,distributed methods also exist,such as peer-to-peer networks and distributed hash *** technology,which is decentralized,anonymous,non-tamperable and anti-attack,can be applied to covert communication to solve the problems of traditional methods and improve the quality of communication.

关键词： communication tables networks

来源：评论

学校读者我要写书评

暂无评论

Construction and optimization of a parallel engine for answer set programming

引用

3rd International Symposium on Practical Aspects of Declarative Languages, PADL 2001

作者： Pontelli, Enrico El-Khatib, Omar Laboratory for Logic DBs and Advanced Programming Department of Computer Science New Mexico State University United States

ISBN: (纸本)9783540417682

In this paper we study the use of parallelism to speed up execution of Answer Set Programs (ASP). ASP is an emerging programming paradigm which combines features from constraint programming, logic programming, and non-monotonic reasoning, and has found relevant applications in areas such as planning and intelligent agents. We propose different methodologies to parallelize execution of ASP programs, and we describe a prototype which exploits one form of parallelism. © Springer-Verlag Berlin Heidelberg 2001

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Algorithm 38: Telescope 2

引用

Communications of the ACM 1961年第3期4卷 151-152页

作者： Brons K.A. RCA Advanced Programming Pennsauken NJ United States

来源：评论

学校读者我要写书评

暂无评论

Practical approach to object modeling for large, complex applications

Practical approach to object modeling for large, complex app...

引用

Proceedings of the 1997 IEEE National Aerospace and Electronics Conference, NAECON. Part 1 (of 2)

作者： Porter, Jon Deer, Barry Howard, Mary Ellen Ferguson, Christi McCarty, Rich Advanced Programming Inst Inc Wright-Patterson AFB United States

Object-oriented (OO) software development techniques have gained in popularity as an attractive alternative to the traditional, structured development approach. Fundamental to the OO approach is the object, which bundles data with associated operations in a self-contained unit. The inherently modular object provides an excellent mechanism for creating reusable, stable, and easily maintainable code. In this paper, we present an introduction to OO development;discuss the challenges of large, complex systems;and document the procedures we developed to meet these challenges for our project.

关键词： Avionics

来源：评论

学校读者我要写书评

暂无评论

Data parallel logic programming in &ACE

Data parallel logic programming in &ACE

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： E. Pontelli G. Gupta Laboratory for Logic Databases and Advanced Programming New Mexico State University USA

&ACE is a high performance parallel Prolog system developed at the Laboratory for Logic, Databases, and advanced programming that exploits and-parallelism from Prolog programs. &ACE was developed to exploit MIMD parallelism. However, SPMD parallelism also arises naturally in many Prolog programs. In this paper we develop runtime techniques that allow systems that have primarily been designed to exploit MIMD parallelism (such as &ACE) to also efficiently exploit SPMD parallelism. These runtime techniques have been incorporated in the &ACE system. Performance of &ACE augmented with these techniques on programs containing SPMD parallelism is presented.

关键词： Logic programming Runtime Parallel processing Program processors programming profession Artificial intelligence Laboratories Databases Parallel programming Sun

来源：评论

学校读者我要写书评

暂无评论

Cyclical oscillations and absorbing-state probabilities in optional public goods games: Interplay of reward and group size

引用

Physical Review E 2025年第1期111卷 014138-014138页

作者： Eduardo V. Stock Pablo Valverde Juan Carlos González-Avella José Roberto Iglesias Sebastian Gonçalves Roberto da Silva Instituto de Física Universidade Federal do Rio Grande do Sul Caixa Postal 15051 91501-970 Porto Alegre RS Brazil Pontificia Universidad Católica del Ecuador Facultad de Ciencias Exactas y Naturales Quito 170525 Ecuador Institute for Cross-Disciplinary Physics and Complex Systems UIB-CSIC Palma de Mallorca 07122 Spain Advanced Programming Solutions SL Palma de Mallorca 07120 Spain Instituto Nacional de Ciência e Tecnologia de Sistemas Complexos CBPF Rio de Janeiro 22290-180 RJ Brazil

The optional public goods game (OPGG) is a three-strategy model in which individuals can cooperate, defect, or not participate. Despite its simplicity, this model effectively captures various social dilemmas, including those involving public services, environmental sustainability, and broader societal issues. In this study, we investigate how the reward (r) and group size of potential players (S) of public goods games influence the steady-state coexistence of these strategies or the alternation of their dominance in a rock-paper-scissors dynamic. The OPGG is simulated using Monte Carlo in a nonspatial scenario, meaning there is no topology connecting the agents, allowing any player to interact with any other player. We show that under sufficiently noisy conditions, the system consistently evolves to an absorbing state, with the prevailing strategy determined by the values of r and S. In the range 2≤r≤S, the system shows multiple stable absorbing states, with groups of size S=4 exhibiting more pronounced and transient rock-paper-scissors dynamics with longer average absorbing times. We present a thorough analysis of our results in terms of the fraction of time the system spends in rock-paper-scissor cycles, the number of cycles, and the average probability that the system relaxes to each possible absorbing state, including scenarios where the system does not reach an absorbing state at all.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT COMPUTATION OF RIGHT CONTEXT FOR LR-BASED ERROR REPAIR

引用

INFORMATION PROCESSING LETTERS 1994年第2期49卷 63-71页

作者： JUNG, MS CHOE, KM HAN, T Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusong-Gu Taejon 305-701 South Korea

The left context in LR-based parsing is the sequence of states in the parsing stack. The right context is the vocabulary strings to appear for a given left context. We propose an efficient method of computing right context for LR-based syntax error repair. The efficiency of our method is achieved from removing some redundancies in the method of previous work.

关键词： COMPILERS LR PARSING SYNTAX ERROR REPAIR KERNEL ITEM RIGHT CONTEXT

来源：评论

学校读者我要写书评

暂无评论

STATIC FILTERING ON STRATIFIED PROGRAMS

引用

INFORMATION PROCESSING LETTERS 1993年第5期47卷 237-244页

作者： CHANG, BM CHOE, KM HAN, TS Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-dong Yusung-ku Taejon 305-701 South Korea

We extend static filtering in [8], a query optimization strategy based on seminaive evaluation on system graphs, so that it can efficiently handle stratified programs without extra overhead. The computation of static filters is formalized as a transformation so that the least fixed point of the transformation can be the static filters. The static filtering on stratified programs is shown to be complete with respect to the iterated fixed point semantics.

关键词： APPLICATIVE (LOGIC) programming STRATIFIED PROGRAMS QUERY OPTIMIZATION STATIC FILTERING SYSTEM GRAPHS

来源：评论

学校读者我要写书评

暂无评论

SYNTACTIC ERROR REPAIR USING REPAIR PATTERNS

引用

INFORMATION PROCESSING LETTERS 1993年第4期47卷 189-196页

作者： YUN, IS CHOE, KM HAN, T Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusung-Cu Taejon 305-701 South Korea

A syntactic error repair model is proposed, and is defined as a partial function from strings to sentences. The replacement of a substring of a string with a substring of a sentence is described by a repair pattern, which is roughly a pair of strings of grammar symbols. The model can be efficient with some restriction on repair patterns. An LR-based implementation of the model is discussed.

关键词： COMPILERS SYNTACTIC ERROR RECOVERY SYNTACTIC ERROR REPAIR MODEL REPAIR PATTERN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：