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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,652 篇 会议
199 篇 期刊文献
163 册 图书
16 篇 学位论文

馆藏范围

3,031 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,628 篇 工学
- 1,478 篇 计算机科学与技术...
- 1,076 篇 软件工程
- 157 篇 电气工程
- 126 篇 信息与通信工程
- 84 篇 控制科学与工程
- 31 篇 电子科学与技术（可...
- 25 篇 建筑学
- 23 篇 机械工程
- 20 篇 生物工程
- 19 篇 土木工程
- 17 篇 仪器科学与技术
- 15 篇 材料科学与工程（可...
- 13 篇 化学工程与技术
- 12 篇 交通运输工程
- 12 篇 网络空间安全
- 9 篇 安全科学与工程
- 8 篇 动力工程及工程热...
288 篇 理学
- 211 篇 数学
- 29 篇 系统科学
- 27 篇 物理学
- 25 篇 生物学
- 21 篇 统计学（可授理学、...
- 17 篇 化学
187 篇 管理学
- 107 篇 管理科学与工程(可...
- 92 篇 图书情报与档案管...
- 44 篇 工商管理
23 篇 教育学
- 23 篇 教育学
12 篇 法学
- 9 篇 社会学
11 篇 经济学
- 10 篇 应用经济学
8 篇 医学
- 8 篇 临床医学
6 篇 农学
2 篇 军事学
2 篇 艺术学

主题

457 篇 distributed comp...
415 篇 computer languag...
341 篇 concurrent compu...
265 篇 parallel program...
249 篇 application soft...
240 篇 programming prof...
218 篇 computer science
173 篇 object oriented ...
167 篇 computer archite...
166 篇 computer program...
164 篇 object oriented ...
157 篇 parallel process...
156 篇 computational mo...
131 篇 software enginee...
131 篇 java
128 篇 programming
116 篇 hardware
110 篇 operating system...
98 篇 message passing
97 篇 computer network...

机构

9 篇 department of co...
8 篇 department of co...
6 篇 vienna universit...
6 篇 carnegie mellon ...
5 篇 univ florence di...
5 篇 tech univ darmst...
5 篇 department of co...
5 篇 stanford univers...
5 篇 irisa/inria renn...
5 篇 politecn milan m...
5 篇 barcelona superc...
5 篇 school of comput...
4 篇 inria
4 篇 georgia inst tec...
4 篇 ibm thomas j. wa...
4 篇 department of co...
4 篇 institute of dis...
4 篇 department of co...
4 篇 inria rocquencou...
4 篇 monash universit...

作者

15 篇 viroli mirko
13 篇 sarkar vivek
12 篇 j. kramer
11 篇 de meuter wolfga...
9 篇 casadei roberto
7 篇 dustdar schahram
7 篇 badia rosa m.
7 篇 talia domenico
7 篇 j. magee
7 篇 audrito giorgio
7 篇 de nicola rocco
6 篇 damiani ferrucci...
6 篇 chen haibo
6 篇 anon
6 篇 hayashi akihiro
6 篇 d'hondt theo
5 篇 d. watkins
5 篇 agha gul
5 篇 lumsdaine andrew
5 篇 chapman barbara

语言

2,964 篇 英文
55 篇 其他
9 篇 中文
2 篇 俄文
1 篇 挪威文

检索条件"任意字段=Proceedings of the Programming Models and Languages for Distributed Computing"

共 3031 条记录，以下是91-100 订阅

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

详细简洁

排序：

Soft Concurrent Constraint programming with Local Variables 24th

Soft Concurrent Constraint Programming with Local Variables

引用

24th IFIP WG 6.1 International Conference on Coordination models and languages (COORDINATION) Held as Part of the 17th International Federated Conference on distributed computing Techniques (DisCoTec)

作者： Bussi, Laura Gadducci, Fabio Santini, Francesco Univ Pisa Dipartimento Informat Pisa Italy Univ Perugia Dipartimento Matemat & Informat Perugia Italy

ISBN: (纸本)9783031081439;9783031081453

We extend Soft Concurrent Constraint languages with the possibility to manage variables that are local (i.e., private) to some of the agents. Being constraints soft, it is possible to represent preferences as a partially ordered set. With respect to the related literature using an idempotent operator for constraint composition, a soft language requires a revision of the hiding operator, which is used to locally keep the computation effect on a variable, and conceal it from the global store. We provide the language with labelled and unlabelled reduction semantics as well as bisimulation equivalences, further proving their correspondence.

关键词： Soft concurrent constraint programming residuated monoids local variables bisimulation equivalences

来源：评论

学校读者我要写书评

暂无评论

POSTER: Pattern-Aware Sparse Communication for Scalable Recommendation Model Training 24

POSTER: Pattern-Aware Sparse Communication for Scalable Reco...

引用

29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel programming (PPoPP)

作者： He, Jiaao Chen, Shengqi Zhai, Jidong Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9798400704352

Recommendation models are an important category of deep learning models whose size is growing enormous. They consist of a sparse part with TBs of memory footprint and a dense part that demands PFLOPs of computing capability to train. Unfortunately, the high sparse communication cost to re-organize data for different parallel strategies of the two parts impedes the scalability in training. Based on observations of sparse access patterns, we design a two-fold fine-grained parallel strategy to accelerate sparse communication. A performance model is built to select an optimal set of items that are replicated across all GPUs so that all-to-all communication volume is reduced, while keeping memory consumption acceptable. The all-to-all overhead is further reduced by parallel scheduling techniques. In our evaluation on 32 GPUs over real-world datasets, 2.16- 16.8x end-to-end speedup is achieved over the baselines.

关键词： distributed Deep Learning Parallelism

来源：评论

学校读者我要写书评

暂无评论

Model-Driven Generation of Microservice Interfaces: From LEMMA Domain models to Jolie APIs 24th

Model-Driven Generation of Microservice Interfaces: From LEM...

引用

作者： Giallorenzo, Saverio Montes, Fabrizio Peressotti, Marco Rademacher, Florian Univ Bologna Bologna Italy INRIA Sophia Antipolis France Univ Southern Denmark Odense Denmark Univ Appl Sci & Arts Dortmund Dortmund Germany

ISBN: (纸本)9783031081439;9783031081453

We formally define and implement a translation from domain models in the LEMMA modelling framework to microservice APIs in the Jolie programming language. Our tool enables a software development process whereby microservice architectures can first be designed with the leading method of Domain-Driven Design (DDD), and then corresponding data types and service interfaces (APIs) in Jolie are automatically generated. Developers can extend and use these APIs as guides in order to produce compliant implementations. Our tool thus contributes to enhancing productivity and improving the design adherence of microservices.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Comparison of Parallel B Static Traffic Assignment Algorithm Implementation in Java and C++ 28

Comparison of Parallel B Static Traffic Assignment Algorithm...

引用

28th IEEE/ACM International Symposium on distributed Simulation and Real Time Applications, DS-RT 2024

作者： Potuzak, Tomas Pernicka, Petr Kolovsky, Frantisek University of West Bohemia Faculty of Applied Sciences Department of Computer Science and Engineering Plzen Czech Republic RoadTwin S.R.O Plzen Czech Republic

ISBN: (纸本)9798331527211

This paper compares sequential and parallel Java and C++ implementations of the B algorithm, a relatively new algorithm for user-equilibrium (UE) (road) traffic assignment (TA). All the versions were implemented in an optimized way while using best practices in both languages. Their performances were thoroughly tested using multiple large real road traffic networks. The tests showed that the C++ version is indeed faster in most cases, but only by 8.54 % on average. © 2024 IEEE.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

50th International Colloquium on Automata, languages, and programming, ICALP 2023

50th International Colloquium on Automata, Languages, and Pr...

引用

50th International Colloquium on Automata, languages, and programming, ICALP 2023

ISBN: (纸本)9783959772785

The proceedings contain 133 papers. The topics discussed include: a (slightly) improved approximation algorithm for the metric traveling salesperson problem;an almost-linear time algorithm for maximum flow and more;context-bounded analysis of concurrent programs;quantum codes, local testability and interactive proofs: state of the art and open questions;optimal decremental connectivity in non-sparse graphs;stable matching: choosing which proposals to make;expander decomposition with fewer inter-cluster edges using a spectral cut player;locality in online, dynamic, sequential, and distributed graph algorithms;an efficient algorithm for all-pairs bounded edge connectivity;low-depth arithmetic circuit lower bounds: bypassing set-multilinearization;multi-layer peeling for linear arrangement and hierarchical clustering;improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions;and cumulative memory lower bounds for randomized and quantum computation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Autonomous Scheduling Problem in Satellite Constellations for EO Missions. A Robust distributed Optimization Approach

The Autonomous Scheduling Problem in Satellite Constellation...

引用

2024 IAF Space Operations Symposium at the 75th International Astronautical Congress, IAC 2024

作者： De Angelis, Giulio Pietropaolo, Andrea University of Rome La Sapienza Via Eudossiana 18 Rome Italy Thales Alenia Space Via Saccomuro 24 Rome Italy

ISBN: (纸本)9798331312183

Satellite operations, including tasking and commanding, are traditionally managed by ground-based mission control and planning centers. These centers leverage a comprehensive, system-wide perspective to determine operations and dispatch telecommands to orbiting satellites via TT&C ground stations. Accurate knowledge of the system’s status is crucial for scheduling and planning;however, as the scale of satellite constellations expands, maintaining this level of coordination becomes increasingly challenging, particularly in highly dynamic environments. Managing real-time status updates and future task scheduling for a large number of satellites becomes more demanding for a central coordinator. The rise of large-scale and mega-constellations in remote sensing and telecommunications calls for a significant shift in operational strategies. Advanced mission control and planning approaches must evolve beyond traditional centralized models. Critical enabling technologies, such as onboard satellite computing and inter-satellite communications, now make distributed and autonomous system operations feasible. By utilizing space-edge and cloud computing, intelligence can be decentralized across the constellation, reducing the dependence on a central control structure. This paper discusses the application of distributed optimization methods in multi-agent systems, where communication networks evolve dynamically based on orbital mechanics. Integer linear programming is employed to minimize system latency in Earth Observation missions by optimizing image acquisition and data downlink, with a robust version that accounts for uncertainties in local satellite constraints. We perform numerical simulations that model constellation dynamics, acquisition, downlink, and communications to provide a comprehensive assessment of system performance. © 2024 International Astronautical Federation, IAF. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

23rd International Conference on Parallel and distributed computing, Applications, and Technologies, PDCAT 2022

23rd International Conference on Parallel and Distributed Co...

引用

23rd International Conference on Parallel and distributed computing, Applications, and Technologies, PDCAT 2022

ISBN: (纸本)9783031299261

The proceedings contain 40 papers. The special focus in this conference is on Parallel and distributed computing, Applications and Technologies. The topics include: Edge-Gateway Intrusion Detection for Smart Home;energy-Delay Tradeoff in Parallel Task Allocation and Execution for Autonomous Platooning Applications;a Reservation-Based List Scheduling for Embedded Systems with Memory Constraints;Formalization and Verification of SIP Using CSP;Towards a Blockchain and Fog-Based Proactive Data Distribution Framework for ICN;research on User Influence Weighted Scoring Algorithm Incorporating Incentive Mechanism;bloodMan-Chain: A Management of Blood and Its Products Transportation Based on Blockchain Approach;a Systematic Comparison on Prevailing Intrusion Detection models;enhancing Resolution of Inferring Hi-C Data Integrating U-Net and ResNet Networks;detecting Network Intrusions with Resilient Approaches Based on Convolutional Neural Networks;Multi-GPU Scaling of a Conservative Weakly Compressible Solver for Large-Scale Two-Phase Flow Simulation;analysis of Precision Vectors for Ising-Based Linear Regression;Evaluating and Analyzing Irregular Tree Search in the Tascell and HOPE Parallel programming languages;distributed Parallel Tall-Skinny QR Factorization: Performance Evaluation of Various Algorithms on Various Systems;a Partitioned Memory Architecture with Prefetching for Efficient Video Encoders;a Hardware Trojan Exploiting Coherence Protocol on NoCs;A System-Wide Communication to Couple Multiple MPI Programs for Heterogeneous computing;a Task-Parallel Runtime for Heterogeneous Multi-node Vector Systems;Accelerating Radiative Transfer Simulation on NVIDIA GPUs with OpenACC;QR Factorization of Block Low-Rank Matrices on Multi-instance GPU;equivalence Checking of Code Transformation by Numerical and Symbolic Approaches;improving the Performance of Lattice Boltzmann Method with Pipelined Algorithm on A Heterogeneous Multi-zone Processor;MEA: A Framework for Model Chec

关键词：

来源：评论

学校读者我要写书评

暂无评论

SMEVCA: Stable Matching-based EV Charging Assignment in Subscription-Based models 25

SMEVCA: Stable Matching-based EV Charging Assignment in Subs...

引用

26th International Conference on distributed computing and Networking, ICDCN 2025

作者： Khanda, Arindam Satpathy, Anurag Vangala, Anusha Das, Sajal K. Missouri University of Science and Technology RollaMO United States

ISBN: (纸本)9798400710629

The rapid shift from internal combustion engine vehicles to battery-powered electric vehicles (EVs) presents considerable challenges, such as limited charging points (CPs), unpredictable wait times for charging, and difficulty in selecting appropriate CPs for EVs. To address these challenges, we propose a novel end-to-end framework, called Stable Matching based EV Charging Assignment (SMEVCA) that efficiently assigns charge-seeking EVs to CPs with the assistance of roadside units (RSUs). The proposed framework operates within a subscription-based model, ensuring that the subscribed EVs complete their charging within a predefined time limit enforced by a service level agreement (SLA). The framework SMEVCA employs a stable, fast, and efficient EV-CP assignment formulated as a one-to-many matching game with preferences. The matching process identifies the preferred coalition (a subset of EVs assigned to the CPs) using two strategies: (1) Preferred Coalition Greedy (PCG) that offers an efficient, locally optimal heuristic solution;and (2) Preferred Coalition Dynamic (PCD) that is more computation-intensive but delivers a globally optimal coalition. Extensive simulations reveal that PCG and PCD achieve a gain of 14.6% and 20.8% over random elimination for in-network charge transferred with only 3% and 0.1% EVs unserved within the RSUs vicinity. © 2025 Copyright held by the owner/author(s).

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Graph-Theoretic distributed Approach for Cyber Contingency Impact Assessment in Smart Grids

Graph-Theoretic Distributed Approach for Cyber Contingency I...

引用

2024 IEEE International Conference on Modeling, Simulation and Intelligent computing, MoSICom 2024

作者： Hareesh Kumar Reddy, M. Vignesh, V. Indian Institute of Technology Tirupati Electrical Engineering Tirupati India

ISBN: (纸本)9798331533311

The rapid integration of digital technologies into power grids has transformed traditional grids into smart grids, increasing interdependence between cyber and physical components. This interconnection introduces vulnerabilities, where cyber disturbances can significantly impact the operation and stability of the power system. Consequently, evaluating, ranking, and prioritizing cyber contingencies is crucial for maintaining grid reliability and resilience. A novel approach for quantifying cyber contingencies is presented, utilizing the distributed Cyber-Dependent Optimal Power Flow (CDOPF) problem. A graph-theoretic framework models the cyberphysical smart grid, eliminating the need for complex and computationally expensive cyber-physical co-simulations. Nonconvex constraints are convexified using a DC power flow relaxation, enabling more efficient solutions. The distributed algorithms are incorporated using RIAPS (Resilient Information Architecture Platform for Smart Grid), an opensource platform designed to enhance the dependability, resilience, and performance of distributed systems within the smart grid. RIAPS provides a robust framework for decentralized control, fault tolerance, and real-time monitoring, which is crucial for ensuring the resilience of cyber-physical systems in dynamic, distributed environments. The platform supports scalable and efficient integration of distributed algorithms across the grid's infrastructure, enabling fast decision-making and enhanced grid security. The method is tested on the IEEE 39-bus system with varying partition sizes, demonstrating that the distributed approach outperforms centralized methods in scalability and accuracy. It effectively ranks cyber contingencies and measures their impact on overall grid stability, improving grid security and decision-making capabilities. © 2024 IEEE.

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Serverless computing on Heterogeneous Computers 27

Serverless Computing on Heterogeneous Computers

引用

27th ACM International Conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Du, Dong Liu, Qingyuan Jiang, Xueqiang Xia, Yubin Zang, Binyu Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Artificial Intelligence Lab Shanghai Peoples R China

ISBN: (纸本)9781450392051

Existing serverless computing platforms are built upon homogeneous computers, limiting the function density and restricting serverless computing to limited scenarios. We introduce Molecule, the first serverless computing system utilizing heterogeneous computers. Molecule enables both general-purpose devices (e.g., Nvidia DPU) and domain-specific accelerators (e.g., FPGA and GPU) for serverless applications that significantly improve function density (50% higher) and application performance (up to 34.6x). To achieve these results, we first propose XPU-Shim, a distributed shim to bridge the gap between underlying multi-OS systems (when using general-purpose devices) and our serverless runtime (i.e., Molecule). We further introduce vectorized sandbox, a sandbox abstraction to abstract hardware heterogeneity (when using domain-specific accelerators). Moreover, we also review state-of-the-art serverless optimizations on startup and communication latency and overcome the challenges to implement them on heterogeneous computers. We have implemented Molecule on real platforms with Nvidia DPUs and Xilinx FPGAs and evaluate it using benchmarks and real-world applications.

关键词： Cloud computing serverless computing heterogeneous computers function-as-a-service operating system

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共304页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：