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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

121 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

123 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

93 篇 工学
- 88 篇 计算机科学与技术...
- 37 篇 软件工程
- 33 篇 电气工程
- 30 篇 信息与通信工程
- 11 篇 控制科学与工程
- 10 篇 生物工程
- 3 篇 动力工程及工程热...
- 3 篇 测绘科学与技术
- 2 篇 生物医学工程（可授...
- 1 篇 机械工程
- 1 篇 电子科学与技术（可...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 船舶与海洋工程
- 1 篇 环境科学与工程（可...
23 篇 理学
- 12 篇 生物学
- 8 篇 数学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 统计学（可授理学、...
11 篇 管理学
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
- 3 篇 图书情报与档案管...
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

9 篇 sensor systems
6 篇 edge computing
5 篇 iot
5 篇 distributed comp...
5 篇 federated learni...
4 篇 intelligent netw...
4 篇 protocols
3 篇 scalability
3 篇 resource managem...
3 篇 wireless sensor ...
3 篇 distributed syst...
3 篇 blockchain
3 篇 artificial intel...
3 篇 cloud computing
3 篇 computer network...
3 篇 data models
3 篇 distributed ledg...
2 篇 internet of thin...
2 篇 ethereum
2 篇 routing

机构

2 篇 college of compu...
2 篇 yangzhou power s...
2 篇 wuhan univ techn...
2 篇 sidroco holdings...
2 篇 univ jinan sch i...
2 篇 xiamen univ tech...
1 篇 information scie...
1 篇 oxford brookes u...
1 篇 chongqing key la...
1 篇 department of co...
1 篇 beijing jiaotong...
1 篇 department of co...
1 篇 anhui univ techn...
1 篇 southern methodi...
1 篇 school of artifi...
1 篇 univ jinan infor...
1 篇 school of comput...
1 篇 research team on...
1 篇 department of so...
1 篇 nearby comp sl b...

作者

2 篇 zhai xiaojun
2 篇 zhou xiaokang
2 篇 zhao yue
2 篇 liao yangzhe
2 篇 liu xin
2 篇 hu xiping
1 篇 batista fabrizio
1 篇 ouahbi ibrahim
1 篇 liu xiaoming
1 篇 li xi
1 篇 sari talip tolga
1 篇 biswas sujit
1 篇 mendiboure leo
1 篇 qu qianhui
1 篇 george c. polyzo...
1 篇 wen-lin chang
1 篇 khoi le quoc
1 篇 sylla tidiane
1 篇 irfan awan
1 篇 qi jin

语言

122 篇 英文
1 篇 其他

检索条件"任意字段=18th International Conference on Distributed Computing and Intelligent Technology, ICDCIT 2022"

共 123 条记录，以下是11-20 订阅

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

详细简洁

排序：

A distributed Algorithm for Constructing an Independent Dominating Set 18th

A Distributed Algorithm for Constructing an Independent Domi...

引用

18th international conference on distributed computing and intelligent technology (icdcit)

作者： Banerjee, Suman Dogra, Abhishek Singh, Anurag Kumar Bhattacharjee, Subhasis Indian Inst Technol Jammu Dept Comp Sci & Engn Jammu 181201 Jammu & Kashmir India

ISBN: (纸本)9783030948764;9783030948757

Given a simple finite undirected graph, finding a minimum INDEPENDENT DOMINATING SET is a fundamental graph algorithmic problem. In this paper, we propose a distributed algorithm for constructing an independent dominating set (IDS) in the CONGEST model of distributed computing. Our algorithm requires only 2-hop partial information at each node for computations, and hence each node takes various decisions without having any global knowledge of the graph. the algorithm consists of mainly three steps. First, we construct a dominating set using a node estimation and voting mechanism. then each dominating node finds out a vertex cover of its 2-hop graph by an incremental greedy algorithm along with a few optimizations and tie breaking. We prove that the union of the vertex covers computed by each dominating node is a vertex cover of the original graph. Finally, we construct an independent set by complementing the vertex cover. Considering this independent set as an IDS (of the induced graph by the closed neighborhood of the independent set), its closed neighborhood is deleted from the original graph to construct the reduced graph. We repeat the above three-step process until the reduced graph is null. To the best of our knowledge, this is the first distributed algorithm for constructing an IDS. We experimented on eight real-world networks and synthetic networks from well-known Erdos-Renyi graph generators. We observe that in most of the cases our algorithm takes only a few (approx 5) iterations and returns an IDS whose size is fractionally higher than the size of IDS computed by a sequential greedy algorithm.

关键词： distributed algorithm Vertex cover Voting Independent Dominating Set

来源：评论

学校读者我要写书评

暂无评论

Efficient Traffic Routing in Smart Cities to Minimize Evacuation Time During Disasters 18th

Efficient Traffic Routing in Smart Cities to Minimize Evacua...

引用

18th international conference on distributed computing and intelligent technology (icdcit)

作者： Sen Sarma, Sayan Sinha, Bhabani P. Sinha, Koushik Univ Calcutta Dept Comp Sci & Engn Kolkata W Bengal India SOA Univ Dept Comp Sci & Engn Bhubaneswar India Southern Illinois Univ Sch Comp Sci Carbondale IL USA

ISBN: (纸本)9783030948764;9783030948757

Efficient traffic management during disaster evacuations is an essential component of intelligent transport systems in smart cities. In a natural disaster, a surge of vehicles from dense residential areas may simultaneously move towards the same nearest safe shelter following a shortest path for each individual vehicle, thereby often leading to congestion and resulting in increased evacuation time. In this paper, we consider time-optimal traffic distribution in such disastrous situations considering a Manhattan grid network of roads. Several research results on optimal-time traffic distribution in such a network exist in the literature, all of which consider a restricted scenario of a single safe destination at a corner point of the grid. In contrast, we describe a technique for minimizing average travel time of the vehicles assuming a general situation as experienced in real-life, where the destination node can be anywhere on a rectangular m x n grid network with multiple sources of traffic injection. Simulation results using SUMO on a road network of Manhattan borough of New York city show that our proposed technique outperforms the existing techniques on dynamic traffic assignment in terms of average travel time.

关键词： Transportation network Route planning intelligent transport system (ITS) Queuing delay Evacuation problem Congestion control

来源：评论

学校读者我要写书评

暂无评论

ALPR - An intelligent Approach Towards Detection and Recognition of License Plates in Uncontrolled Environments 19th

ALPR - An Intelligent Approach Towards Detection and Recogni...

引用

19th international conference on distributed computing and intelligent technology (icdcit)

作者： Bakshi, Akshay Gulhane, Sudhanshu Sawant, Tanish Sambhe, Vijay Udmale, Sandeep S. VJTI Dept Comp Engn & Informat Technol Mumbai 400019 Maharashtra India PICT Dept Elect & Telecommun Engn Pune 411043 Maharashtra India

ISBN: (纸本)9783031248474;9783031248481

Most existing Automatic License Plate Recognition (ALPR) approaches focus on images containing approximately frontal views. the considerable variation of LP across complicated environments and perspectives remains a massive challenge for a robust ALPR. this work proposes a comprehensive ALPR paradigm emphasizing unrestricted express screenplays in which the LP may be significantly influenced by diverse shooting angles, illumination circumstances, and complicated surroundings. this system integrates a Spatial Transformer Network, which can catch and repair numerous distorted LPs in an image so that all the plates are consistently aligned. then, a convolutional neural network is sketched to determine LP characters containing various font styles and sizes. We evaluated the system with a data set containing annotations for a challenging LP image set from multiple areas and acquisition states. the experimental outcomes reveal that our proposed ALPR paradigm attains adequate recognition accuracy compared to existing methods.

关键词： Convolutional Neural Network (CNN) License Plate (LP) Spatial Transformer Network (STN) YOLO

来源：评论

学校读者我要写书评

暂无评论

intelligent Cross-Layer Routing Framework Based on D* Lite for Resilient Aerial Networks 18

Intelligent Cross-Layer Routing Framework Based on D* Lite f...

引用

18th Annual international conference on distributed computing in Sensor Systems (DCOSS)

作者： Sari, Talip Tolga Secinti, Gokhan Istanbul Tech Univ Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9781665495127

Flying Ad Hoc Networks (FANETs) need reliable intra-communication to work effectively during the missions they participate in, especially in contested environments. Furthermore, choosing shortest paths for all e2e links causes over-utilized hot spot nodes in the network. thus, these hot spots have increased traffic that leads to more collisions around them. Consequently, these central nodes become easy targets for malicious attackers whose aim is to harm the network's performance as efficiently as possible. To address this, we propose a routing framework (CentAir) that utilizes eigenvector centrality measures of the network nodes to fine-tune their transmission power. then, it employs D* Lite path -finding algorithm to determine optimal e2e routes under varying network load. As a result, CentAir achieves up to 132% more channel capacity of e2e links compared to shortest path routing algorithms. Additionally, it shows 41 % less throughput degradation when jammers are present.

关键词： Flying Ad Hoc Networks Software-Defined Networks Graph theory D* Lite Algorithm Routing

来源：评论

学校读者我要写书评

暂无评论

A Novel distributed Context-Aware Radio Access technology Selection Scheme For C-ITS Networks 18

A Novel Distributed Context-Aware Radio Access Technology Se...

引用

18th IEEE international Wireless Communications and Mobile computing conference (IWCMC)

作者： Karoui, Mouna Mamadou, Ali Mamadou Chalhoub, Gerard Univ Clermont Auvergne CNRS LIMOS Clermont Ferrand France

ISBN: (纸本)9781665467490

Improving network performances to better support Cooperative intelligent Transport Systems (C-ITS) services has been the subject of renewed efforts by academia and industry. To this end, the availability of multiple in-vehicle radio access technologies (RATs) has been exploited. In this paper, we propose a distributed and Context Aware Radio access technology selection (DICART) framework for vehicular networks, formulated as Multi-Criteria Decision-Making (MCDM) problem. A validation methodology is then conducted based on OMNET++ full-stack network simulator to prove the effectiveness of DI CART. Results show the benefits of our proposal under low and high density network configurations, in enhancing network performance perceived by end-users while considering the needs and constraints of used services.

关键词： C-ITS RAT selection LTE-V2X (mode 4) ITS-GS MCDM

来源：评论

学校读者我要写书评

暂无评论

Network-Coding-based Forwarding for LoRaWAN Gateways 18

Network-Coding-based Forwarding for LoRaWAN Gateways

引用

18th IEEE international Wireless Communications and Mobile computing conference (IWCMC)

作者： Al-Awami, Louai King Fahd Univ Petr & Minerals Dept Comp Engn Interdisciplinary Res Ctr Intelligent Secure Syst Dhahran Saudi Arabia

ISBN: (纸本)9781665467490

LoRaWAN is a promising IoT access technology that is growing in popularity. this study addresses the issue of duplicate packets forwarding by LoRaWAN gateways and proposes a novel forwarding scheme to eliminate forwarding duplicate packets by utilizing inter-flow network coding. the proposed scheme is distributed and requires no coordination between gateways. the proposed scheme is evaluated under different network and traffic conditions. the results show that substantial savings can be achieved in bandwidth leading to enhanced scalability of the network without increasing outgoing traffic.

关键词： LoRaWAN LPWAN Network Coding IoT

来源：评论

学校读者我要写书评

暂无评论

Space-Air-Ground-Aqua Integrated intelligent Network: Vision, and Potential Techniques 18

Space-Air-Ground-Aqua Integrated Intelligent Network: Vision...

引用

18th IEEE international conference on Mobility, Sensing and Networking (MSN)

作者： Huang, Jinhui Yin, Junsong Wang, Shuangshuang Acad Mil Sci Beijing Peoples R China

ISBN: (纸本)9781665464574

the space-air- ground- aqua integrated network will become the basic form of the next generation network. Various technologies, including artificial intelligence, big data, cloud computing, edge computing, etc., will be deeply integrated into the network to form an integrated intelligent network of land, sea, air and space. In this article, we will present the vision for the development of the space-air-ground-aqua integrated intelligent network and describe its main features. We put forward a network architecture which integrated sub-networks of space, air, land and sea while emphasizing network interconnection, resources sharing, cooperative control and service reuse. We also discussed several promising technologies, including the thz, free space optical communication, software defined network, network function virtualization, edge intelligent, digital twins, physical layer security and blockchains.

关键词： space-air-ground-aqua integrated network artificial intelligence edge computing thz free space optical communication

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Graph Realizations in the Congested Clique, Revisited 19th

Fault-Tolerant Graph Realizations in the Congested Clique, R...

引用

19th international conference on distributed computing and intelligent technology (icdcit)

作者： Kumar, Manish Indian Stat Inst Kolkata India

ISBN: (纸本)9783031248474;9783031248481

We study the graph realization problem in the Congested Clique in a distributed network under the crash-fault model. We focus on the degree-sequence realization, each node v is associated with a degree value d(v), and the resulting degree sequence is realizable if it is possible to construct an overlay network with the given degrees. this paper focuses on the message and round complexity of deterministic graph realization in the anonymous network. It has been shown by Kumar et al. [ALGOSENSORS 2022] that the graph realization can be solved using O(n(2)) message and O(f) round without the knowledge of f, of which f nodes could be faulty (f < n). However, their algorithm works for KT1 (Knowledge Till 1 hop) model where nodes know their neighbors' IDs;or in the KT0 (Knowledge Till 0 hop) model, in which each node knows the IDs of all the nodes in the clique, but doesn't know which port is connecting to which node-ID. In this paper, we extend the result to KT0 when the network is anonymous, i.e., the IDs of the neighboring nodes are unknown. We present an algorithm that solves the graph realization problem in the KT0 model with matching performance guarantees as in the KT1 model.

关键词： Graph realizations Congested-Clique distributed algorithm Fault-tolerant algorithm Crash fault Time complexity Message complexity

来源：评论

学校读者我要写书评

暂无评论

Towards Bat Bio-inspired Decision-making for Task Allocation in Vehicular Fogs 18

Towards Bat Bio-inspired Decision-making for Task Allocation...

引用

18th Annual international conference on distributed computing in Sensor Systems (DCOSS)

作者： Quessada, Matheus S. Lieira, Douglas D. De Grande, Robson E. Meneguette, Rodolfo, I Sao Paulo State Univ UNESP Sao Jose Do Rio Preto SP Brazil Fed Inst Sao Paulo IFSP Catanduva SP Brazil Brock Univ BrockU St Catharines ON Canada Univ Sao Paulo Sao Carlos SP Brazil

ISBN: (纸本)9781665495127

Technological evolutions in intelligent transportation have enabled smart and connected vehicles to support novel safety and infotainment services. the provision of such services is guaranteed with effective sharing and allocation of resources for task offloading and processing. the use of vehicular fogs also helps this process by lowering the latency in communications and the resource share among the fog members. However, allocation in Fogs introduces challenges related to the intermittency of Fog vehicle nodes, clustering, topology changes, and resource allocation problems. the use of metaheuristic algorithms has been explored in several works to solve these optimization problems, such as resource allocation, clustering, task allocation, and network communications, especially regarding efficiency. We thus propose a bat bio-inspired decision-making algorithm for task allocation in vehicular fogs called AEGIS. AEGIS uses the cluster members and task parameters to do the decision-making process in the task allocation process that helps to choose the best vehicle of the fog to allocate a determined task. the AEGIS was compared to a GWO approach (meta-heuristic), Greedy, and Random (traditional) approaches. We considered allocated, denied, and lost tasks for the simulation criteria. AEGIS lost fewer tasks than the other algorithms and allocated more tasks than the traditional algorithms.

关键词： intelligent Transportation Systems Vehicular Fog task allocation metaheuristic bio-inspired fogs.

来源：评论

学校读者我要写书评

暂无评论

intelligent Intrusion Detection in Software-Defined Networking: A Comparative Study of SVM and ANN Models 18

Intelligent Intrusion Detection in Software-Defined Networki...

引用

18th international conference on Future Networks and Communications (FNC) / 20th international conference on Mobile Systems and Pervasive computing (MobiSPC) / 13th international conference on Sustainable Energy Information technology (SEIT)

作者： Boukraa, Lamiae Essahraui, Siham El Makkaoui, Khalid Ouahbi, Ibrahim Esbai, Redouane Univ Mohammed Premier Multidisciplinary Fac Nador MASI Lab Oujda Morocco Univ Mohammed Premier Multidisciplinary Fac Nador Oujda Morocco

Software-defined networking (SDN) has emerged as a promising approach for managing network infrastructure through a centralized controller. However, the dynamic nature of SDN makes it susceptible to security threats, including DoS and DDoS attacks. Intrusion detection systems (IDS) based on machine learning (ML) can efficiently detect and mitigate these attacks. this study compares two ML models, namely support vector machines (SVM) and artificial neural networks (ANN), for intelligent intrusion detection in SDN. To assess the performance of the ML models, we utilized the NSL-KDD dataset, with a specific emphasis on DDoS attacks, and compared their accuracy (Acc), precision, recall, and F1-score metrics. the implementation outcomes show that SVM is better than ANN regarding response time and Acc. (c) 2023 the Authors. Published by Elsevier B.V.

关键词： Artificial neural Networks (ANN) distributed denial-of-service (DDoS) Intrusion detection system (IDS) Software-defined networking (SDN) Support vector machines (SVM)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：