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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

462 篇 期刊文献
280 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

495 篇 工学
- 273 篇 计算机科学与技术...
- 184 篇 软件工程
- 80 篇 核科学与技术
- 64 篇 信息与通信工程
- 52 篇 电子科学与技术（可...
- 37 篇 控制科学与工程
- 34 篇 电气工程
- 33 篇 仪器科学与技术
- 32 篇 机械工程
- 29 篇 生物工程
- 26 篇 化学工程与技术
- 24 篇 动力工程及工程热...
- 23 篇 土木工程
- 19 篇 材料科学与工程（可...
- 16 篇 光学工程
- 15 篇 冶金工程
- 15 篇 航空宇航科学与技...
- 13 篇 建筑学
377 篇 理学
- 229 篇 物理学
- 91 篇 数学
- 49 篇 地球物理学
- 39 篇 生物学
- 32 篇 化学
- 28 篇 统计学（可授理学、...
- 17 篇 系统科学
101 篇 管理学
- 69 篇 管理科学与工程(可...
- 33 篇 图书情报与档案管...
- 20 篇 工商管理
18 篇 医学
- 14 篇 基础医学(可授医学...
- 14 篇 临床医学
5 篇 经济学
5 篇 法学
5 篇 农学
4 篇 教育学
3 篇 文学
1 篇 哲学
1 篇 历史学
1 篇 军事学
1 篇 艺术学

主题

106 篇 hadron colliders
28 篇 w & z bosons
24 篇 higgs bosons
23 篇 computer archite...
17 篇 cms
15 篇 laboratories
15 篇 wireless sensor ...
15 篇 top quark
12 篇 hadron-hadron sc...
12 篇 hypothetical par...
12 篇 relativistic hea...
11 篇 computer science
10 篇 bottom quark
10 篇 convolution
10 篇 cosmic rays
10 篇 computational li...
10 篇 telescopes
9 篇 tau leptons
9 篇 hardware
9 篇 quark & gluon je...

机构

154 篇 centro brasileir...
153 篇 national and kap...
153 篇 istanbul technic...
153 篇 yerevan physics ...
153 篇 charles universi...
152 篇 university of sp...
152 篇 indian institute...
151 篇 universidad iber...
149 篇 brunel universit...
149 篇 rwth aachen univ...
149 篇 university of de...
148 篇 academy of scien...
148 篇 imperial college...
148 篇 department of ph...
144 篇 indian institute...
144 篇 institute for nu...
142 篇 università di to...
142 篇 centro de invest...
141 篇 zhejiang univers...
139 篇 infn sezione di ...

作者

111 篇 g. tonelli
111 篇 d. barney
111 篇 l. valencia palo...
111 篇 t. liu
111 篇 c. hensel
111 篇 a. garcia-bellid...
111 篇 a. steen
111 篇 n. cartiglia
111 篇 n. colino
111 篇 f. moortgat
111 篇 b. clerbaux
111 篇 g. sultanov
111 篇 m. a. ciocci
111 篇 k. lamichhane
110 篇 a. babaev
110 篇 v. karjavine
110 篇 s. maselli
109 篇 e. migliore
109 篇 p. avery
108 篇 l. silvestris

语言

710 篇 英文
19 篇 中文
15 篇 其他

检索条件"机构=Computer Architecture and Languages Laboratory Institute of Computer Science"

共 743 条记录，以下是121-130 订阅

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

详细简洁

排序：

Hy perflow 3

Hy perflow

引用

3rd Conference on Hypercube Concurrent computers and Applications, C3P 1988

作者： DeForest, D. Faustini, A. Lee, R. Declarative Languages and Advanced Architecture Group Department of Computer Science Arizona State University TempeAZ85287 United States Hypercube Group Jet Propulsion Laboratory PasadenaCA91109 United States

In this paper we show how a model of parallel computation called Eduction (tagged demand-driven dataflow) can be implemented on a hypercube. The resulting implementation is called Hyperflow. In addition we will deal w... 详细信息

ISBN: (纸本)0897912780

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

Benchmarking SpMV Methods on Many-Core Platforms 1st

Benchmarking SpMV Methods on Many-Core Platforms

引用

1st International Symposium on Benchmarking, Measuring, and Optimization, Bench 2018

作者： Xie, Biwei Jia, Zhen Bao, Yungang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Department of Computer Science Princeton University Princeton United States University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783030328122

SpMV is an essential kernel existing in many HPC and data center applications. Meanwhile, the emerging many-core hardware provides promising computational power, and is widely used for acceleration. Many methods and formats have been proposed aiming at better performance of SpMV on many-core platforms. However, there is still lack of a comprehensive comparison of SpMV methods to show their performance difference on sparse matrices with various sparse patterns. Moreover, there is still no systematic work to bridge the gap between SpMV performance and sparse pattern. In this paper, we investigate the performance of 27 SpMV methods with 1500+ sparse matrices on two many-core platforms: Intel Xeon Phi (Knights Landing 7250) and Nvidia GPGPU (Tesla M40). Our work shows that no single SpMV methods is optimal for all sparse patterns, but some methods can achieve approximately the best performance on most sparse matrices. We further select 13 features to describe the sparse pattern and analyze their correlations to the performance of each SpMV method. Our observations should help other researchers and practitioners to better understand the SpMV performance and provide implications to guide the selection of suitable SpMV method. © 2019, Springer Nature Switzerland AG.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Diva: A dataflow programming model and its runtime support in java virtual machine

Diva: A dataflow programming model and its runtime support i...

引用

13th IEEE Asia-Pacific computer Systems architecture Conference, ACSAC 2008

作者： Yang, Chen Bin, Fan Lujie, Zhong Chengyong, Wu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Beijing China Graduate School of the Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424426836

Microprocessors have turned to multicore, i.e. multiple processor cores, along with some levels of on-chip caches and interconnection networks, integrated on a singe chip. However, it brings challenges on how to program these processors effectively and efficiently, which is known as the "Programming Wall". This paper proposes a systematic approach to attack the problem. We describe an extension of Java programming language with dataflow paradigm and transactional memory. Our approach alleviates the difficulties of parallel programming by providing a higher level of abstraction and relieving programmers of low-level threading and locking details. We also describe the design of a runtime system to support and optimize for the extension. We have implemented a prototype based on Apache Harmony DRL Virtual Machine. Preliminary experimental results on a 16-core SMP machine show that our approach achieves reasonable scalability and can adapt to the variance of available hardware resources. © 2008 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

PDF-to-Tree: Parsing PDF Text Blocks into a Tree

PDF-to-Tree: Parsing PDF Text Blocks into a Tree

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Zhang, Yue Zhang, Zhihao Lai, Wenbin Zhang, Chong Gui, Tao Zhang, Qi Huang, Xuanjing School of Computer Science Fudan University China Institute of Modern Languages and Linguistics Fudan University China Shanghai Key Laboratory of Intelligent Information Processing Fudan University China

ISBN: (纸本)9798891761681

In many PDF documents, the reading order of text blocks is missing, which can hinder machine understanding of the document's content. Existing works try to extract one universal reading order for a PDF file. However, applications, like Retrieval Augmented Generation (RAG), require breaking long articles into sections, subsections and table cells for better indexing. For this reason, this paper introduces a new task and dataset, PDF-to-Tree, which organizes the text blocks of a PDF into a tree structure. Since a PDF may contain thousands of text blocks, this paper proposes a transition-based parser that uses a greedy strategy to build the tree structure. Compared to the parser for plain text, we also use multi-modal features to encode the parser state. Experiments show that our approach achieves an accuracy of 93.93%, surpassing the performance of baseline methods by an improvement of 6.72%. The dataset is public available at https://***/yuezh000/PDFto-Tree. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

RoTBench: A Multi-Level Benchmark for Evaluating the Robustness of Large Language Models in Tool Learning

RoTBench: A Multi-Level Benchmark for Evaluating the Robustn...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Ye, Junjie Wu, Yilong Gao, Songyang Huang, Caishuang Li, Sixian Li, Guanyu Fan, Xiaoran Zhang, Qi Gui, Tao Huang, Xuanjing School of Computer Science Fudan University China Institute of Modern Languages and Linguistics Fudan University China Shanghai Key Laboratory of Intelligent Information Processing Fudan University China

ISBN: (纸本)9798891761643

Tool learning has generated widespread interest as a vital means of interaction between Large Language Models (LLMs) and the physical world. Current research predominantly emphasizes LLMs' capacity to utilize tools in well-structured environments while overlooking their stability when confronted with the inevitable noise of the real world. To bridge this gap, we introduce RoTBench, a multi-level benchmark for evaluating the robustness of LLMs in tool learning. Specifically, we establish five external environments, each featuring varying levels of noise (i.e., Clean, Slight, Medium, Heavy, and Union), providing an in-depth analysis of the model's resilience across three critical phases: tool selection, parameter identification, and content filling. Experiments involving six widely-used models underscore the urgent necessity for enhancing the robustness of LLMs in tool learning. For instance, the performance of GPT-4 even drops significantly from 80.00 to 58.10 when there is no substantial change in manual accuracy. More surprisingly, the noise correction capability inherent in the GPT family paradoxically impedes its adaptability in the face of mild noise. In light of these findings, we propose RoTTuning, a strategy that enriches the diversity of training environments to bolster the robustness of LLMs in tool learning. The code and data are available at https://***/Junjie-Ye/RoTBench. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A design- for-diagnosis technique for diagnosing both scan chain faults and combinational circuit faults

A design- for-diagnosis technique for diagnosing both scan c...

引用

2008 Asia and South Pacific Design Automation Conference, ASP-DAC

作者： Wang, Fei Hu, Yu Li, Huawei Li, Xiaowei Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Beijing China Graduate University Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424419227

The amount of die area consumed by scan chains and scan control circuit can range from 15%∼30%, and scan chain failures account for almost 50% of chip failures. As the conventional diagnosis process usually runs on the faulty free scan chain, scan chain faults may disable the diagnostic process, leaving large failure area to time-consuming failure analysis. In this paper, a design-for-diagnosis (DFD) technique is proposed to diagnose faulty scan chains precisely and efficiently, moreover, with the assistant of the proposed technique, the conventional logic diagnostic process can be carried on with faulty scan chains. The proposed approach is entirely compatible with conventional scan-based design. Previously proposed software-based diagnostic methods for conventional scan designs can still be applied to our design. Experiments on ISCAS'89 benchmark circuits are conducted to demonstrate the efficiency of the proposed DFD technique. ©2008 IEEE.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

A trimaran based framework for exploring the design space of VLIW ASIPs with coarse grain functional units

A trimaran based framework for exploring the design space of...

引用

15th International Symposium on System Synthesis

作者： Middha, Bhuvan Raj, Varun Gangwar, Anup Kumar, Anshul Balakrishnan, M. Ienne, Paolo Department of Computer Science Indian Institute of Technology Delhi India Processor Architecture Laboratory Swiss Fed. Inst. Technol. Laussane Switzerland

It is widely accepted that use of an Application Specific Instruction Set Processor (ASIP) in an embedded system can provide a solution which is much more flexible than ASICs and much more efficient than standard processors in terms of performance and power consumption. However a lack of an acceptable design methodology and supporting tools for ASIPs limits their use even today. We present in this paper a methodology for design space exploration of high performance VLIW ASIPs by modeling Application Specific Functional Units in Trimaran Compiler Infrastructure. To demonstrate the effectiveness of our strategy we consider two important applications FFT and Kalman Filter and perform compute intensive operations in these applications via special Functional Units. The results we obtain are very promising with up to 2× speed improvement.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Improving Discriminative Capability of Reward Models in RLHF Using Contrastive Learning

Improving Discriminative Capability of Reward Models in RLHF...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Chen, Lu Zheng, Rui Wang, Binghai Jin, Senjie Huang, Caishuang Ye, Junjie Zhang, Zhihao Zhou, Yuhao Xi, Zhiheng Gui, Tao Zhang, Qi Huang, Xuanjing School of Computer Science Fudan University China Institute of Modern Languages and Linguistics Fudan University China Key Laboratory of Intelligent Information Processing Fudan University Shanghai China

ISBN: (纸本)9798891761643

Reinforcement Learning from Human Feedback (RLHF) is a crucial approach to aligning language models with human values and intentions. A fundamental challenge in this method lies in ensuring that the reward model accurately understands and evaluates human preferences. Current methods rely on ranking losses to teach the reward model to assess preferences, but they are susceptible to noise and ambiguous data, often failing to deeply understand human intentions. To address this issue, we introduce contrastive learning into the reward modeling process. In addition to supervised ranking loss, we introduce an unsupervised contrastive loss to enable the reward model to fully capture the distinctions in contrastive data. Experimental results demonstrate that the proposed contrastive learning-based reward modeling method effectively enhances the generalization of the reward model, stabilizes the reinforcement learning training process, and improves the final alignment with human preferences. © 2024 Association for Computational Linguistics.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

LONGAGENT: Achieving Question Answering for 128k-Token-Long Documents through Multi-Agent Collaboration

LONGAGENT: Achieving Question Answering for 128k-Token-Long ...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Zhao, Jun Zu, Can Xu, Hao Lu, Yi He, Wei Ding, Yiwen Gui, Tao Zhang, Qi Huang, Xuanjing School of Computer Science Fudan University China Shanghai Key Laboratory of Intelligent Information Processing Fudan University China Institute of Modern Languages and Linguistics Fudan University China

ISBN: (纸本)9798891761643

Large language models (LLMs) have achieved tremendous success in understanding language and processing text. However, question-answering (QA) on lengthy documents faces challenges of resource constraints and a high propensity for errors, even for the most advanced models such as GPT-4 and Claude2. In this paper, we introduce LONGAGENT, a multi-agent collaboration method that enables efficient and effective QA over 128k-token-long documents. LONGAGENT adopts a divide- and-conquer strategy, breaking down lengthy documents into shorter, more manageable text chunks. A leader agent comprehends the user's query and organizes the member agents to read their assigned chunks, reasoning a final answer through multiple rounds of discussion. Due to members' hallucinations, it's difficult to guarantee that every response provided by each member is accurate. To address this, we develop an inter-member communication mechanism that facilitates information sharing, allowing for the detection and mitigation of hallucinatory responses. Experimental results show that a LLaMA-2 7B driven by LONGAGENT can effectively support QA over 128k-token documents, achieving 16.42% and 1.63% accuracy gains over GPT-4 on single-hop and multi-hop QA settings, respectively. © 2024 Association for Computational Linguistics.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

LFKQG: A Controlled Generation Framework with Local Fine-tuning for Question Generation over Knowledge Bases 29

LFKQG: A Controlled Generation Framework with Local Fine-tun...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Fei, Zichu Zhou, Xin Gui, Tao Zhang, Qi Huang, Xuanjing School of Computer Science Fudan Unviersity China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China Institute of Modern Languages and Linguistics Fudan University Shanghai China

Question generation over knowledge bases (KBQG) aims to generate natural questions about a subgraph that can be answered by a given answer entity. Existing KBQG models still face two main challenges: (1) Most models often focus on the most relevant part of the answer entity, while neglecting the rest of the subgraph. (2) There are a large number of out-of-vocabulary (OOV) predicates in real-world scenarios, which are hard to adapt for most KBQG models. To address these challenges, we propose LFKQG, a controlled generation framework for Question Generation over Knowledge Bases. (1) LFKQG employs a simple controlled generation method to generate the questions containing the critical entities in the subgraph, ensuring the question is relevant to the whole subgraph. (2) We propose an optimization strategy called local fine-tuning, which makes good use of the rich information hidden in the pre-trained model to improve the ability of the model to adapt the OOV predicates. Extensive experiments show that our method outperforms existing methods greatly on three widely-used benchmark datasets SimpleQuestion, PathQuestions, and WebQuestions . © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：