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

WORKSHOP - APPLICATION OF LOGIC PROGRAMMING IN GENETIC SEQUENCE-ANALYSIS

引用

new generation COMPUTING 1992年第3期10卷 329-333页

作者： TANAKA, H 1. Institute for New Generation Computer Technology Tokyo Japan

来源：评论

学校读者我要写书评

暂无评论

Service Migration for Delay-Sensitive IoT Applications in Edge Networks

引用

IEEE Transactions on Services Computing 2025年

作者： Li, Xiaocui Zhou, Zhangbing Wang, Yasha Deng, Shuiguang Hung, Patrick C. K. School of Information Engineering Beijing100083 China Peking University National Research & Engineering Center of Software Engineering Beijing100871 China Peking University New Generation Information Technology Research Institute Tianjin300380 China School of Information Engineering Frontiers Science Center for Deep-Time Digital Earth Beijing100083 China Institut Polytechnique de Paris Télécom SudParis Palaiseau91120 France Zhejiang University College of Computer Science and Technology Hangzhou310012 China Ontario Tech University Faculty of Business and Information Technology Oshawa Canada

The proliferation of Internet of Things (IoT) applications prompts extraordinary demands for the collaboration of large amounts of computational resources provided by IoT devices in edge networks, and these applications are mostly delay-sensitive. Generally, these resources are encapsulated as IoT services. Thereafter, IoT applications can be performed, such that the collaboration of their sub-tasks is achieved through the composition of functionally complementary and geographically contiguous IoT services. The status of computational resources in IoT devices may change continuously along with their occupancy and release by IoT services. Considering the resource-scarceness of IoT devices, when the workload of IoT devices increases due to more services to be processed, certain IoT devices may hardly have enough remaining resources to co-host more instances of certain IoT services prescribed by forthcoming IoT applications with strict constraints. As a result, the delay satisfaction of both on-running and forthcoming IoT applications may be negatively impacted, or even hardly be satisfied any longer. To solve this issue, this paper proposes a rEsource-Efficient service Configuration (E2rC) mechanism, which aims to optimize the configuration of computational resources provided by IoT devices with respect to complex requirements prescribed by IoT applications, through service migration techniques. This service migration problem is formulated as markov multi-phases decisions, which is solved through our enhanced Deep Reinforcement Learning (DRL) approach with a two-layer Q-network. Extensive experiments have been conducted upon the dataset of our testbed system. Evaluation results show that our E2rC is more efficient than the state-of-art counterparts in satisfying delay constraints of IoT applications, while reducing the energy consumption and improving the resource utilization efficiency of IoT devices. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

EXTRACTION OF REDUNDANCY-FREE PROGRAMS FROM CONSTRUCTIVE NATURAL DEDUCTION PROOFS

引用

JOURNAL OF SYMBOLIC COMPUTATION 1991年第1期12卷 29-69页

作者： TAKAYAMA, Y Institute for New Generation Computer Technology 4-28 Mita 1-chome Minato-ku Tokyo 108 Japan

Executable codes can be extracted from constructive proofs by using realizability interpretation. However, realizability also generates redundant codes that have no significant computational meaning. This redundancy causes heavy runtime overheads and is one of the obstacles in applying realizability to practical systems that realize the mathematical programming paradigm. This paper presents a method to eliminate redundancy by analysing proof trees as preprocessing of realizability interpretation. According to the declaration given to the theorem that is proved, each node of the proof tree is marked automatically to show which part of the realizer is needed. This procedure does not always work well. This paper also gives an analysis of the procedure and techniques to resolve critical cases. The method is studied in simple constructive logic with primitive types, mathematical induction and its q -realizability interpretation. As an example, the extraction of a prime number checker program is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unveiling factuality and injecting knowledge for LLMs via reinforcement learning and data proportion

引用

Science China(Information Sciences) 2024年第10期67卷 389-390页

作者： Wenjun KE Ziyu SHANG Zhizhao LUO Peng WANG Yikai GUO Qi LIU Yuxuan CHEN School of Computer Science and Engineering Southeast University Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications(Southeast University) Beijing Institute of Technology Zhuhai Beijing Institute of Computer Technology and Application

Large language models(LLMs) have demonstrated remarkable effectiveness across various natural language processing(NLP) tasks, as evidenced by recent studies [1, 2]. However, these models often produce responses that conflict with reality due to the unreliable distribution of facts within their training data, which is particularly critical for applications requiring high credibility and accuracy [3].

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new EXTERNAL REFERENCE MANAGEMENT AND DISTRIBUTED UNIFICATION FOR KL1

引用

new generation COMPUTING 1990年第2-3期7卷 159-177页

作者： ICHIYOSHI, N ROKUSAWA, K NAKAJIMA, K INAMURA, Y 1. Institute for New Generation Computer Technology 4-28 Mita 1-chome Minato-ku 108 Tokyo Japan

This paper describes a new external reference management scheme for KL1, a committed choice logic programming language based on GHC. The significance of the new scheme is that it realizes incremental inter-processor garbage collection. Previous distributed implementations of committed choice languages had not seriously addressed inter-processor garbage collection. Incremental inter-precessor garbage collection is realized by the Weighted Export Counting (WEC). It is a first attempt to use the weighted reference counting technique in logic programming language implementation, and is also new in that it has introduced export and import tables for making independent local garbage collection possible and reducing the number of inter-processor read requests. The problems with exhaustion of reference counts and indirect exportation are discussed. Since the binding order rule adopted in our previous implementation for avoiding creation of reference loops is insufficient in the presence of indirect exportation, a new binding order rule is introduced. We prove that avoidance of reference loops is guaranteed and also prove that the unification procedure always terminates for non-circular structures.

关键词： Loosely-coupled Multiprocessor Concurrent Logic Language Implementation Inter-processor Garbage Collection Weighted Export Counting Distributed Unification

来源：评论

学校读者我要写书评

暂无评论

Towards Inductive Learning of Jazz Harmony Theory 18

Towards Inductive Learning of Jazz Harmony Theory

引用

18th International computer Music Conference, ICMC 1992

作者： Hirata, Keiji Aoyagi, Tatsuya Institute for New Generation Computer Technology Japan University of Electro-Communication Japan

Musical theory is dynamic in nature;that is, it changes with time, genre, artist, and location. For machines to able to handle such musical theory, musical theory should be regarded as static and, then, be represented symbolically. However, it seems inefficient to formalize all musical theories. We think that inductive learning is quite effective in overcoming this difficulty. Since many inductive learning systems have been developed recently, it is promising to apply them to the learning of musical theory. This paper presents a system which inductively learns jazz harmony theory. The input data is the real fingering patterns of chords and chord sequences as actually played by a jazz pianist. The output is Horn clauses which represent the way in which input chords and chord sequences are played. In the system, notes, chords and chord sequences are represented as predicates. Therefore, first-order Horn clauses that include such predicates can express the relationships between notes, chords and chord sequences, that is, the harmony theory. Our system employs an inductive learning method based on inverting resolution, C1GOL;its primitive operations are absorption, intra-construction and truncation. This paper shows how to apply these primitive operations to the input data and how to derive the output. The absorption operation gives the reasoning of a musical concept by using the reasoning from other musical concepts. The intra-construction operation invents new musical concepts. Eventually, the output Horn clauses tell us the musical structure of the input chords and the chord sequences, and, even, the thinking process of a jazz pianist. © ICMC 1992. All Rights Reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

DESIGN OF THE KERNEL LANGUAGE FOR THE PARALLEL INFERENCE MACHINE

引用

computer JOURNAL 1990年第6期33卷 494-500页

作者： UEDA, K CHIKAYAMA, T Institute for New Generation Computer Technology Mita Kokusai building 21F 4-28 Mita 1-chome Minato-ku Tokyo 108 Japan

We review the design of the concurrent logic language GHC, the basis of the kernel language for the Parallel Inference Machine being developed in the Japanese Fifth generation computer Systems project, and the design of the parallel language KL1, the actual kernel language being implemented and used. The key idea in the design of these languages is the separation of concurrency and parallelism. Clarification of concepts of this kind seems to play an important role in bridging the gap between parallel inference systems and knowledge information processing in a coherent manner. In particular, design of a new kernel language has always encouraged us to re-examine and reorganise various existing notions related to programming and to invent new ones.

关键词： computer Programming Languages

来源：评论

学校读者我要写书评

暂无评论

Decoupled Doubly Contrastive Learning for Cross Domain Facial Action Unit Detection

arXiv

引用

arXiv 2025年

作者： Li, Yong Liu, Menglin Cui, Zhen Ding, Yi Zong, Yuan Zheng, Wenming Shan, Shiguang Guan, Cuntai School of Computer Science and Engineering The Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Nanjing210096 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China School of Artificial Intelligence Beijing Normal University Beijing100875 China Key Laboratory of AI Safety Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China School of Computer Science and Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Key Laboratory of Child Development and Learning Science of Ministry of Education School of Biological Science and Medical Engineering Nanjing210096 China

Despite the impressive performance of current vision-based facial action unit (AU) detection approaches, they are heavily susceptible to the variations across different domains and the cross-domain AU detection methods are under-explored. In response to this challenge, we propose a decoupled doubly contrastive adaptation (D2CA) approach to learn a purified AU representation that is semantically aligned for the source and target domains. Specifically, we decompose latent representations into AU-relevant and AU-irrelevant components, with the objective of exclusively facilitating adaptation within the AU-relevant subspace. To achieve the feature decoupling, D2CA is trained to disentangle AU and domain factors by assessing the quality of synthesized faces in cross-domain scenarios when either AU or domain attributes are modified. To further strengthen feature decoupling, particularly in scenarios with limited AU data diversity, D2CA employs a doubly contrastive learning mechanism comprising image and feature-level contrastive learning to ensure the quality of synthesized faces and mitigate feature ambiguities. This new framework leads to an automatically learned, dedicated separation of AU-relevant and domain-relevant factors, and it enables intuitive, scale-specific control of the cross-domain facial image synthesis. Extensive experiments demonstrate the efficacy of D2CA in successfully decoupling AU and domain factors, yielding visually pleasing cross-domain synthesized facial images. Meanwhile, D2CA consistently outperforms state-of-the-art cross-domain AU detection approaches, achieving an average F1 score improvement of 6%-14% across various cross-domain scenarios. © 2025, CC BY-NC-SA.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A'UM - A STREAM-BASED CONCURRENT OBJECT-ORIENTED LANGUAGE

引用

new generation COMPUTING 1990年第2-3期7卷 127-157页

作者： YOSHIDA, K CHIKAYAMA, T 1. ICOT Research Center Institute for New Generation Computer Technology 1-4-28 Mita Minato-ku 108 Tokyo Japan

This paper presents a computation model and its programming language,A’UM,* as a result of our pursuit of high parallelism and high expressivity for the development of a large scale software. By basing it on streams and integrating it with objects and relations,A’UM realizes an elegant model, natural representation and efficient execution, all at once, that have never been done by any other approaches.

关键词： Concurrent Programming Language Stream Object-oriented

来源：评论

学校读者我要写书评

暂无评论

A SELF-APPLICABLE PARTIAL EVALUATOR AND ITS USE IN INCREMENTAL COMPILATION

引用

new generation COMPUTING 1988年第2-3期6卷 91-118页

作者： FUJITA, H FURUKAWA, K 1. ICOT Research Center Institute for New Generation Computer Technology 1-4-28 Mita Minato-ku 108 Tokyo Japan

This paper presents an experimental implementation of a self-applicable partial evaluator in Prolog used for compiler generation and compiler generator generation. The partial evaluator is an extension of a simple meta interpreter for Prolog programs, and its self-application is straightforward because of its simplicity. A method of incremental compilation is also described as a promising application of the partial evaluator for knowledge-based systems.

关键词： Partial Evaluation Self-Application Logic Programming Meta Programming Compilation Compiler Compiler Generator Incremental Compilation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：