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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,032 篇 会议
19 册 图书
8 篇 期刊文献

馆藏范围

1,059 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

626 篇 工学
- 576 篇 计算机科学与技术...
- 291 篇 软件工程
- 229 篇 电气工程
- 225 篇 信息与通信工程
- 80 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 38 篇 动力工程及工程热...
- 37 篇 网络空间安全
- 36 篇 交通运输工程
- 36 篇 安全科学与工程
- 17 篇 电子科学与技术（可...
- 12 篇 机械工程
- 11 篇 生物工程
- 7 篇 建筑学
- 7 篇 环境科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
122 篇 理学
- 62 篇 数学
- 36 篇 化学
- 13 篇 系统科学
- 12 篇 生物学
- 10 篇 统计学（可授理学、...
- 6 篇 物理学
111 篇 管理学
- 81 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 34 篇 工商管理
8 篇 经济学
- 8 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
3 篇 法学
- 3 篇 社会学
1 篇 军事学

主题

121 篇 distributed comp...
73 篇 computer science
57 篇 protocols
56 篇 distributed comp...
55 篇 cloud computing
53 篇 mobile computing
49 篇 middleware
47 篇 computer archite...
46 篇 costs
42 篇 scalability
41 篇 application soft...
41 篇 computer network...
40 篇 computational mo...
39 篇 intelligent netw...
38 篇 bandwidth
36 篇 real time system...
35 篇 peer to peer com...
33 篇 monitoring
31 篇 network servers
31 篇 internet

机构

4 篇 university of st...
4 篇 school of scienc...
3 篇 college of compu...
3 篇 department of co...
3 篇 ibm thomas j. wa...
3 篇 school of comput...
3 篇 brown univ dept ...
3 篇 dept. of cs geor...
3 篇 department of el...
3 篇 univ chicago il ...
3 篇 nppd tehran
3 篇 georgia institut...
3 篇 institute of com...
3 篇 natl univ def te...
3 篇 distributed syst...
2 篇 department of co...
2 篇 school of comput...
2 篇 univ nevada dept...
2 篇 department of co...
2 篇 the chinese univ...

作者

5 篇 yi pan
4 篇 uwe breitenbüche...
4 篇 frank leymann
3 篇 y. shibata
3 篇 jianhua sun
3 篇 dustdar schahram
3 篇 nong xiao
3 篇 hai jin
3 篇 takizawa hiroyuk...
3 篇 jiannong cao
2 篇 j.a. stankovic
2 篇 posdorfer wolf
2 篇 miremadi seyed g...
2 篇 datskova olga
2 篇 m. ito
2 篇 garcia jordi
2 篇 li j
2 篇 jukan admela
2 篇 souissi samia
2 篇 cheng yijun

语言

1,059 篇 英文

检索条件"任意字段=23rd International Conference on Distributed Computing Systems Workshops"

共 1059 条记录，以下是281-290 订阅

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

详细简洁

排序：

2021 IEEE 23rd international conference on High Performance computing and Communications, 7th international conference on Data Science and systems, 19th international conference on Smart City and 7th international conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

2021 IEEE 23rd International Conference on High Performance ...

引用

23rd IEEE international conference on High Performance computing and Communications, 7th IEEE international conference on Data Science and systems, 19th IEEE international conference on Smart City and 7th IEEE international conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

ISBN: (纸本)9781665494571

The proceedings contain 343 papers. The topics discussed include: three-level compact caching for search engines based on solid state drives;a fine-grained volley gesture recognition method with direction independence;universal adversarial attack against 3d object tracking;efficient hardware redo logging for secure persistent memory;a cost-efficient metadata scheme for high-performance deduplication systems;high speed true random number generator controlled by logistic map;characterization and implication of edge WebAssembly runtimes;frend for edge servers: reduce server number! keeping service quality!;on-the-fly servers placement for online multiplayer games in the fog;advanced architecture design of high-radix router based on chiplet integration and IP reusability;embrace the conflicts: exploring the integration of single port memory in systolic array-based accelerators;visual sensitivity aware rate adaptation for video streaming via deep reinforcement learning;semi-supervised federated learning with non-IID data: algorithm and system design;on-demand intelligent routing algorithms for the deterministic networks;and distributed service placement in ultra-dense edge computing: a game-theoretical approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed data-driven engine framework facing CPS brain-inspired intelligent transportation 23

Distributed data-driven engine framework facing CPS brain-in...

引用

作者： Yang, Zhengzhuang Xu, Mingyue Zhao, Kaidi Yang, Chao Zhi, Huiyu Zhang, Xihou Chen, Zhuoran Qiu, Song Han, Dingding School of Information Science and Technology Fudan University Shanghai China School of Communication and Electronic Engineering East China Normal University Shanghai China

ISBN: (纸本)9781665494571

Single data source, isolated data islands and low information utilization in intelligent transportation lead to the poor inversion of the cyber space to the physical space including Incomplete data integration, high interdependency of systems and poor anti-control ability. In this paper the data-driven method is adopted to optimize the W parameter in Webster method to reduce the waiting time of vehicles to realize the traffic congestion. In particular, a multi-source heterogeneous data processing method and a unified modeling of the multi-dimensional and multi-layer networks have been introduced. By data-driven engine, we have implemented both massive storage and fast processing system. We have also build a service system which can rapidly realize data integration and services delivery as well as be directly called by researchers from the database through network requests to reduce the data reprocessing. This paper also produces the data interaction process of the data engine framework in traffic management and control, and proposes a solution for the use of massive city data. © 2021 IEEE.

关键词： Smart cities Soft sensors Transportation Data integration Process control distributed databases Data models

来源：评论

学校读者我要写书评

暂无评论

A graph transformation-based approach for the validation of checkpointing algorithms in distributed systems 23

A graph transformation-based approach for the validation of ...

引用

23rd IEEE international conference on Enabling Technologies, Infrastructure for Collaborative Enterprises (WETICE)

作者： Khlif, Houda Kacem, Hatem Hadj Hernandez, Saul E. Pomares Eichler, Cedric Kacem, Ahmed Hadj Simon, Alberto Calixto Univ Sfax ReDCAD Lab FSEGS Sfax Tunisia Inst Nacl Astrofis Opt & Electr Puebla 72840 Mexico CNRS LAAS F-31400 Toulouse France Univ Toulouse LAAS F-31400 Toulouse France Univ Papaloapan UNPA Loma Bonita 68400 Oaxaca Mexico

ISBN: (纸本)9781479942497

Autonomic computing systems are oriented to prevente the human intervention and to enable distributed systems to manage themselves. One of their challenges is the efficient monitoring at runtime oriented to collect information from which the system can automatically repair itself in case of failure. Quasi-Synchronous Checkpointing is a well-known technique, which allows processes to recover in spite of failures. Based on this technique, several checkpointing algorithms have been developed. According to the checkpoint properties detected and ensured, they are classified into: Strictly Z-Path Free (SZPF), Z-Path Free (ZPF) and Z-Cycle Free (ZCF). In the literature, the simulation has been the method adopted for the performance evaluation of checkpointing algorithms. However, few works have been designed to validate their correctness. In this paper, we propose a validation approach based on graph transformation oriented to automatically detect the previous mentioned checkpointing properties. To achieve this, we take the vector clocks resulting from the algorithm execution, and we model it into a causal graph. Then, we design and use transformation rules oriented to verify if in such a causal graph, the algorithm is exempt from non desirable patterns, such as Z-paths or Z-cycles, according to the case.

关键词： Autonomic computing checkpointing algorithms distributed systems Graph Transformation Happened Before Relation Z-cycles Z-paths

来源：评论

学校读者我要写书评

暂无评论

Performance data from the server to the Intranet: Getting the data and reporting it 23

Performance data from the server to the Intranet: Getting th...

引用

Proceedings of the 1997 23rd international conference for the Resource Management & Performance Evaluation of Enterprise computing systems. Part 1 (of 2)

作者： Merritt, Linwood Trigon Blue Cross Blue Shield

Most medium-to-large mainframe data processing shops utilize automated tools that extract, store, and report relevant capacity and performance data. When distributed systems appear, the capacity planner must often invent solutions that manage and report new data from these systems. This presentation discusses one sites solution to the automated collection and reporting of heterogeneous enterprise performance data. The discussion includes sample code for distributed platforms and workstation processing.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Capacity planning in distributed environments 23

Capacity planning in distributed environments

引用

Proceedings of the 1997 23rd international conference for the Resource Management & Performance Evaluation of Enterprise computing systems. Part 1 (of 2)

作者： Domanski, Bernie Coll of Staten Island/CUNY

Capacity Planning has been a discipline practiced by IT since before the invention of the mainframe. It encompasses different measurement, analysis, modeling and reporting techniques and strategies, But with the advent of distributed computing, with hardware resources competing in what may be termed a commodities market, should Capacity Planning be treated with the same reverence as in the past? This paper will tackle this question head on.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Data Partitioning Framework for distributed Database systems 23

Fine-grained Data Partitioning Framework for Distributed Dat...

引用

23rd international conference on World Wide Web (WWW)

作者： Xu, Ning Cui, Bin Minist Educ Key Lab High Confidence Software Technol Beijing Peoples R China Peking Univ Sch EECS Beijing Peoples R China

ISBN: (纸本)9781450327459

With the increasing size of web data and widely adopted parallel cloud computing paradigm, distributed database and other distributed data processing systems, for example Pregel and GraphLab, use data partitioning technology to divide the large data set. By default, these systems use hash partitioning to randomly assign data to partitions, which leads to huge network traffic between partitions. Fine-grained partitioning can better allocate data and minimize the number of nodes involved within a transaction or job while balancing the workload across data nodes as well. In this paper, we propose a novel prototype system, LuTe, to provide highly efficient fine-grained partitioning scheme for these distributed systems. LuTe maintains a lookup table for each partitioned data set that maps a key to a set of partition ID(s). We use a novel lookup table technology that provides low cost of reading and writing lookup table. LuTe provides transaction support and high concurrency writing with Multi Version Concurrency Control (MVCC) as well. We implemented a prototype distributed DBMS on Post-gresql and used LuTe as a middle -ware to provide fine-grained partitioning support. Extensive experiments conducted on a cluster demonstrate the advantage of the proposed approach. The evaluation results show that in comparison with other state-of-the-art lookup table salutations, our approach can significantly improve throughput by about 20% to 70% on TPC-C benchmark.

关键词： partitioning distributed systems lookup table

来源：评论

学校读者我要写书评

暂无评论

Lambda Means Clustering: Automatic Parameter Search and distributed computing Implementation 23

Lambda Means Clustering: Automatic Parameter Search and Dist...

引用

23rd international conference on Pattern Recognition (ICPR)

作者： Comiter, Marcus Cha, Miriam Kung, H. T. Teerapittayanon, Surat Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781509048472

Recent advances in clustering have shown that ensuring a minimum separation between cluster centroids leads to higher quality clusters compared to those found by methods that explicitly set the number of clusters to be found, such as k-means. One such algorithm is DP-means, which sets a distance parameter lambda for the minimum separation. However, without knowing either the true number of clusters or the underlying true distribution, setting lambda itself can be difficult, and poor choices in setting lambda will negatively impact cluster quality. As a general solution for finding lambda, in this paper we present lambda-means, a clustering algorithm capable of deriving an optimal value for lambda automatically. We contribute both a theoretically-motivated cluster-based version of lambda-means, as well as a faster conflict-based version of lambda-means. We demonstrate that lambda-means discovers the true underlying value of lambda asymptotically when run on datasets generated by a Dirichlet Process, and achieves competitive performance on a real world test dataset. Further, we demonstrate that when run on both parallel multicore computers and distributed cluster computers in the cloud, cluster-based lambda-means achieves near perfect speedup, and while being a more efficient algorithm, conflict-based lambda-means achieves speedups only a factor of two away from the maximum-possible.

关键词： Clustering algorithms Elbow Partitioning algorithms Computers Measurement distributed computing Multicore processing

来源：评论

学校读者我要写书评

暂无评论

Reconfiguration Cost for Reconfigurable computing Architectures 23

Reconfiguration Cost for Reconfigurable Computing Architectu...

引用

23rd ACIS international Summer Virtual conference on Software Engineering, Artificial Intelligence, Networking and Parallel/distributed computing, SNPD-Summer 2022

作者： Takano, Shigeyuki Amano, Hideharu Keio University Dept. of Informatics and Computer Science Kanagawa Japan

ISBN: (纸本)9798350396379

Reconfigurable computing systems show the advantage of high flexibility and high-performance or low-power relative to traditional computing systems. Reconfiguration can change user logic statically or dynamically. The reconfiguration is a key feature in the reconfigurable computing system, however, the reconfiguration techniques are not considered enough. One of the reconfiguration techniques must be chosen for usage target characteristics of reconfiguration. This article shows the cost of typical reconfiguration techniques which can be applied to not only field-programmable gate arrays (FPGAs) but also coarse-grained reconfigurable arrays (CGRAs). We call these microarchitectures, field-programmable logic (FPL). We focus on three device classes;traditional configurable FPL (ex. FPGA), a partially reconfigurable FPL and a multi-context FPL. We investigate how the size and frequency of reconfiguration can be taken care of and how much speed-up is theoretically expected from a perspective of reconfiguration cost. In addition, the investigation introduces temporal and spatial configuration cache techniques. © 2022 IEEE.

关键词： Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

MUAR: Maximizing Utilization of Available Resources for Query Processing 23

MUAR: Maximizing Utilization of Available Resources for Quer...

引用

23rd IEEE/ACM international Symposium on Cluster, Cloud and Internet computing (CCGrid)

作者： Patel, Mayank Bhise, Minal DA IICT Distributed Databases Grp Gandhinagar Gujarat India

ISBN: (纸本)9798350302080

Processing large datasets requires significant hardware resources and energy. Researchers have observed that most database management systems could not utilize available resources efficiently, increasing data to result time and application running costs. This research explores techniques that can maximize the utilization of available resources to efficiently process large datasets on limited resource systems. The work implemented single and multiple resource maximization techniques and observed improvements in total workload execution time (WET). Results showed that combining CPU and RAM resource maximization techniques can reduce WET by 61-81% compared to the original WET observed with default resource allocation configuration. This work proposes a lightweight real-time resource allocation and task scheduling algorithm MUAR (Maximizing Utilization of Available Resources). It maximizes the utilization of available resources considering the real-time availability of resources and workload task complexity. The algorithm identifies complex multi-join queries and allocates maximum available resources for faster execution. MUAR is capable of estimating work memory value with 15-20% error required to achieve the best query performance with only single query run data. A comparison of MUAR with machine learning-based techniques like PCC and AutoToken is also presented.

关键词： Big Data Maximizing Utilization of Resources Optimize Query Execution Real-time Dynamic Resource Allocation Task Scheduling

来源：评论

学校读者我要写书评

暂无评论

Towards Understanding Optimal Load-Balancing of Heterogeneous Short-Range Molecular Dynamics 23

Towards Understanding Optimal Load-Balancing of Heterogeneou...

引用

23rd Annual IEEE international conference on High Performance computing, Data, and Analytics (HiPCW)

作者： Hirschmann, Steffen Pflueger, Dirk Glass, Colin W. Univ Stuttgart Inst Parallel & Distributed Syst Stuttgart Germany Univ Stuttgart High Performance Comp Ctr Stuttgart Stuttgart Germany

ISBN: (纸本)9781509057733

For heterogeneous dynamic short-range molecular dynamics simulations it is critical to employ suitable loadbalancing methods to minimize the time to solution. However, designing, selecting and parametrizing the optimal loadbalancing method is a complex task which depends on detailed properties of the simulation scenario. The main challenge in balancing the load of molecular dynamics simulations is the extreme difference in load for scenarios with a heterogeneous particle density, which can easily reach 4-6 orders of magnitude. Therefore, heterogeneity is deemed to be a relevant property. In this paper, we formulate a suitable metric to reliably quantify heterogeneity. We apply this metric, which is based on the binning of particles and the evaluation of statistical moments, to example scenarios, and we correlate the results to the performance of five load balancing methods. Furthermore, we identify the load dynamics as a second relevant property. It quantifies how rapidly the load varies over time, and we introduce corresponding metrics. We show that the load dynamics can be used to determine how long the benefits of a specific partitioning are expected to last. The results indicate that these metrics are useful to differentiate between scenarios, and that they facilitate reasoning over the complex relationship between particle simulation scenarios and optimal load balancing methods. This work is a first step towards understanding this relationship, and it introduces key concepts that we regard as crucial in this process.

关键词： short-range molecular dynamics parallelization spatial decomposition distributed memory linked-cell load-balancing heterogeneity load dynamics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共106页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：