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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

30,445 篇 会议
296 篇 期刊文献
40 册 图书

馆藏范围

30,781 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

18,595 篇 工学
- 15,168 篇 计算机科学与技术...
- 6,504 篇 信息与通信工程
- 6,260 篇 软件工程
- 5,557 篇 电气工程
- 2,799 篇 控制科学与工程
- 1,088 篇 动力工程及工程热...
- 972 篇 机械工程
- 939 篇 仪器科学与技术
- 840 篇 电子科学与技术（可...
- 424 篇 测绘科学与技术
- 393 篇 网络空间安全
- 355 篇 生物工程
- 291 篇 安全科学与工程
- 274 篇 交通运输工程
- 232 篇 生物医学工程（可授...
- 227 篇 建筑学
- 200 篇 土木工程
- 200 篇 石油与天然气工程
3,231 篇 理学
- 1,844 篇 数学
- 588 篇 系统科学
- 542 篇 物理学
- 443 篇 统计学（可授理学、...
- 413 篇 生物学
- 234 篇 化学
2,666 篇 管理学
- 2,072 篇 管理科学与工程(可...
- 827 篇 图书情报与档案管...
- 744 篇 工商管理
417 篇 医学
- 345 篇 临床医学
- 180 篇 基础医学(可授医学...
240 篇 法学
188 篇 经济学
- 187 篇 应用经济学
109 篇 农学
74 篇 军事学
53 篇 教育学
48 篇 文学
13 篇 艺术学
1 篇 历史学

主题

4,968 篇 wireless sensor ...
3,276 篇 distributed comp...
1,702 篇 sensor systems
1,122 篇 protocols
1,051 篇 distributed comp...
1,045 篇 monitoring
1,010 篇 computer archite...
976 篇 cloud computing
961 篇 computer network...
911 篇 computer science
884 篇 distributed data...
835 篇 sensors
825 篇 computational mo...
819 篇 wireless communi...
796 篇 robot sensing sy...
659 篇 application soft...
629 篇 routing
568 篇 sensor phenomena...
564 篇 internet of thin...
561 篇 peer to peer com...

机构

40 篇 department of co...
33 篇 shanghai jiao to...
30 篇 department of co...
30 篇 ieee
29 篇 distributed syst...
28 篇 school of comput...
27 篇 tsinghua univers...
26 篇 school of comput...
24 篇 suny stony brook...
22 篇 nanjing univ sta...
21 篇 georgia inst tec...
20 篇 state key labora...
19 篇 georgia state un...
19 篇 hong kong univ s...
18 篇 school of comput...
18 篇 institute of par...
17 篇 shanghai jiao to...
17 篇 georgia inst tec...
17 篇 univ chinese aca...
16 篇 tsinghua univ de...

作者

88 篇 dustdar schahram
52 篇 rajkumar buyya
35 篇 hong-linh truong
28 篇 zomaya albert y.
27 篇 klaus wehrle
27 篇 wehrle klaus
27 篇 wu jie
26 篇 liu yang
25 篇 yang yang
22 篇 wang lei
20 篇 fortino giancarl...
19 篇 duerr frank
18 篇 lei wang
18 篇 wang guojun
17 篇 li li
16 篇 rinner bernhard
16 篇 liu ling
14 篇 zhang lei
14 篇 stankovic john a...
14 篇 xhafa fatos

语言

30,390 篇 英文
279 篇 其他
115 篇 中文
3 篇 法文
2 篇 俄文
1 篇 葡萄牙文
1 篇 土耳其文

检索条件"任意字段=IEEE International Conference on Distributed Computing in Sensor Systems"

共 30781 条记录，以下是1101-1110 订阅

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

详细简洁

排序：

SeqDLM: A Sequencer-Based distributed Lock Manager for Efficient Shared File Access in a Parallel File System

SeqDLM: A Sequencer-Based Distributed Lock Manager for Effic...

引用

international conference for High Performance computing, Networking, Storage and Analysis (HPC)

作者： Chen, Qi Ma, Shaonan Chen, Kang Ma, Teng Liu, Xin Chen, Dexun Wu, Yongwei Chen, Zuoning Tsinghua Univ Beijing Peoples R China Alibaba Inc Hangzhou Peoples R China Natl Supercomp Ctr Wuxi Wuxi Peoples R China Chinese Acad Engn Beijing Peoples R China

ISBN: (纸本)9781665454445

distributed locks are used to guarantee the distributed client-cache coherence in parallel file systems. However, they lead to poor performance in the case of parallel writes under high-contention workloads. We analyze the distributed lock manager and find out that lock conflict resolution is the root cause of the poor performance, which involves frequent lock revocations and slow data flushing from client caches to data servers. We design a distributed lock manager named SeqDLM by exploiting the sequencer mechanism. SeqDLM mitigates the lock conflict resolution overhead using early grant and early revocation while keeping the same semantics as traditional distributed locks. To evaluate SeqDLM, we have implemented a parallel file system called ccPFS using both SeqDLM and traditional distributed locks. Evaluations on 96 nodes show SeqDLM outperforms the traditional distributed locks by up to 10.3x for high-contention parallel writes on a shared file with multiple stripes.

关键词： high performance computing file systems cache coherence distributed lock sequencer

来源：评论

学校读者我要写书评

暂无评论

Federating Learning Attacks: Maximizing Damage while Evading Detection 19

Federating Learning Attacks: Maximizing Damage while Evading...

引用

19th ieee international Wireless Communications and Mobile computing (ieee IWCMC)

作者： Gouissem, A. Khattab, T. Abdallah, M. Mohamed, A. Univ Doha Sci & Technol Coll Comp & Informat Technol Doha Qatar Qatar Univ Elect Engn Doha Qatar HBKU Coll Sci & Engn Ar Rayyan Qatar

ISBN: (纸本)9798350333398

Despite its potential benefits, Federated learning (FL) is vulnerable to various types of attacks that can compromise the accuracy and security of the trained model. While several defense mechanisms have been proposed to protect FL against such attacks, attackers are continuously developing more advanced techniques to bypass these protection mechanisms. In this context, this paper proposes a novel attack mechanism that allows malicious users to optimize their crafted reports, maximizing potential damage while limiting the chances of being detected. Our proposed attack technique is a robust approach designed to bypass existing defense mechanisms in FL. Our contributions are mainly investigating the FL model attack from the attacker's perspective, proposing a model relaxation approach to optimize a single poisoning ratio variable, and formulating a compromise between the chances of being detected and the amount of damage that the attack could cause. Additionally, we introduce three new attack designs, namely DTA, ATA, and NEA, which maximize the effect of the attack. The proposed Distance Target Attack (DTA) minimizes the distance from the target attack model, while the Accuracy Target Attack (ATA) deteriorates the accuracy of the global model. Furthermore, the Number Estimation Attack (NEA) aims to maximize the expected number of attackers that could bypass the aggregation detection mechanisms. The numerical results based on the KDD dataset confirm the ability of the proposed approach to deteriorate the global model accuracy. The experiments showed that the proposed DTA, ATA, and NEA attacks can significantly reduce the accuracy of the global model. These results demonstrate also the effectiveness and robustness of the proposed attack mechanism in compromising the accuracy and security of FL models.

关键词： Federated Learning distributed Learning Byzantine attacks Intrusion Detection

来源：评论

学校读者我要写书评

暂无评论

Smart distributed Parking System using Internet of Things 6

Smart Distributed Parking System using Internet of Things

引用

6th international conference on Intelligent computing and Control systems, ICICCS 2022

作者： Leelipushpam Paulraj, Getzi Jeba Johnraja Jebadurai, Immanuel Khan, Pathan Firoz Sumanth, Neela Reddy, Kothapally Vishal Karunya Institute of Technology and Sciences Department of Computer Science and Engineering Coimbatore India

ISBN: (纸本)9781665410359

With the growth of cities and population, urban corporation faces potential challenges. One such challenge is regulating parking spaces. This become a tedious job during weekends and festival season. Improper regulation in parking spaces lead to traffic congestion and affects the fuel economy. Various parking solutions using sensor networks and image processing techniques have been proposed in literatures. For developing smart city environment, single parking space management is not sufficient and image processing based parking system can be applied only to large spaces. This paper proposes distributed parking management system. Three parking slots have been created. The IR sensors capture the status of the space and communicate to the cloud. The user can also check the real time parking space availability in mobile application. Prototype has been developed and checked under various condition. The proposed solution provides parking space information on real time and improves fuel efficiency. © 2022 ieee.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Transmission Control Strategy for distributed Detection in EH-WSNs 7

Adaptive Transmission Control Strategy for Distributed Detec...

引用

7th international conference on Intelligent computing and Signal Processing, ICSP 2022

作者： Duan, Qinwen Liu, Xiangyang Wang, Hong National University of Defense Technology College of Information and Communication Wuhan China

ISBN: (纸本)9781665478571

In order to adapt the performance requirements of Energy Harvesting Wireless sensor Networks (EH-WSNs) for distributed detection, an adaptive transmission control strategy based on cross-layer design was proposed. First, the simulation model of the distributed detection-oriented EH-WSNs was constructed, including the wireless channel model, MAC model, energy model, and detection model. With the competition probability of each sensor, the number of observed samples, the average power of transmitted signals and the average power of detection as decision variables, the optimization of the transmission control scheme was formulated as the maximization of the deflection coefficient that correlates detection and communication. An interior point method was used to solve the problem. Finally, the strategy was compared and analyzed with other schemes, and its performance advantages were verified. © 2022 ieee.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Intent-Driven distributed Applications Management Over Compute and Network Resources in the computing Continuum 19

Intent-Driven Distributed Applications Management Over Compu...

引用

19th Annual international conference on distributed computing in Smart systems and the Internet of Things, DCOSS-IoT 2023

作者： Zafeiropoulos, Anastasios Fotopoulou, Eleni Vassilakis, Constantinos Tzanettis, Ioannis Lombardo, Chiara Carrega, Alesssandro Bruschi, Roberto National Technical University of Athens Institute of Communication and Computer Systems Athens Greece School of Electrical and Computer Engineering National Technical University of Athens Athens Greece Cnit S2N National Laboratory Genoa Italy

ISBN: (纸本)9798350346497

Intent-driven orchestration enables organizations to achieve greater automation, integration, and intelligence of their compute and network resources by defining their objectives and policies in a more abstract and holistic way, while letting the orchestration system handle the coordination, optimization, and adaptation of the resources in response to changing needs and conditions. The trend for the development of intent-driven orchestration mechanisms has been growing in recent years as the deployment of distributed applications in the computing continuum has become more complex and diverse. In this manuscript we detail a novel approach for the management of distributed applications in the computing continuum. A hierarchical decision making scheme is proposed where an entity in a specific level of the hierarchy has the responsibility for the management of the overall application or a part of it, without having the control of all the management actions. The control is distributed across various entities that have to collaborate towards some joint objectives. Both compute and network resources management is considered that may be provided by the same or different infrastructure providers. © 2023 ieee.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Toward Low-Overhead Inter-Switch Coordination in Network-Wide Data Plane Program Deployment 42

Toward Low-Overhead Inter-Switch Coordination in Network-Wid...

引用

42nd ieee international conference on distributed computing systems (ICDCS)

作者： Chen, Xiang Liu, Hongyan Xiao, Qingjiang Guo, Kaiwei Sun, Tingxin Ling, Xiang Liu, Xuan Huang, Qun Zhang, Dong Zhou, Haifeng Zhang, Fan Wu, Chunming Zhejiang Univ Hangzhou Peoples R China Peking Univ Beijing Peoples R China Fuzhou Univ Fuzhou Peoples R China Chinese Acad Sci Inst Software Beijing Peoples R China Yangzhou Univ Yangzhou Jiangsu Peoples R China Southeast Univ Nanjing Peoples R China

ISBN: (数字)9781665471770

ISBN: (纸本)9781665471770

In modern networks, administrators realize their desired functions such as network measurement in several data plane programs. They often employ the network-wide program deployment paradigm that decomposes input programs into matchaction tables (MATs) while deploying each MAT on a specific programmable switch. Since MATs may be deployed on different switches, existing solutions propose the inter-switch coordination that uses the per-packet header space to deliver crucial packet processing information among switches. However, such coordination introduces non-trivial per-packet byte overhead, leading to significant end-to-end network performance degradation. In this paper, we propose Hermes, a program deployment framework that aims to minimize the per-packet byte overhead. The key idea of Hermes is to formulate the network-wide program deployment as a mixed-integer linear programming (MILP) problem with the objective of minimizing the per-packet byte overhead. In view of the NP hardness of the MILP problem, Hermes further offers a greedy-based heuristic that solves the problem in a near-optimal and timely manner. We have implemented Hermes on Tofino-based switches. Our experiments show that compared to existing frameworks, Hermes decreases the per-packet byte overhead by 156 bytes while preserving end-to-end performance in terms of flow completion time and goodput.

关键词： Degradation Impedance matching Computational modeling Switches Mixed integer linear programming distributed computing

来源：评论

学校读者我要写书评

暂无评论

Enabling Low-Overhead HT-HPC Workflows at Extreme Scale using GNU Parallel

Enabling Low-Overhead HT-HPC Workflows at Extreme Scale usin...

引用

2024 Workshops of the international conference for High Performance computing, Networking, Storage and Analysis, SC Workshops 2024

作者： Maheshwari, Ketan Arndt, William Karimi, Ahmad Maroof Yin, Junqi Suter, Frederic Johnson, Seth Da Silva, Rafael Ferreira Oak Ridge National Laboratory Oak RidgeTN United States Lawrence Berkeley National Laboratory BerkeleyCA United States

ISBN: (纸本)9798350355543

GNU Parallel is a versatile and powerful tool for process parallelization widely used in scientific computing. This paper demonstrates its effective application in high-performance computing (HPC) environments, particularly focusing on its scalability and efficiency in executing large-scale high-throughput high-performance computing (HT-HPC) workflows. Through real-world examples, we highlight GNU Parallel's performance across various HPC workloads, including GPU computing, container-based workloads, and node-local NVMe storage. Our results on two leading supercomputers, OLCF's Frontier and NERSC's Perlmutter, showcase GNU Parallel's rapid process dispatching ability and its capacity to maintain low overhead even at extreme scales. We explore GNU Parallel's application in massive parallel file transfers using a scheduled Data Transfer Node (DTN) cluster, emphasizing its broad utility in diverse scientific workflows. Beyond its direct application as a viable workflow manager, GNU Parallel can be employed in conjunction with other workflow systems as a "last-mile"parallelizing driver and as a quick prototyping tool to design and extract parallel profiles from application executions. We then argue that the potential for GNU Parallel to transform workflow management at extreme scales is substantial, paving the way for more efficient and effective scientific discoveries. © 2024 ieee.

关键词： distributed computing GNU Parallel High-Throughput computing Scientific Workflows

来源：评论

学校读者我要写书评

暂无评论

Deterministic Self-Adjusting Tree Networks Using Rotor Walks 42

Deterministic Self-Adjusting Tree Networks Using Rotor Walks

引用

42nd ieee international conference on distributed computing systems (ICDCS)

作者： Avin, Chen Bienkowski, Marcin Salem, Iosif Sama, Robert Schmid, Stefan Schmidt, Pawel Ben Gurion Univ Negev Sch Elect & Comp Engn Beer Sheva Israel Univ Wroclaw Inst Comp Sci Wroclaw Poland TU Berlin Dept Telecommun Syst Berlin Germany Univ Vienna Fac Comp Sci Vienna Austria Univ Vienna Vienna Austria

ISBN: (数字)9781665471770

ISBN: (纸本)9781665471770

We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications in reconfigurable datacenter networks. We are given a balanced binary tree T connecting n nodes V = {v(1), ...,v(n)}. A source node v(0), attached to the root of the tree, issues communication requests to nodes in V, in an online and adversarial manner;the access cost of a request to a node v, is given by the current depth of v in T. The online algorithm can try to reduce the access cost by performing swap operations, with which the position of a node is exchanged with the position of its parent in the tree;a swap operation costs one unit. The objective is to design an online algorithm which minimizes the total access cost plus adjustment cost (swapping). Avin et al. [12] (LATIN 2020) recently presented RANDOM-PUSH, a constant competitive online algorithm for this problem, based on random walks, together with a sophisticated analysis exploiting the working set property. This paper studies analytically and empirically, online algorithms for this problem. In particular, we explore how to derandomize RANDOM-PUSH. In the analytical part, we consider a simple derandomized algorithm which we call ROTOR-PUSH, as its behavior is reminiscent of rotor walks. Our first contribution is a proof that ROTOR-PUSH is constant competitive: its competitive ratio is 12 and hence by a factor of five lower than the best existing competitive ratio. Interestingly, in contrast to RANDOM-PUSH, the algorithm does not feature the working set property, which requires a new analysis. We further present a significantly improved and simpler analysis for the randomized algorithm, showing that it is 16-competitive. In the empirical part, we compare all self-adjusting single-source tree networks, using both synthetic and real data. In particular, we shed light on the extent to which these self-adjusting trees can exploit t

关键词： Costs Source coding Rotors Binary trees Behavioral sciences distributed computing

来源：评论

学校读者我要写书评

暂无评论

Incentive-based Energy-efficient Federated Learning Aggregation for Intrusion Detection in IoT sensor Network 14

Incentive-based Energy-efficient Federated Learning Aggregat...

引用

14th international conference on computing Communication and Networking Technologies, ICCCNT 2023

作者： Venkatesan, C. Jeevanantham, S. Rebekka, B.

ISBN: (纸本)9798350335095

At present, the wide range of critical applications encompassing healthcare and financial management are inhabited by wireless sensor networks (WSN). The foremost challenge associated with it is the resource constraint. Also, the WSN being itself deployed for critical applications, the adverse wireless security threats lead to head-on effect on the safety and operational efficiency. Hence in WSN, the intrusion detection implementation should corroborate the energy-efficient implementation for seamless operation. The inherent distributed characteristic of WSN mandates the federated learning to avoid the huge communication cost. This in turn preserves the security of critical sensor data used for training. However, the sensor nodes suffer from energy depletion due to local training and communication for federated model aggregation. Thus, in the proposed Incentive-based Energy-efficient Federated Learning Aggregation (IEE-FedAgg), the global model incremental training performance is considered for optimally scheduling the sensor nodes for learning. The aggregation number is further tuned based on the real-time performance exhibited. The simple multi-layer perceptron (MLP) and Long Short-Term Memory (LSTM) were considered for local training. Both the communication and computation energy consumption of the sensor nodes are considered for better analysis. The proposed IEE-FedAgg-LSTM model demonstrates the multi-class prediction accuracy of 99% and 98% for iid and non-iid data distribution respectively. Further, the proposed IEE-FedAgg mechanism attains the energy savings of 50% and 24% respectively for instrusion detection in iid and non-iid data distribution. © 2023 ieee.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Towards Mixed Criticality Industrial Wireless sensor-Actuator Network 23

Towards Mixed Criticality Industrial Wireless Sensor-Actuato...

引用

24th international conference on distributed computing and Networking (ICDCN)

作者： Modekurthy, Prashant Rahman, Mahbubur Saifullah, Abusayeed Univ Nevada Las Vegas NV 89154 USA CUNY New York NY 10021 USA Wayne State Univ Detroit MI 48202 USA

ISBN: (纸本)9781450397964

In industrial Internet of Things, feedback control loops employed over wireless sensor-actuator network (WSAN) for various process monitoring and control applications require real-time communication for stability. In the real world, most complex control systems are, de facto, Mixed-Criticality (MC) system, meaning that all control loops are not equally critical for the system's correct operation. While the notion of mixed-criticality has been studied widely in CPU scheduling, it still remains largely unexplored for wireless domain. For MC CPU scheduling, the key challenge stems from the uncertainty of worst-case execution times, while the uncertainty in WSAN comes from unpredictable channel conditions and plant dynamics. In this paper, we formulate the MC scheduling problem, formally define the MC semantics for WSAN, and propose MC real-time scheduling in multihop WSAN that allows co-scheduling of the loops for handling dynamic criticality changes. This proposed approach exploits the capture effects of the radios for dynamic resource allocation and reclamation when criticality changes. Then, by exploiting the unused channel capacity of WSAN, we propose a technique to minimize redundancy in high criticality control loop scheduling while preserving the communication reliability and MC constraints, thereby enhancing MC schedulability.

关键词： Wireless sensor-Actuator Networks Internet of Things Mixed-Criticality

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 107 108 109 110 111 112 113 114 115 116 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：