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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,823 篇 会议
185 篇 期刊文献
83 册 图书

馆藏范围

4,091 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,097 篇 工学
- 1,912 篇 计算机科学与技术...
- 1,024 篇 软件工程
- 369 篇 电气工程
- 153 篇 信息与通信工程
- 137 篇 电子科学与技术（可...
- 76 篇 控制科学与工程
- 30 篇 机械工程
- 30 篇 生物工程
- 24 篇 材料科学与工程（可...
- 24 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 20 篇 光学工程
- 19 篇 建筑学
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 13 篇 动力工程及工程热...
- 12 篇 农业工程
526 篇 理学
- 417 篇 数学
- 50 篇 物理学
- 39 篇 系统科学
- 33 篇 生物学
- 30 篇 统计学（可授理学、...
- 16 篇 化学
- 16 篇 地球物理学
207 篇 管理学
- 154 篇 管理科学与工程(可...
- 61 篇 工商管理
- 54 篇 图书情报与档案管...
19 篇 农学
- 14 篇 作物学
18 篇 法学
- 18 篇 社会学
15 篇 经济学
- 15 篇 应用经济学
13 篇 医学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学
1 篇 哲学

主题

653 篇 parallel process...
545 篇 parallel program...
530 篇 computer archite...
463 篇 parallel archite...
448 篇 concurrent compu...
360 篇 parallel algorit...
322 篇 programming
316 篇 hardware
285 篇 computer science
276 篇 algorithm design...
263 篇 computational mo...
214 篇 programming prof...
166 篇 parallel process...
165 篇 dynamic programm...
154 篇 application soft...
138 篇 program processo...
138 篇 costs
137 篇 distributed comp...
136 篇 libraries
133 篇 runtime

机构

9 篇 stanford univ st...
9 篇 intel corporatio...
8 篇 barcelona superc...
8 篇 oak ridge natl l...
8 篇 univ calif berke...
7 篇 school of comput...
7 篇 oak ridge nation...
7 篇 carnegie mellon ...
7 篇 college of compu...
7 篇 oak ridge nation...
7 篇 univ texas austi...
6 篇 school of comput...
6 篇 sandia national ...
6 篇 department of co...
6 篇 department of co...
6 篇 school of comput...
6 篇 department of co...
5 篇 department of co...
5 篇 nvidia corporati...
5 篇 pacific northwes...

作者

15 篇 jack dongarra
12 篇 dongarra jack
11 篇 hong shen
10 篇 hoefler torsten
9 篇 zhong cheng
9 篇 olukotun kunle
9 篇 gu yan
8 篇 chapman barbara
7 篇 garcia i.
7 篇 forsell martti
7 篇 sun yihan
7 篇 jigang wu
7 篇 nakano koji
7 篇 danelutto marco
6 篇 cheng zhong
6 篇 v.k. prasanna
6 篇 blelloch guy e.
6 篇 h.j. siegel
6 篇 lumsdaine andrew
6 篇 tsigas philippas

语言

4,038 篇 英文
45 篇 其他
13 篇 中文

检索条件"任意字段=International Symposium on Parallel Architectures, Algorithms, and Programming"

共 4091 条记录，以下是141-150 订阅

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

详细简洁

排序：

Fake news detection method based on multi-feature fusion of entity and structured text

Fake news detection method based on multi-feature fusion of ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Tianqi Ren Ke Ji Zhenxiang Chen Runyuan Sun Kun Ma Jin Zhou School of Information Science and Engineering University of Jinan Jinan China

ISBN: (纸本)9781665452199

Internet technology has facilitated the development of social media, which has become the main way for people to get news. The low cost of information generation has allowed unconfirmed fake news to be noticed and reposted, which can easily cause social and economic harm. Much of the existing research on fake news detection has focused solely on the accuracy of detection, but has neglected the time efficiency of detection. We propose a fake news detection method called MFEAST, which simplifies article content and speeds up model training by extracting key information from articles. Compared with existing real fake news detection methods, our method substantially reduces the training time and achieves high detection accuracy.

关键词： Training Costs Text recognition Social networking (online) Text categorization programming parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Comparative Study on Data Sovereignty Guarantee Technology

Comparative Study on Data Sovereignty Guarantee Technology

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Yaodong Tao Shuai Yang Hongmei Ge Industrial Internet Security Research Center/Director Shenyang Ligong University School of Information Science and Engineering Beijing Jiaotong University Beijing China School of Information Science and Engineering Shenyang Ligong University Shenyang China Xingyuan Certification Center Co. Ltd Beijing China

ISBN: (纸本)9781665452199

As an economic commodity, data sharing, circulation and trading can not only reduce the maintenance and management costs of enterprises, but also tap the potential value of data, improve the internal workflow of enterprises and the cooperation among enterprises. The marketization of data elements and the clarification of data sovereignty are the current difficulties hindering data flow. This paper addresses one of the current data circulation issues: how to maintain data sovereignty, and makes exploration and research in combination with the current era background. For the current research projects and products, compare and analyze the techniques used to maintain data sovereignty. Finally, based on the current technology, it gives recommendations for the future development of data sovereignty protection technology.

关键词： Costs Data security programming Maintenance engineering parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A HeteSim-Measured algorithm fused semantic features in heterogeneous social networks

A HeteSim-Measured algorithm fused semantic features in hete...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Ping He Shiyi Wang Huaying Qi College of Information Technology Hebei University of Economics and Business Shijiazhuang Hebei China

ISBN: (纸本)9781665452199

The construction of heterogeneous social networks enables the major social platforms in the network to connect through social information. In order to ensure network security and improve downstream tasks such as user profile, knowledge graph construction and recommendation, the relevance measurement between social information has attracted extensive attention in recent years. Although HeteSim algorithm has achieved good results in measuring the relevance between heterogeneous nodes, this method only focuses on the structure features between nodes, and fails to comprehensively consider the joint impact of structure features and semantic features. Therefore, this paper proposes HeteSim-Measured algorithm that considers the fusion of structure features and semantic features for improving the accuracy of relevance measurement. The experiment is verified by measuring the relevance based on meta-path on the datasets and comparing with HeteSim algorithm.

关键词： Knowledge engineering Social networking (online) Semantics programming Network security parallel architectures Task analysis

来源：评论

学校读者我要写书评

暂无评论

Passivity-Based Finite-Time Consensus for Nonlinear Fractional-Order Multi-Agent Systems

Passivity-Based Finite-Time Consensus for Nonlinear Fraction...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Zeng-Ran Zhang Jin-Liang Wang Chen-Guang Liu Jigang Wu Yan-Li Huang School of Software Tiangong University Tianjin China School of Computer Science and Technology Tiangong University Tianjin China Institute of Artificial Intelligence Beihang University Beijing China School of Computer Guangdong University of Technology Guangzhou China

ISBN: (纸本)9781665452199

This paper utilizes the finite-time passivity (FTP) to settle the finite-time consensus (FTC) problem for a class of nonlinear fractional-order multi-agent systems (FOMASs). By selecting appropriate state feedback controller, a FTP criterion for FOMAS is derived on the basis of inequality techniques, and a sufficient condition to ensure FOMAS can achieve FTC is also given by exploiting the FTP result. Moreover, to testify the validity of the FTP and FTC criteria, a numerical example is presented.

关键词： Sufficient conditions State feedback programming parallel architectures Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

GraphIt to CUDA Compiler in 2021 LOC: A Case for High-Performance DSL Implementation via Staging with Bui1DSL 22

GraphIt to CUDA Compiler in 2021 LOC: A Case for High-Perfor...

引用

20th IEEE/ACM international symposium on Code Generation and Optimization (CGO)

作者： Brahmakshatriya, Ajay Amarasinghe, Saman MIT CSAIL Cambridge MA 02139 USA

ISBN: (纸本)9781665405843

Domain-Specific Languages (DSLs) provide the optimum balance between generalization and specialization that is crucial to getting the best performance for a particular domain. DSLs like Halide and GraphIt and their rich scheduling languages allow users to generate an implementation best suited for the algorithm and input. DSLs also provide the right abstraction for generating code for diverse architectures like GPUs, CPUs, and hardware accelerators. DSL compilers are massive, typically spanning tens of thousands of lines of code and need a frontend, some analysis and transformation passes, and target-specific code generation. These implementations usually require a great deal of compiler knowledge and domain experts cannot prototype DSLs without getting compiler experts involved. Using multi-stage programming in a high-level language like Scala, OCaml, or C++, is a great solution because it provides easy-to-use frontend and automatic code generation abilities. The DSL writers typically implement their abstraction as a library in the multi-stage programming language and use it to generate specialized code by providing partial inputs. This solves the problem only partially because DSLs like GraphIt have shown that several domain-specific analyses and transformations need to be performed to get the best performance. Special care has to be taken when targeting massively parallel architectures like GPUs where factors like load balancing, warp divergence, coalesced memory accesses play a critical role. In this paper, we demonstrate how to build an end-to-end DSL compiler framework and a graph DSL using multi-stage programming in C++. We show how the staged types can be extended to perform domain-specific data flow and control flow analyses and transformations. We also show how our generated CUDA code matches the performance of the code generated from the state-of-the-art graph DSL, GraphIt. We achieve all this in a very small fraction (8.4 %) of the code size required to

关键词： domain-specific-languages code-generation multi-stage programming data-flow analysis

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Charger Placement and Power Scheduling for On-Demand Provisioning of RF Wireless Charging Service 21st

Simultaneous Charger Placement and Power Scheduling for On-D...

引用

21st international Conference on algorithms and architectures for parallel Processing (ICA3PP)

作者： Jiang, Huatong Li, Yanjun Gao, Meihui Zhejiang Univ Technol Sch Comp Sci & Technol Hangzhou Peoples R China

ISBN: (纸本)9783030953881;9783030953874

To provision on-demand radio frequency (RF) charging service in a designated place, the problem of simultaneous charger placement and power scheduling is studied. Based on users' historic spatial and temporal distribution information, we formulate the problem as how to place a given number of chargers and how to adjust the chargers' power levels in each time interval so that the revenue of the charging service can be maximized, given the total power limitation constraint. The formulated problem is a mixed integer linear programming (MILP) problem and we propose a branch and bound (B&B) algorithm to solve it. Extensive simulations in both small-scale and large-scale networks, as well as simulations based on the real data set are conducted to validate the effectiveness of our proposed algorithm. The results show that, our proposed algorithm outperforms greedy algorithm, an algorithm that deals charger placement and power scheduling separately, in most of the simulation scenarios, and reaches the optimum in small-scale instances.

关键词： RF charging Charger placement Power scheduling Mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Fully-adaptive Model for Broadcasting with Universal Lists 24

Fully-adaptive Model for Broadcasting with Universal Lists

引用

24th international symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Gholami, Saber Harutyunyan, Hovhannes A. Concordia Univ Dept Comp Sci & Software Engn Montreal PQ Canada

ISBN: (纸本)9781665465458

In classical broadcasting, a piece of information must be transmitted to all entities of a network as quickly as possible, starting from a particular member. Since this problem has an enormous number of applications and is proven to be NP-Hard, several models are defined in the literature while trying to simulate real-world situations and relax several constraints. A well-known branch of broadcasting utilizes a universal list throughout the process. That is, once a vertex is informed, it must follow its corresponding list, regardless of the originator and the neighbor it received the message. The problem of broadcasting with universal lists could be categorized into two sub-models: non-adaptive and adaptive. In the latter model, a sender will skip the vertices on its list from which it has received the message, while those vertices will not be skipped in the first model. In this study, we will present another sub-model called fully adaptive. Not only does this model benefit from a significantly better space complexity compared to the classical model, but, as will be proved, it is faster than the two other sub-models. Since the suggested model fits real-world network architectures, we will design optimal broadcast algorithms for well-known interconnection networks such as trees, grids, and cube-connected cycles under the fully-adaptive model. We also present a tight upper bound for tori under the same model.

关键词： parallel algorithms graph theory broadcasting universal lists fully-adaptive

来源：评论

学校读者我要写书评

暂无评论

Mitigating Anomalies in parallel Branch-and-Bound Based algorithms for Mixed-Integer Nonlinear Optimization 7th

Mitigating Anomalies in Parallel Branch-and-Bound Based Algo...

引用

7th international symposium on Combinatorial Optimization (ISCO)

作者： Palkar, Prashant Mahajan, Ashutosh Univ Augsburg Inst Math D-86159 Augsburg Germany Indian Inst Technol Ind Engn & Operat Res Mumbai 400076 India

ISBN: (纸本)9783031185298;9783031185304

We address detrimental anomalies in parallel versions of two state-of-the-art algorithms for convex mixed-integer nonlinear programs (MINLPs): nonlinear branch-and-bound (NLP-BB) and the LP/NLP based branch-and-bound (QG). A detrimental anomaly is when a parallel algorithm performs worse than its sequential counterpart. Unambiguous node selection functions have been developed in the past to avoid these anomalies. We extend this notion of unambiguity to subroutines for branching and generating linearization cuts. We implement the proposed unambiguous branching and cut generation strategies alongside unambiguous node selection in NLP-BB and QG in the open-source MINLP solver Minotaur. Our computational experiments on convex instances from the MINLPLib library show that detrimental anomalies can be reduced to a great extent in practical algorithms. We also compare these algorithms with opportunistic parallel versions. Our results highlight that opportunistic versions perform better in terms of wall clock times, while the deterministic versions avoid detrimental anomalies with theoretically established guarantees and also provide reproducible results, a feature that is desirable while developing parallel algorithms. We recommend settings in Minotaur that yield opportunistic or deterministic runs for the parallel NLP-BB and QG algorithms.

关键词： Mixed-integer nonlinear programming parallel branch-and-bound Anomalies LP/NLP based branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

parallel and Incremental Verification of Hybrid Automata with Ray and Verse 21st

Parallel and Incremental Verification of Hybrid Automata wit...

引用

21st international symposium on Automated Technology for Verification and Analysis

作者： Zhu, Haoqing Li, Yangge Shen, Keyi Mitra, Sayan Univ Illinois Coordinated Sci Lab Champaign IL 61820 USA

ISBN: (纸本)9783031453281;9783031453298

parallel and distributed computing holds a promise of scaling verification to hard multi-agent scenarios such as the ones involving autonomous interacting vehicles. Exploiting parallelism, however, typically requires handcrafting solutions using knowledge of verification algorithms, the available hardware, and the specific models. The Ray framework made parallel programming hardware agnostic for large-scale Python workloads in machine learning. Extending the recently developed Verse Python library for multi-agent hybrid systems, in this paper we show how Ray's fork-join parallelization can help gain up to 6x speedup in multi-agent hybrid model verification. We propose a parallel algorithm that addresses the key bottleneck of computing the discrete transitions and exploits concurrent construction of reachability trees, without locks, using dynamic Ray processes. We find that the performance gains of our new reachset and simulation algorithms increase with the availability of larger number of cores and the nondeterminism in the model. In one experiment with 20 agents and 399 transitions, reachability analysis using the parallel algorithm takes 35 min on a 8 core CPU, which is a 6.28x speedup over the sequential algorithm. We also present an incremental verification algorithm that reuses previously cached computations and compare its performance.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

Computation Augmentation Techniques for Computing Continuum

Computation Augmentation Techniques for Computing Continuum

引用

Cluster, Cloud and Internet Computing Workshops (CCGridW), IEEE/ACM international symposium on

作者： George-Mircea Grosu Silvia-Elena Nistor Radu-Ioan Ciobanu Joanna Kolodziej Florin Pop National University of Science and Technology Politehnica Bucharest Romania NASK Warsaw and Cracow University of Technology Poland Department of Computer Sciences Cracow University of Technology Cracow Poland National Institute for Research and Development in Informatics (ICI) Bucharest Romania Academy of Romanian Scientists Bucharest Romania

ISBN: (数字)9798350377514

ISBN: (纸本)9798350377521

We are witnessing a tremendous expansion in computational power, leading to monumental technological advances with various practical applications. The need for parallelism originated from the limitations of single-processing performance. Increasing the transistor density on integrated circuits was the way to go, thus creating faster and more complex monolithic processors. However, these circuits approached their limits of hardware expansion, so the single-processor model has become unreliable and insufficient overall. This is how multicore architectures were born and, with them, the notion of parallel computing. Our research background in the Drop Computing paradigm and Interest in studying parallel programming paradigms encouraged us to propose a new approach towards parallel processing in mobile, ad-hoc, opportunistic networks. This paper adapts one fundamental message-passing standard for parallel architectures within the Drop Computing context. We define a new library DroMPI. Besides the challenges of parallel programming, the solution has to address the challenges imposed by hardware constraints, limited resources, and the decentralized model specific to Drop Computing.

关键词： Program processors parallel programming Multicore processing Computational modeling parallel processing Hardware Libraries Transistors Integrated circuit modeling Standards

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共410页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：