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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,285 篇 会议
365 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

9,684 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,570 篇 工学
- 4,179 篇 计算机科学与技术...
- 2,156 篇 软件工程
- 849 篇 电气工程
- 638 篇 信息与通信工程
- 313 篇 控制科学与工程
- 227 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,073 篇 理学
- 862 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 34 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,212 篇 distributed data...
993 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
779 篇 computer science
695 篇 databases
617 篇 computer archite...
586 篇 application soft...
553 篇 computational mo...
463 篇 parallel process...
369 篇 scalability
358 篇 distributed comp...
352 篇 distributed proc...
327 篇 hardware
325 篇 database systems
294 篇 processor schedu...
294 篇 costs
293 篇 parallel program...
291 篇 resource managem...
269 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
13 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop
9 篇 cameron kirk w.

语言

9,632 篇 英文
31 篇 其他
21 篇 中文

检索条件"任意字段=International Symposium on Databases in Parallel and Distributed Systems"

共 9684 条记录，以下是571-580 订阅

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

详细简洁

排序：

Power Microservices Troubleshooting by Pretrained Language Model with Multi-source Data

Power Microservices Troubleshooting by Pretrained Language M...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Shuai Ding Yifei Xu Zhuang Lu Fan Tang Tong Li Jingguo Ge Key Laboratory of Cyberspace Security Defense Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Information Center of Aier Eye Hospital China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Microservice has become the mainstream paradigm for developing cloud-native applications, but the intricate interdependencies between microservices and the vast amount of heterogeneous observable data (i.e. metrics, logs and traces) pose challenges for rapid troubleshooting. Several anomaly detection and root cause localization approaches that integrate multi-source data have been proposed. However, they are plagued with issues such as scarcity of high-quality data and insufficient model generalization. This is particularly evident when domain-specific models are trained from scratch for specific tasks. Recently, Large Language Models (LLMs) have shown outstanding capabilities in time series analysis, due to multi-source data generated by distributed microservices exhibit intrinsic spatio-temporal characteristics. In view of this, we propose LLM4MST, an LLM-empowered microservice troubleshooting model. We first unify and represent multi-source data by extracting service invocation graphs, and model dependencies between microservices by using a message-passing based graph neural network to generate graph-level sequences. The graph-level representation is then aligned with the LLM, and the LLM is fine-tuned to capture complex spatio-temporal patterns, generating a global vector that represents the state of microservice system within a timeslot. LLM4MST achieves accurate anomaly detection and root cause localization by jointly training the end-to-end model. Experiments on real datasets show that LLM4MST exhibits excellent performance in both full-sample and few-shot scenarios, demonstrating the powerful ability of LLMs in cross-domain knowledge transfer and few-shot learning.

关键词： Location awareness Accuracy Large language models Microservice architectures distributed databases Data models Graph neural networks Few shot learning Knowledge transfer Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

DCF: A Dynamic Caching Framework for Compute Nodes on Disaggregated Memory

DCF: A Dynamic Caching Framework for Compute Nodes on Disagg...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Qinzhen Cao Jibo Liu Xiaowen Nie Rui Xi University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Disaggregated memory architectures can achieve higher resource utilization rates, and independently scale CPUs and memory. In such architectures, all compute nodes share access to a memory pool, meaning any node can read or write data from any location in the cluster. To avoid maintaining cache coherency among different compute nodes, existing disaggregated memory systems choose to read and write data remotely over the network. The cost of this approach is that compute nodes need to consume a network round-trip time to read remote data, resulting in poorer performance under read-intensive workloads and wasting the limited cache of the compute nodes. In this paper, we propose DCF, a dynamic caching framework for distributed systems on disaggregated memory. First, DCF makes use of the cache areas of compute nodes, and for a piece of data, a two-level caching strategy - index cache and value cache is adopted. Secondly, in order to maintain strong consistency among different compute nodes, DCF cleverly embeds cache metadata into the remote index of data, thus avoiding extra remote access and work of memory pool CPU. Thirdly, DCF uses a computation-centric dynamic load-determination framework to estimate the global load of data, and chooses a caching policy suitable for the current workload based on the estimation results. Our assessment shows that DCF can achieve high performance under various types of workloads (read/write-dominated, uniform/skewed), further demonstrating that DCF can effectively handle dynamic workload changes and support elasticity.

关键词： distributed processing Costs Memory architecture Estimation Metadata Elasticity Resource management Indexes Optimization

来源：评论

学校读者我要写书评

暂无评论

Private Information Retrieval Using Circulant Permutation Matrices or the Zero Matrix

Private Information Retrieval Using Circulant Permutation Ma...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Su, Yi-Sheng Natl Chung Cheng Univ Dept Commun Engn Chiayi Taiwan

ISBN: (纸本)9781538682098

Private information retrieval (PIR) protocols allow a user to retrieve entries of a database without revealing the index of the desired item. Information-theoretical privacy can be achieved by the use of several servers and specific retrieval algorithms. In this paper, we investigate the problem of PIR under erasure-coded distributed storage systems and construct PIR protocols with optimal computational complexity for the servers, reasonable communication complexity, and low storage overhead. The proposed constructions also enjoy the advantages of low encoding complexity and low memory requirement for storing all possible queries for the user. More specifically, we concentrate on the study of using circulant permutation matrices or the zero matrix to construct PIR protocols for non-communicating servers.

关键词： Privacy Data privacy Protocols Memory management distributed databases Resists Information retrieval

来源：评论

学校读者我要写书评

暂无评论

The main aspects of creating a system of data mining on the status of patients with Parkinson's disease 14

The main aspects of creating a system of data mining on the ...

引用

14th international symposium on Intelligent systems

作者： Shichkina, Yulia Irishina, Yulia Stanevich, Elizaveta Plasencia Salgueiro, Armando de Jesus St Petersburg Electrotech Univ LETI Ul Prof Popova 5 St Petersburg 197376 Russia Russian Acad Sci NP Bechtereva Inst Human Brain Ul Acad Pavlova 9b St Petersburg 197376 Russia Inst Cybernet Math & Phys Calle 15 551 Havana 10400 Cuba

This article describes an approach to the collection and preprocessing of data received from mobile phones for the purpose of their further processing by data mining methods, in particular using neural networks. This is a comprehensive work that was carried out using graph theory methods;parallel computing, set theory, databases, fuzzy logic methods and neural networks, mobile application design methods. The most important results of this work, which are presented in this article, are developed methods for accelerating data processing in relational and NoSQL databases, the architecture of a system for monitoring the status of patients with Parkinson's disease using mobile technologies;modules for a mobile phone for collecting patient status data;and modules based on neural networks for classifying the status of patients with Parkinson's disease. (C) 2021 The Authors. Published by Elsevier B.V.

关键词： Parkinson's disease mobile medicine databases parallel computing queries optimization query execution time data consolidation data restructuring mobile devices patient condition monitoring neural networks fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Architectures for distributed Big Data Analytics

Fault-Tolerant Architectures for Distributed Big Data Analyt...

引用

Advances in Computer Science, Electrical, Electronics, and Communication Technologies (CE2CT), international Conference on

作者： Sunil Sudhakaran Samarth Shah Manas Kumar Mishra Vignesh Natarajan Jay Bhatt Om Goel Mahatma Gandhi University Kottayam Kerala India University at Albany Albany NY USA Department of Computer Science and Engineering G.L. Bajaj Institute of Technology and Management Greater Noida India Arizona State University AZ United States Northeastem University Boston MA USA ABES Engineering College Ghaziabad U.P. India

ISBN: (数字)9798331518578

ISBN: (纸本)9798331518585

It has created challenges in the processing of data and analysis, which need to go beyond the traditional centralized architecture to solve the current data volume, speed, and types. To address these challenges, fault-tolerant architectures have become one of the keys to meeting the needs of distributed big data analytics. Failure is a normal part of systems; these architectures are meant to accommodate failures of individual components so that the entire system does not need to stop working or, worse, give false results. They make use of several nodes to operate and retain data in a distributed fashion, which supplies excessive scalability and fault tolerance. This means that even if some nodes fail, a fault-tolerant architecture can still provide redundancy by replicating data across many nodes, giving the system redundancy. Fault-tolerant architectures also utilize efficient data processing techniques like partitioning and data parallel processing, to achieve high performance. This allows real-time and near-real-time analysis of streaming data.

关键词： Scalability Fault tolerant systems Redundancy distributed databases Computer architecture Big Data Data processing Real-time systems Complexity theory Physical design

来源：评论

学校读者我要写书评

暂无评论

OneShot: View-Adapting Streamlined BFT Protocols with Trusted Execution Environments

OneShot: View-Adapting Streamlined BFT Protocols with Truste...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Jérémie Decouchant David Kozhaya Vincent Rahli Jiangshan Yu TU Delft Delft The Netherlands ABB Research Zurich Switzerland University of Birmingham Birmingham UK University of Sydney Sydney Australia

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

Byzantine fault-tolerance is arguably an expensive characteristic for protocols to support, especially when considering its overhead on message complexity, number of communication phases, and number of nodes for resilience. Various works in the literature have addressed optimizing one or more of these dimensions through the use of algorithmic optimizations, trusted execution environments, and streamlined view *** best achievable message complexity, resilience, and latency to date are respectively linear complexity, by ⌊(N − 1)/2⌋, and two communication phases attained Damysus (EuroSys’22), a streamlined hybrid protocol. This paper strictly advances the aforementioned state of the art results by introducing OneShot, a streamlined hybrid protocol that uses one communication phase in the normal case, and one or two phases otherwise. OneShot exploits the information nodes receive about the system to dynamically modify and adapt views. We prove that OneShot is safe and live, and moreover demonstrate through experimental evaluation that it improves throughput and latency by respectively up to 150% and 59% compared to the state of the art.

关键词： Fault tolerance distributed processing Protocols Fault tolerant systems Throughput Complexity theory Proposals

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2022 10th international symposium on Computing and Networking Workshops, CANDARW 2022

Proceedings - 2022 10th International Symposium on Computing...

引用

10th international symposium on Computing and Networking Workshops, CANDARW 2022

ISBN: (纸本)9781665475327

The proceedings contain 72 papers. The topics discussed include: causality-aware metadata propagation scheme for federated social network servers;a portable time synchronization method using eBPF;an evacuation system using autonomous clustering-based MANET for sharing disaster information;ALR switching and routing strategy for multiple sites based on traffic splitting method for power saving;measurement of pH in the cow’s rumen for high- quality dairy product;delivery routing to reduce calculation load of drones on divided logistics areas for drone logistics networks;construction of hierarchical matrix on distributed memory systems using a task parallel language;communication size reduction of federated learning based on neural ODE model;accelerating next generation genome sequencing leveraging high bandwidth memory on FPGAs;and a packet routing using lightweight reinforcement learning based on online sequential learning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OSN Rumor Control Model Based on Community Immunization

OSN Rumor Control Model Based on Community Immunization

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Ming Dong Zhiqiang Sun Zhenhua Tan Bin Zhang School of Computer Science and Engineering Northeastern University Shenyang China Software College Northeastern University Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Northeastern University Shenyang China Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University) Ministry of Education China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

This paper proposes a rumor control model based on community immunization. Based on the community division and the trust network inference algorithm, the model redefines the standard to measure the importance of nodes in the network. First, the model uses the Louvain clustering algorithm based on the Ochiai coefficient to discover the network community and then presents the trust network inference algorithm. By analyzing the key factors that affect trust transfer between nodes, the trust evaluation between unfamiliar nodes is inferred, and important nodes with a high degree of trust in the network community are calculated. Finally, combined with the characteristics of inner degree and outer degree centrality of nodes in the network community, five types of important nodes in the network are screened out. To avoid repeated selection of nodes, this paper identifies a group of key nodes in the network community for local immunization by means of deduplication and taking intersection, so as to realize effective control of rumors in the network.

关键词： distributed processing Clustering algorithms Inference algorithms Standards Open data

来源：评论

学校读者我要写书评

暂无评论

LBCB: One-sided RDMA-based distributed B+ tree Index with Low Bandwidth Consumption

LBCB: One-sided RDMA-based Distributed B+ tree Index with Lo...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Jibo Liu Rui Xi Qinzhen Cao Xiaowen Nie Zhuohan Hou University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Disaggregated memory architecture segregates computing and memory resources into distinct pools interconnected by a high-speed one-sided RDMA (Remote Direct Memory Access) network, enhancing memory utilization, reducing costs, and facilitating elastic scaling of computing and memory resources. However, optimizing index structures to maximize the benefits of this framework poses significant challenges. Despite progress in B+ tree indexes for disaggregated memory systems, they still suffer from severe write and read amplification issues, which impede latency and throughput *** this paper, we propose LBCB, a B+ tree index for disaggregated memory, which significantly reduces the bandwidth consumption of index operations. First, LBCB introduces an RDMA friendly B+ tree leaf node structure, which improves concurrency while reducing the bandwidth consumption. Second, LBCB designs a logical fusion FAA lock that synchronizes more information with a single RDMA communication, significantly reducing the number of RDMA network round trips. Finally, LBCB optimistically compresses the critical path of index operations, further optimizing latency and throughput. Evaluation results show that compared with the state-of-the-art distributed B+ tree index, the write performance of LBCB is improved by 1.42 times.

关键词： Concurrent computing Memory management Memory architecture Bandwidth Writing Throughput Indexes Synchronization Logic Indexing

来源：评论

学校读者我要写书评

暂无评论

Adaptive MPI collective operations based on evaluations in LogP model 14

Adaptive MPI collective operations based on evaluations in L...

引用

14th international symposium on Intelligent systems

作者： Paznikov, A. A. Kupriyanov, M. S. St Petersburg Electrotech Univ LETI Ul Prof Popov 5 St Petersburg 197376 Russia

Message passing model, represented by MPI (Message Passing Interface), is the principal parallel programming tool for distributed computer systems. The most of MPI-programs contain collective communications, which involve all the processes of a parallel program. Effectiveness of collective communications substantially effects on total time of program execution. In this work, we consider the problem of design of adaptive algorithms of collective communications on the example of barrier synchronization, which refers to one of the most common types of collective communications. We developed adaptive algorithm of barrier synchronization, which suboptimally selects barrier synchronization scheme in parallel MPI-programs among such algorithms as Central Counter, Combining Tree and Dissemination Barrier. The adaptive algorithm chooses the barrier algorithm with the minimal evaluation of execution time in the model LogP. Model LogP considers performance of computational resources and interconnect for point-to-point communications. Proposed algorithm has been implemented for MPI. We present the results of experiments on cluster systems, analyse dependency of algorithm selection on LogP parameters values. In particular, for the number of processes less than 20 adaptive algorithm selects Combining Tree, while for a larger number of processes adaptive algorithm selects Dissemination Barrier. Developed algorithm minimizes average time of barrier synchronization by 4%, in comparison with the most common determined barrier algorithms. (C) 2021 The Authors. Published by Elsevier B.V.

关键词： Collectives collective communications barrier barrier synchronization distributed computer systems LogP MPI parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 54 55 56 57 58 59 60 61 62 63 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：