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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,317 篇 会议
46 篇 期刊文献
30 册 图书

馆藏范围

2,393 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,393 篇 工学
- 1,180 篇 计算机科学与技术...
- 600 篇 软件工程
- 296 篇 信息与通信工程
- 175 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 41 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
237 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
120 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
88 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
78 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,386 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2393 条记录，以下是2241-2250 订阅

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

详细简洁

排序：

A Deep Learning-based Innovative Approach for Enhancing the Precision of Tool Wear Prediction 8

A Deep Learning-based Innovative Approach for Enhancing the ...

引用

8th international conference on Communication and Electronics Systems, ICCES 2023

作者： Vinod, D. Syed, Karimulla Sampath Kumar, S. Babu, B. Sankara Pandey, Shatrudhan Loganathan, Raja Velur Srm Institute of Science and Technology School of Computing College of Engineering and Technology Department of Computing Technologies SRM Nagar Kattankulathur Chennai India Koneru Lakshmaiah Education Foundation 522501 India Sri Eshwar College of Engineering Computer Science and Engineering Coimbatore India Department of Cse Telangana Bachupally India Birla Institute of Technology Department of Production and Industrial Engineering Mesra Ranchi835215 India Loyola Institute of Technology Department of Mechanical Engineering Chennai India

ISBN: (纸本)9798350396638

Throughout the cutting operation, among the most crucial steps is that has a direct impact on machining accuracy and product quality is tool wear. If you can accurately forecast how quickly tools will wear out, you can make the necessary adjustments early on, minimizing downtime and maximizing product quality. The evaluation of cutting tool wears during the production stage is crucial. The main objective of this study is to track tool degradation over time to guarantee regular tool changes and prevent workpiece waste and potential machine damage from excessive tool wear or unexpected tool breakage. For this reason, it is necessary to develop a system that is both intelligent and capable of providing accurate solutions to these issues. The criteria of intelligent production are great, though, and traditional methods simply cannot match them. Because of this, a deep learning-based innovative approach is presented to advance the precision of tool wear prediction. parallel convolutional neural networks were constructed and used to achieve multi-scale feature fusion. To improve the model's efficiency, the channel attention mechanism was integrated with the residual connection to take into account the relative importance of each feature map. To prove that the created approach is superior, several experiments were carried out to anticipate tool wear, and the findings are more reliable and accurate than those obtained using existing methods. To guarantee the excellence of the engine cylinder and the steadiness of the machining procedure, a tool wear monitoring system was created. Using the PHM 2010 milling cutter wear dataset, tests were performed to validate the model effect. Based on the experimental data, this model has an average RMSE of 2.67 and an average MAE of 2.5. The trial outcomes proved the effectiveness of the suggested approach in evaluating the tool's wear. © 2023 IEEE.

关键词： Cutting tools

来源：评论

学校读者我要写书评

暂无评论

A Promotion Mechanism for Scalable Stealth DHT

A Promotion Mechanism for Scalable Stealth DHT

引用

international conference on Internet and Web Applications and Services (ICIW)

作者： Idris A. Rai Department of Networks Makerere University Kampala Uganda

ISBN: (纸本)9781424467280;9780769540221

Most distributed Hash Tables (DHTs) inherently assume interconnecting nodes with homogeneous capabilities. Realistically however, capabilities of nodes on a network widely vary, leading traditional DHTs to inevitably exhibit poor performance in real-world environments. Stealth DHT was previously proposed to address node heterogeneity by enabling a DHT to separate highly capable (super-peers or service) nodes from less capable (stealth) nodes. Stealth DHTs are considered robust and flexible due to the way they organize nodes on the network. However, it is difficult to over-provision the number of service nodes to support unexpected increase in user requests in the networks. Unlike traditional DHTs therefore, Stealth DHTs cannot guarantee network scalability. In this paper, we address this problem by proposing a simple promotion mechanism to extend Stealth DHT to use stealth nodes as back-up resources that it can use when the network is overloaded. We define promotion of stealth nodes as the act of enabling stealth nodes execute some or all of the operations of service nodes. Experiments results show that the proposed promotion mechanism can offload significant proportion of network load.

关键词： Peer to peer computing Scalability Routing Large-scale systems IP networks Web and internet services Robustness Delay Bandwidth Protocols

来源：评论

学校读者我要写书评

暂无评论

Fairness-oriented Overlay VPN topology construction

Fairness-oriented Overlay VPN topology construction

引用

international conference on Telecommunications (ICT)

作者： A. Detti A. Caricato G. Bianchi Electronic Engineering Department University of Roma Tor Vergata Italy

An important issue in dynamically constructed Virtual Private networks (VPN) is how the overlay topology is created and maintained. Classical VPN topologies, such as hub-and-spoke or full-mesh, fail to remain convenient and viable when the number of nodes grows to as little as a few tens. Convenient topology formation mechanisms should be distributed, should permit incremental and dynamic operations, and should limit the number of nodes a new entry connects with. In this work, we show that approaches devised to create “short” networks, while yielding a significant total network throughput, may be severely affected by unfairness issues, i.e., different pair of nodes may experience a widely different throughput performance. Hence, we introduce a fairness-oriented topology formation algorithm for VPN. The proposed algorithm is incremental, meaning that the addition of a new node to the overlay topology does not imply rewiring of already established overlay links. Simulation results show that our proposed approach achieves high fairness levels, as quantified in terms of well known Jain's fairness index, meanwhile retaining satisfactory throughput performance.

关键词： Virtual private networks Peer to peer computing Telecommunication network topology Throughput Network topology Circuit topology Tunneling Maintenance engineering Signal processing Protection

来源：评论

学校读者我要写书评

暂无评论

Cooperative Routing Approach for ISP-Provided Content Delivery Service Using Hierarchical DHT

Cooperative Routing Approach for ISP-Provided Content Delive...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Kyounghee Jung Dohyun Kim Younghee Lee Division of Media Technology Media Business Center KT Corporation South Korea Department of Information and Communication Engineering KAIST South Korea Department of Computer Science KAIST South Korea

This paper suggests ISP-provided content delivery service that provides fine-grained locality and exploits network status in content routing to overcome the dilemma from current content delivery technology like P2P. Hierarchical DHT provides an efficient and scalable distributed data service architecture and it is able to achieve high level of locality over ISP network which has a hierarchical topology in general. However, simple implementation of it into ISP network imposes several issues: long query length, overloading, and the ignorance of network status in routing which is one of strengths of ISP-provided service. In order to resolve the aforementioned issues, this paper introduces network domain heuristic based merging and dynamic cost-based cooperative routing that exploits service load and network cost together. According to simulation based evaluation, our proposed approach achieves around 40% shorter latency in both delivery and query. Furthermore, it can alleviate overloading and content delivery through contested path efficiently.

关键词： Routing Peer to peer computing Merging Network topology Topology IP networks Servers

来源：评论

学校读者我要写书评

暂无评论

Towards Plugging Privacy Leaks in the Domain Name System

Towards Plugging Privacy Leaks in the Domain Name System

引用

international conference on Peer-to-Peer computing

作者： Y. Lu G. Tsudik Computer Science Department University of California Irvine USA

Privacy leaks are an unfortunate and an integral part of the current Internet domain name resolution. Each DNS query generated by a user reveals -- to one or more DNS servers -- the origin and the target of that query. Over time, users' communication (e.g., browsing) patterns might become exposed to entities with little or no trust. Current DNS privacy leaks stem from fundamental features of DNS and are not easily fixable by simple patches. Moreover, privacy issues have been overlooked by DNS security efforts (such as DNSSEC) and are thus likely to propagate into future versions of DNS. In order to mitigate privacy issues in DNS, this paper proposes a Privacy-Preserving DNS (PPDNS), that offers privacy during domain name resolution. PPDNS is based on distributed hash tables (DHTs), an alternative naming infrastructure, and computational private information retrieval (cPIR), an advanced cryptographic construct. PPDNS takes advantage of the DHT index structure to provide name resolution query privacy, while leveraging cPIR to reduce communication overhead for bandwidth-sensitive clients. Our analysis shows that PPDNS is a viable approach for obtaining a reasonably high level of privacy for name resolution queries. PPDNS also serves as a demonstration of blending advanced systems techniques with their cryptographic counterparts.

关键词： Servers Privacy Peer to peer computing IP networks Databases Security Book reviews

来源：评论

学校读者我要写书评

暂无评论

A Trust Modeling Framework for Message Propagation and Evaluation in VANETs

A Trust Modeling Framework for Message Propagation and Evalu...

引用

international conference on Information Technology Convergence and Services (ITCS)

作者： Chen Chen Jie Zhang Robin Cohen Pin-Han Ho David R. Cheriton School of Computer Science University of Waterloo Canada School of Computer Engineering Nanyang Technological University Singapore Department of Electrical and Computer Engineering University of Waterloo Canada

In this paper, we present a trust-based message propagation and evaluation framework in vehicular ad-hoc networks where peers share information regarding road condition or safety and others provide opinions about whether the information can be trusted. More specifically, our trust-based message propagation model collects and propagates peers' opinions in an efficient, secure and scalable way by dynamically controlling information dissemination. The trust-based message evaluation model allows peers to evaluate the information in a distributed and collaborative fashion by taking into account others' opinions. Experimental results demonstrate that our proposed framework promotes network scalability and system effectiveness in information evaluation under the pervasive presence of false information, which are the two essentially important factors for the popularization of vehicular networks.

关键词： Relays Vehicles Roads Peer to peer computing Scalability Lead Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Optimization and Implementation of LBM Benchmark on Multithreaded GPU

Optimization and Implementation of LBM Benchmark on Multithr...

引用

international conference on Data Storage and Data Engineering (DSDE)

作者： Xiaoguang Ren Yuhua Tang Guibin Wang Tao Tang Xudong Fang National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424456789;9780769539584

With fast development of transistor technology, Graphic Processing Unit(GPU) is increasingly used in the non-graphics applications, and major GPU hardware vendors have introduced software stacks for their own GPUs, such as Brook+ for AMD GPU. Compared with the traditional parallel systems, heterogeneous systems integerating stream-based multi-threaded GPUs provide higher parallel computing capabilities with lower cost. However, porting traditional applications to the heterogeneous systems makes new demand of application optimization on GPU. Based on the AMD's Brook+ platform, we explored application optimization features on AMD GPU by optimizing and implementing the benchmark LBM from SPEC2006. To improve the program locality, we optimized the original data layout of LBM. Using the short vector data types mechanism provided by Brook+, we also optimized the GPU's bandwidth utilization and its thread processors' efficiency. Through the branch elimination technique, we reduced the performance lose caused by branch divergences in the kernel, which is due to the GPU's SIMD executing mode. The experiment results show that data layout, memory bandwidth, branch paths and other factors have a close effect on the performance of program execution on the GPU. Through all the optimizations, we finally got a speedup of 22x (single-precision) and 19x (double-precision) over the original serial benchmark code on a Quad-core CPU, and a speedup of 4x (single-precision) and 8.7x (double-precision) over the original OMP benchmark code on a 8-core CPU.

关键词： Application software Graphics processing unit parallel processing Computer architecture Biomedical computing Computational fluid dynamics Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Relaying for Multi-Antenna Cooperative Decode-And-Forward Relay networks

Opportunistic Relaying for Multi-Antenna Cooperative Decode-...

引用

IEEE international conference on Communications (ICC)

作者： W. Zeng C. Xiao Y. Wang J. Lu State Key Laboratory on Microwave and Digital Communications Tsinghua National Laboratory of Information Science and Technology Department of Electronic Engineering Tsinghua University Beijing China Department of Electrical & Computer Engineering Missouri University of Science and Technology MO USA

In this paper, we investigate the relaying scheme for multi-antenna cooperative networks without channel state information at the transmitters. It is shown that the classic opportunistic relaying scheme, which allows only one relay node to forward the message, may lead to significant loss when it is extended to the corresponding multi-antenna relay scenarios. A generalized opportunistic relaying approach, which selects more transmit antennas distributed on multiple relay nodes to transmit data simultaneously, is proposed to maximize the network throughput via balancing the source-relay and the relay-destination channels. Numerical examples show the large impact of multiple antennas and relays on the network throughput, and the significant gains obtained through the proposed opportunistic cooperation scheme.

关键词： Decoding MIMO Transmitting antennas Digital relays Peer to peer computing Throughput Laboratories Microwave technology Channel state information Transmitters

来源：评论

学校读者我要写书评

暂无评论

Orthogonal vector based network coding against pollution attacks in n-layer combination networks

Orthogonal vector based network coding against pollution att...

引用

international conference on Communications and Networking in China (CHINACOM)

作者： Bin Dai Shijun Zhang Yipeng Qu Jun Yang Furong Wang Department of Electronic and Information Huazhong University of Science and Technology Wuhan Hubei China

It is proved that combination networks can achieve unbounded network coding gain measured by the ratio of network throughput with network coding to that without network coding in peer-to-peer file sharing system. On the other side, network coding allows the polluted packet generated by a malicious node to corrupt the packets transmission of the entire network. One polluted packet will prevent the other nodes from correct decoding. To settle the problem, we introduce a polluted packets detection method based on multiple vectors orthogonal to the universal set of vectors for the transmitted network coding packets. The main idea of this method is to calculate numbers of orthogonal vectors and send them to different relay nodes and receiver nodes which use them to judge whether the newly received packets are in the subspace based on the source packets. This is a distributed algorithm, without the requirement of an extra secure channel. Through the analysis and simulation in n-layer combination networks case, the computational complexity of the detection algorithm is O(n), n is the packet length, and the detection rate can be greater than 90%.

关键词： Peer to peer computing Network coding Pollution Vectors Relays Security Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Attacker Detection Game in Wireless networks with Channel Uncertainty

Attacker Detection Game in Wireless Networks with Channel Un...

引用

IEEE international conference on Communications (ICC)

作者： W. Wang M. Chatterjee K. Kwiat Electrical Engineering and Computer Science University of Central Florida Orlando FL USA Air Force Research Laboratory Rome NY USA

Identification and isolation of attackers in a distributed system is a challenging problem. This problem is even more aggravated in a wireless network because the unreliable channel makes the actions of the users (nodes) hidden from each other. Therefore, legitimate users can only construct a belief about a potential attacker through monitoring and observation. In this paper, we use game theory to study the interactions between regular and attacker nodes in a wireless network. We model the attacker node detection process as a Bayesian game with imperfect information and show that a mixed strategy perfect Bayesian Nash Equilibrium is attainable. Further, we show how an attacker node can construct a nested belief system to predict the belief held by a regular node. By employing the nested belief system, a Markov Perfect Bayes-Nash Equilibrium is reached and the equilibrium postpones the detection of the attacker node. Simulation results and their discussions are provided to illustrate the properties of the derived equilibria.

关键词： Wireless networks Uncertainty Game theory Peer to peer computing Monitoring Intrusion detection Information security Bayesian methods Data security Communications Society

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 221 222 223 224 225 226 227 228 229 230 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：