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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,314 篇 会议
152 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

3,284 篇 工学
- 3,130 篇 计算机科学与技术...
- 1,641 篇 软件工程
- 413 篇 信息与通信工程
- 373 篇 电气工程
- 223 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 34 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
807 篇 理学
- 672 篇 数学
- 129 篇 统计学（可授理学、...
- 65 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 171 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

373 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
107 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
62 篇 computer network...
61 篇 concurrent compu...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
50 篇 algorithms
49 篇 application soft...
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
41 篇 high performance...

机构

48 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
12 篇 univ toronto on
12 篇 georgia inst tec...
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,414 篇 英文
54 篇 其他
4 篇 中文

检索条件"任意字段=Proceedings of the ACM Symposium on Principles of Distributed Computing"

共 4472 条记录，以下是361-370 订阅

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

详细简洁

排序：

Emotional Design and User Study on Guidance System For MR distributed Collaboration 10

Emotional Design and User Study on Guidance System For MR Di...

引用

Joint Meeting of the 10th International symposium of Chinese CHI (Chinese CHI) / International Workshop on Human-Engaged computing (IWHEC)

作者： Liang, Xiaozhan Hu, Yong Li, Chuchen Beihang Univ Sch New Media Art & Design Beijing Peoples R China Beihang Univ Yunnan Innovat Inst Beijing Peoples R China Beihang Univ State Key Lab Virtual Real Technol & Syst Beijing Peoples R China

ISBN: (纸本)9781450398695

In recent years, especially after the outbreak of COVID-19, the applications of distributed collaboration in mixed reality (MR) environment has developed rapidly. Due to the cutting-edge technology and the specialized nature of the equipment, many studies have focused on the design of tutorials in MR, but few studies have taken the factors of emotional design into consideration. Since the perception of the state among users is based on their avatar firstly, which is helpful for users' perceptions about collaborative content in novice guidance. Based on Norman's principles of reflective design and James' theory about the experience self, we built a MR virtual sandtable collaboration system, which contains three guiding parts that are the full practice of theoretical research. Furthermore, We generated three progressive levels of emotional solutions in guidance design and conducted user experience research to explore the impact of three different degrees of emotional design, summarizing the applicable paradigm of novice guidance of emotional design in MR distributed collaborative scenarios. Through the evaluation and analysis of SUS model and task load, we found that novice guidance with a higher emotional design level, which combines static graphics, dynamic hand models and conversational voice would result in a better user experience.

关键词： Human-centered computing Interaction design Interaction design theory Concepts and paradigms

来源：评论

学校读者我要写书评

暂无评论

A Software-Defined Overlay Networking Middleware for a Simplified Deployment of distributed Application at the Edge 25

A Software-Defined Overlay Networking Middleware for a Simpl...

引用

40th Annual acm symposium on Applied computing, SAC 2025

作者： Bornholdt, Heiko Röbert, Kevin Schulte, Stefan Edinger, Janick Fischer, Mathias University of Hamburg Hamburg Germany Hamburg University of Technology Hamburg Germany

ISBN: (纸本)9798400706295

The demand for low latency, bandwidth efficiency, and privacy has driven distributed applications to the network edge, where heterogeneous, and untrusted, and uncontrolled networks pose challenges. This paper presents a software-defined overlay networking (SDON) middleware that simplifies application development through centralized control of edge resources while addressing many challenges prevalent at the edge. SDON enables applications to specify high-level requirements, such as service placement and communication goals. These are automatically translated into device-specific configurations and deployed on appropriate edge resources. The middleware is implemented as fully functional software, published as open-source, and will be evaluated in multiple edge computing use cases, to demonstrate its application optimization potential. Copyright © 2025 held by the owner/author(s).

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

PGPregel: An End-to-End System for Privacy-Preserving Graph Processing in Geo-distributed Data Centers 13

PGPregel: An End-to-End System for Privacy-Preserving Graph ...

引用

13th Annual acm symposium on Cloud computing (SoCC)

作者： Zhou, Amelie Chi Qiu, Ruibo Lambert, Thomas Allard, Tristan Ibrahim, Shadi El Abbadi, Amr Shenzhen Univ Shenzhen Peoples R China Univ Lorraine CNRS INRIA LORIA Nancy France Univ Rennes IRISA CNRS Rennes France Univ Rennes IRISA CNRS INRIA Rennes France UC Santa Barbara Santa Barbara CA USA

ISBN: (纸本)9781450394147

Graph processing is a popular computing model for big data analytics. Emerging big data applications are often maintained in multiple geographically distributed (geo-distributed) data centers (DCs) to provide low-latency services to global users. Graph processing in geo-distributed DCs suffers from costly inter-DC data communications. Furthermore, due to increasing privacy concerns, geo-distribution imposes diverse, strict, and often asymmetric privacy regulations that constrain geo-distributed graph processing. Existing graph processing systems fail to address these two challenges. In this paper, we design and implement PGPregel, which is an end-to-end system that provides privacy-preserving graph processing in geo-distributed DCs with low latency and high utility. To ensure privacy, PGPregel smartly integrates Differential Privacy into graph processing systems with the help of two core techniques, namely sampling and combiners, to reduce the amount of inter-DC data transfer while preserving good accuracy of graph processing results. We implement our design in Giraph and evaluate it in real cloud DCs. Results show that PGPregel can preserve the privacy of graph data with low overhead and good accuracy.

关键词： Data Analytics

来源：评论

学校读者我要写书评

暂无评论

Accelerating Static Null Pointer Dereference Detection with Parallel computing 15

Accelerating Static Null Pointer Dereference Detection with ...

引用

15th Asia-Pacific symposium on Internetware (Internetware)

作者： Xu, Rulin Chen, Luohui Zhang, Ruyi Zhang, Yuanliang Xiao, Wei Zhou, Haifang Mao, Xiaoguang Natl Univ Def Technol Coll Comp Changsha Peoples R China Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha Peoples R China

ISBN: (纸本)9798400707056

High-precision static analysis can effectively detect Null Pointer Dereference (NPD) vulnerabilities in C language, but the performance overhead is significant. In recent years, researchers have attempted to enhance the efficiency of static analysis by leveraging multicore resources. However, due to complex dependencies in the analysis process, the parallelization of static value-flow NPD analysis for large-scale software still faces significant challenges. It is difficult to achieve a good balance between detection efficiency and accuracy, which impacts its *** paper presents PANDA, the first parallel detector for high-precision static value-flow NPD analyzer in the C language. The core idea of PANDA is to utilize dependency analysis to ensure high precision while decoupling the strong dependencies between static value-flow analysis steps. This transforms the traditionally challenging-to-parallelize NPD analysis into two parallelizable algorithms: function summarization and combined query-based vulnerability analysis. PANDA introduces a task-level parallel framework and enhances it with a dynamic scheduling method to parallel schedule the above two key steps, significantly improving the performance and scalability of memory vulnerability *** implemented within the LLVM framework (version 15.0.7), PANDA demonstrates a significant advantage in balancing accuracy and efficiency compared to current popular open-source detection tools. In precision-targeted benchmark tests, PANDA maintains a false positive rate within 3.17% and a false negative rate within 5.16%;in historical CVE detection rate tests, its recall rate far exceeds that of comparative open-source tools. In performance evaluations, compared to its serial version, PANDA achieves up to an 11.23-fold speedup on a 16-node server, exhibiting outstanding scalability.

关键词： Static Analysis Parallel computing Value Flow Analysis NPD Detection

来源：评论

学校读者我要写书评

暂无评论

Reaching Consensus for Asynchronous distributed Key Generation 21

Reaching Consensus for Asynchronous Distributed Key Generati...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Abraham, Ittai Jovanovic, Philipp Maller, Mary Meiklejohn, Sarah Stern, Gilad Tomescu, Alin VMware Res Herzliyya Israel UCL London England Ethereum Fdn London England Google London England Hebrew Univ Jerusalem Jerusalem Israel VMware Res Palo Alto CA USA

We give a protocol for Asynchronous distributed Key Generation (A-DKG) that is optimally resilient (can withstand f (n(3)) expected communication complexity, and assumes only the existence of a PKI. Prior to our work,... 详细信息

ISBN: (纸本)9781450385480

We give a protocol for Asynchronous distributed Key Generation (A-DKG) that is optimally resilient (can withstand f < n/3 sfaulty parties), has a constant expected number of rounds, has <(O)over tilde>(n(3)) expected communication complexity, and assumes only the existence of a PKI. Prior to our work, the best A-DKG protocols required Omega (n) expected number of rounds, and Q (n(4)) expected communication. Our A-DKG protocol relies on several building blocks that are of independent interest. We define and design a Proposal Election (PE) protocol that allows parties to retrospectively agree on a valid proposal after enough proposals have been sent from different parties. With constant probability the elected proposal was proposed by a nonfaulty party. In building our PE protocol, we design a Verifiable Gather protocol which allows parties to communicate which proposals they have and have not seen in a verifiable manner. The final building block to our A-DKG is a Validated Asynchronous Byzantine Agreement (VABA) protocol. We use our PE protocol to construct a VABA protocol that does not require leaders or an asynchronous DKG setup. Our VABA protocol can be used more generally when it is not possible to use threshold signatures.

关键词： distributed algorithms cryptographic protocols Byzantine fault tolerance distributed key generation consensus leader election

来源：评论

学校读者我要写书评

暂无评论

Solving Sequential Greedy Problems distributedly with Sub-Logarithmic Energy Cost 25

Solving Sequential Greedy Problems Distributedly with Sub-Lo...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Alkida Balliu Pierre Fraigniaud Dennis Olivetti Mikaël Rabie Gran Sasso Science Institute L'Aquila Italy IRIF CNRS Université Paris Cité Paris France

ISBN: (纸本)9798400718854

We study the awake complexity of graph problems that belong to the class O-LOCAL, which includes a subset of problems solvable by sequential greedy algorithms, such as (Δ + 1)-coloring and maximal independent set. It is known from previous work that, in n-node graphs of maximum degree Δ, any problem in the class O-LOCAL can be solved by a deterministic distributed algorithm with awake complexity O (log Δ + log* n).In this paper, we show that any problem belonging to the class O-LOCAL can be solved by a deterministic distributed algorithm with awake complexity [EQUATION]. This leads to a polynomial improvement over the state of the art when [EQUATION], e.g., Δ = n∊ for some arbitrarily small ∊ > 0. The key ingredient for achieving our results is the computation of a network decomposition that uses a small-enough number of colors in sub-logarithmic time in the Sleeping model, which can be of independent interest.

关键词： distributed graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Building scalable and evolutive USD pipelines on distributed architecture at Ubisoft

Building scalable and evolutive USD pipelines on distributed...

引用

2022 Digital Production symposium, DigiPro 2022

作者： Rahgoshay, Cyrus Bernardi, Alessandro Cho, Jaeeun Mazzier, Anthony De Lillo, Robin Aubame, Adeline Ubisoft Montreal Canada

ISBN: (纸本)9781450394185

This paper presents how we built scalable and evolutive USD pipelines on distributed architecture at Ubisoft. We use BPMN as a nodal representation to allow our supervisors to build new or modify existing workflows. Our processes are designed using industry standards and USD file format for interchangeability and are easily scalable and ready to deploy to our multi-site studios and teams. Using Microservices running on our internal cloud computing infrastructure and their language-neutrality, we can leverage existing in-house and new technologies developed on multiple platforms by our teams worldwide. © 2022 acm.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Managing Project Teams in an Online Class of 1000+ Students 56

Managing Project Teams in an Online Class of 1000+ Students

引用

56th Annual SIGCSE Technical symposium on Computer Science Education, SIGCSE TS 2025

作者： Anaraki, Nazanin Tabatabaei Ng, Taneisha Verma, Gaurav Fu, Yu Hull, Matthew Routray, Susanta Roozbahani, Max Mahdi Chau, Duen Horng Georgia Institute of Technology Atlanta GA United States

ISBN: (纸本)9798400705328

Team projects in Computer Science (CS) help students build collaboration skills, apply theory, and prepare for real-world software development. Online classes present unique opportunities to transform the accessibility of CS education at scale. Still, the geographical distribution of students and staff adds complexity to forming effective teams, providing consistent feedback, and facilitating peer interactions. We discuss our approach of managing, evaluating, and providing constructive feedback to over 200 project teams, comprising 1000+ graduate students distributed globally, two professors, and 25+ teaching assistants. We deployed and iteratively refined this approach over 10 years while offering the Data and Visual Analytics course (CSE 6242) at Georgia Institute of Technology. Our approach and insights can help others striving to make CS education accessible, especially in online and large-scale settings. © 2025 Copyright held by the owner/author(s).

关键词： computing education data visualization projects large online classes

来源：评论

学校读者我要写书评

暂无评论

Modeling Interfering Sources in Shared Queues for Timely Computations in Edge computing Systems 24

Modeling Interfering Sources in Shared Queues for Timely Com...

引用

2024 International symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile computing, MobiHoc 2024

作者： Akar, Nail Bastopcu, Melih Ulukus, Sennur Başar, Tamer Bilkent University Bilkent Ankara Turkey University of Maryland College ParkMD United States University of Illinois Urbana-ChampaignIL United States

ISBN: (纸本)9798400705212

Most existing stochastic models on age of information (AoI) focus on a single shared server serving status update packets from N > 1 sources where each packet update stream is Poisson, i.e., single-hop scenario. In the current work, we study a two-hop edge computing system for which status updates from the information sources are still Poisson but they are not immediately available at the shared edge server, but instead they need to first receive service from a transmission server dedicated to each source. For exponentially distributed and heterogeneous service times for both the dedicated servers and the edge server, and bufferless preemptive resource management, we develop an analytical model using absorbing Markov chains (AMC) for obtaining the distribution of AoI for any source in the system. Moreover, for a given tagged source, the traffic arriving at the shared server from the N − 1 un-tagged sources, namely the interference traffic, is not Poisson any more, but is instead a Markov modulated Poisson process (MMPP) whose state space grows exponentially with N. Therefore, we propose to employ a model reduction technique that approximates the behavior of the MMPP interference traffic with two states only, making it possible to approximately obtain the AoI statistics even for a very large number of sources. Numerical examples are presented to validate the proposed exact and approximate models. © 2024 Copyright held by the owner/author(s).

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

distributed Randomness from Approximate Agreement 36

Distributed Randomness from Approximate Agreement

引用

36th International symposium on distributed computing, DISC 2022

作者： Freitas, Luciano Kuznetsov, Petr Tonkikh, Andrei LTCI Télécom Paris Institut Polytechnique de Paris France

ISBN: (纸本)9783959772556

Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to be particularly useful. We observe, however, that it is impossible to implement a truly random common coin protocol in a fault-prone asynchronous system. To circumvent this impossibility, we introduce two relaxations of the perfect common coin: (1) approximate common coin generating random numbers that are close to each other;and (2) Monte Carlo common coin generating a common random number with an arbitrarily small, but non-zero, probability of failure. Building atop the approximate agreement primitive, we obtain efficient asynchronous implementations of the two abstractions, tolerating up to one third of Byzantine processes. Our protocols do not assume trusted setup or public key infrastructure and converge to the perfect coin exponentially fast in the protocol running time. By plugging one of our protocols for Monte Carlo common coin in a well-known consensus algorithm, we manage to get a binary Byzantine agreement protocol with O(n3 log n) communication complexity, resilient against an adaptive adversary, and tolerating the optimal number f 4). We also show how the approximate common coin, combined with a variant of Gray code, can be used to solve an interesting problem of Intersecting Random Subsets, which we introduce in this paper. © Luciano Freitas, Petr Kuznetsov, and Andrei Tonkikh.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：