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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是2141-2150 订阅

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

详细简洁

排序：

MARC: A Many-Core Approach to Reconfigurable computing

MARC: A Many-Core Approach to Reconfigurable Computing

引用

international conference on Reconfigurable computing and FPGAs (ReConFig)

作者： Ilia Lebedev Shaoyi Cheng Austin Doupnik James Martin Christopher Fletcher Daniel Burke Mingjie Lin John Wawrzynek Department of EECS University of California Berkeley CA USA

We present a Many-core Approach to Reconfigurable computing (MARC), enabling efficient high-performance computing for applications expressed using parallel programming models such as OpenCL. The MARC system exploits abundant special FPGA resources such as distributed block memories and DSP blocks to implement complete single-chip high efficiency many-core micro architectures. The key benefits of MARC are that it (i) allows programmers to easily express parallelism through the API defined in a high-level programming language, (ii) supports coarse-grain multithreading and dataflow-style fine-grain threading while permitting bit-level resource control, and (iii) greatly reduces the effort required to re-purpose the hardware system for different algorithms or different applications. A MARC prototype machine with 48 processing nodes was implemented using a Virtex-5 (XCV5LX155T-2) FPGA for a well known Bayesian network inference problem. We compare the runtime of the MARC machine against a manually optimized implementation. With fully synthesized application-specific processing cores, our MARC machine comes within a factor of 3 of the performance of a fully optimized FPGA solution but with a considerable reduction in development effort and a significant increase in retarget ability.

关键词： Field programmable gate arrays Instruction sets Kernel Random access memory Hardware Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Method of improving the man machine communication in real-time distributed systems

Method of improving the man machine communication in real-ti...

引用

conference on Human System Interactions, HSI

作者： Miroslaw Hajder Tomasz Bartczak Rzeszow University of Information Technology and Management Poland

ISBN: (纸本)9781424475605;9781424475629

This paper presents a new method to improve the quality of man machine communication in distributed systems and networks, in which a significant portion of traffic is multimedia traffic. Method is to use a soft short packets and packet multimedia services. Justified the choice of service time as a parameter evaluating the effectiveness of proposed solutions and an appropriate mathematical model. Using simulation studies determined the intensity of information flow, for which method is appropriate.

关键词： Man machine systems Real time systems Telecommunication traffic Traffic control Quality of service Communication system traffic control Computer networks Telecommunication computing Protocols Technology management

来源：评论

学校读者我要写书评

暂无评论

Behavioural Correlation for Detecting P2P Bots

Behavioural Correlation for Detecting P2P Bots

引用

international conference on Future networks, ICFN

作者： Yousof Al-Hammadi Uwe Aickelin The Intelligent Modelling & Analysis Research (IMA) School of Computer Science and Information Technology University of Nottingham Nottingham UK

ISBN: (纸本)9781424456666;9780769539409

In the past few years, IRC bots, malicious programs which are remotely controlled by attackers through IRC servers, have become a major threat to the Internet and for users. These bots can be used in different malicious ways such as issuing distributed denial of services attacks to shut down other networks and services, keystrokes logging, spamming, traffic sniffing cause serious disruption on networks and users. New bots use peer to peer (P2P) protocols start to appear as the upcoming threat to Internet security due to the fact that P2P bots do not have a centralized point to shutdown or trace back, thus making the detection of P2P bots is a real challenge. In response to these threats, we present an algorithm to detect an individual P2P bot running on a system by correlating its activities. Our evaluation shows that correlating different activities generated by P2P bots within a specified time period can detect these kind of bots.

关键词： Internet Protocols Peer to peer computing Information analysis Computer science Information technology Network servers Web server Command and control systems

来源：评论

学校读者我要写书评

暂无评论

A Peer-to-Peer RFID Resolution Framework for Supply Chain Network

A Peer-to-Peer RFID Resolution Framework for Supply Chain Ne...

引用

international conference on Future networks, ICFN

作者： Safal Shrestha Dong Seong Kim Seulki Lee Jong Sou Park Department of Computer Engineering Korea Aerospace University Goyang South Korea Department of Electrical and Computer Engineering Duke University Durham USA

ISBN: (纸本)9781424456666;9780769539409

In a supply chain network, having up-to-date and prompt information is very crucial for minimizing, the bullwhip effect, inventory cost, out of stocks and time/cost of information sharing. Supply chain management is highly involved and complex process involving collaboration and information sharing between distributed partners. With the advent of RFID and new Internet technologies, supply chain management process has been significantly streamlined. However, one of the major challenges in RFID based supply chain management is resolving the data stored in the RFID tags to the actual location of the data in the network. In this paper we evaluate several established techniques of RFID resolution in supply chain network and then propose a simple, yet novel approach for resolving RFID code to the actual data on the distributed supply chain network. The proposed approach is based on peer-to-peer (P2P) network, where each participant of supply chain is a node in the P2P network. These nodes form a structured P2P overlay network with each node having a partial view of other nodes. These nodes then act collaboratively in resolving RFID data and sharing business information.

关键词： Peer to peer computing Radiofrequency identification Supply chains Supply chain management Collaboration Computer networks Time sharing computer systems Aerospace engineering Costs Network servers

来源：评论

学校读者我要写书评

暂无评论

Distribution of the Node Degree in MANETs

Distribution of the Node Degree in MANETs

引用

international conference on Next Generation Mobile Applications, Services and Technologies (NGMAST)

作者： Lifang Guo Khaled Harfoush Huimin Xu School of Telecommunication Engineering Beijing University of Posts and Telecommunications Beijing China Department of Computer Science North Carolina State University Raleigh NC USA

This paper derives analytical expressions for the probability of link availability and the node degree distribution in mobile ad hoc networks. The expressions (1) account for system parameters such as the node density, node transmission range, and the radio channel fading; and (2) hold for an arbitrary mobility model with initially uniformly distributed spatial nodes that are allowed to move only within a certain bounded area. We validate the efficacy of our expressions through simulations of the SMS mobility model. Our results reveal that the node degree distribution follows a binomial distribution regardless of the initial distribution of nodes' location. The results presented in this paper are useful in studying the connectivity of mobile nodes, in estimating the capacity of mobile ad hoc networks, and provide a good understanding of the impact of fundamental network parameters in the presence of mobility.

关键词： Fading Mobile communication Mathematical model Ad hoc networks Mobile computing Wireless communication Equations

来源：评论

学校读者我要写书评

暂无评论

A novel approach for trade-off between computation and communication cost in wireless sensor networks

A novel approach for trade-off between computation and commu...

引用

international conference on Advanced Communication Technology (ICACT)

作者： Narges Arastouie Masoud Sabaei Hosseinali Shirali Shahreza Computer Engineering & Information Technology Department Amirkabir University of Technology슠 Tehran Iran

ISBN: (纸本)9781424454273;9788955191455

Wireless sensor networks consist of nodes with severe energy constraints and thus, they must use energy saving algorithms in different layers. Despite the prior work, the computational cost in a wireless sensor network is usually neglected compared to the communication cost; it may not admit to in which large volumes of data packets are being transmitted, such as those cases in which This packets are video frames captured by video sensor nodes. In this paper, we consider the problem of minimizing the communication needed to send readings from a set of sensors to a single destination with obtaining a trade-off between computation and communication energy. We propose a centralized as well as a distributed algorithm. In the former, the sink node and in the latter, each node endeavors to reduce network energy consumption adaptively, making a trade-off between data compression at the appropriate level and sending row data. The data compression technique used is dependent on the application type and considers spatial correlation. Comparing the simulation results of our approach with similar work, without consideration of trade-off between computation and comparison, shows significant improvement in energy saving of the network.

关键词： Computer networks Computational efficiency Wireless sensor networks Costs Energy consumption distributed algorithms Data compression Military computing Video compression Aggregates

来源：评论

学校读者我要写书评

暂无评论

The Power of Orientation in Symmetry-Breaking

The Power of Orientation in Symmetry-Breaking

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： Satya Krishna Pindiproli Kishore Kothapalli Center of Security Theory and Algorithmic Research (CSTAR) International Institute of Information Technology Hyderabad India

ISBN: (纸本)9781424466955;9780769540184

Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets, and the like. Deterministic algorithms for symmetry breaking that run in a polylogarithmic number of rounds are not known. However, randomized algorithms that run in poly-logarithmic number of rounds are known starting from Luby's algorithm. Recently, orientation on edges was considered and it was shown that an O(Δ) coloring of the vertices of a given oriented graph can be arrived at using essentially O(log Δ + √log n) bits of communication. In this paper we further demonstrate the power of orientation on edges in symmetry-breaking. We present efficient algorithms to construct fractional independent sets in constant degree graphs using very low order communication between the vertices. For instance, we show that in bounded degree graphs and planar graphs, it is possible to construct a fractional independent set by exchanging O(1) bits. Further, we present algorithms to construct maximal independent sets in bounded degree graphs and oriented trees. Our algorithm for constructing an MIS of an oriented tree uses only O(log n) bits of communication.

关键词： distributed algorithms distributed computing Tree graphs Information security Information technology Message passing Nominations and elections Scheduling algorithm Processor scheduling Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Communication delay analysis based on network calculus

Communication delay analysis based on network calculus

引用

international conference on Software Technology and Engineering (ICSTE)

作者： Yufei Lin Xinhai Xu Yisong Lin National Laboratory of Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424486670

Network calculus is a promising theory for analyzing and modeling networks based on min-plus algebra. Using network calculus theory, we propose formulas of arrival curve and service curve for end-to-end communication, build the corresponding time model, and derive the communication delay formulas for two scenarios of the model respectively. Then we take fat tree topology, which is widely used in Infiniband interconnection, as an example to analyze the delay of one-to-all broadcast. This paper, as a groundwork, provides a new approach for the network researchers to delve communication delay in future researches.

关键词： Delay Calculus Bandwidth Algebra Computational modeling Topology Analytical models

来源：评论

学校读者我要写书评

暂无评论

Improved SOM-based distributed range-free localization for mobile sensor networks

Improved SOM-based distributed range-free localization for m...

引用

international conference on Communication Systems

作者： Pham Doan Tinh Makoto Kawai Graduate School of Science and Engineering Ritsumeikan University Kusatsu Shiga Japan

Recent researches in mobile wireless ad-hoc and mobile sensor networks have shown the importance of location information from nodes participating in the networks. Although nodes with GPS-equipped device (anchor nodes) can be deployed in those networks to obtain the location information from nodes, researchers are interested in solving localization in networks that have a small fraction of anchor nodes deployed due to the high cost and energy expenditure of GPS devices and indoor environments. Most of existing researches focus on static networks, and only a few researches focus on mobility problem of practical scenarios. Localization schemes dealing with mobility problem usually apply the sequential Monte Carlo algorithm to solve the mobility problem and they put high computational load on network nodes. This paper proposes a solution to improve our existing method that is based on Self-Organizing Maps (SOM) to make it adaptive to high mobility of nodes. The proposed solution improves the location estimation of nodes by combining location estimation based on previous observations with new information observed in the current step during SOM learning. Simulation results from both purpose-built program and network simulator 2 (NS-2) confirm the effectiveness of the proposed solution.

关键词： Mobile communication Mobile computing Ad hoc networks Robot sensing systems Estimation Wireless sensor networks Throughput

来源：评论

学校读者我要写书评

暂无评论

A New Time Optimizing Probabilistic Load Balancing Algorithm in Grid computing

A New Time Optimizing Probabilistic Load Balancing Algorithm...

引用

2010 2nd international conference on Computer Engineering and Technology(2010年第二届计算机工程与技术国际会议 ICCET 2010)

作者： Mohsen Moradi Mashaala Abbasi Dezfuli Mohammad Hasan Safavi Department of computer Islamic Azad UniversityBeyzaFarsIran Department of computer Islamic Azad University Science and Research of Khozestan Iran Department of Computer and ITEngineering Amirkabir University of TechnologyTehranIran

ISBN: (纸本)9781424463473;9781424463497;9781424463503

The computing grid is a distributed parallel processing system that share and choosing resources dynamically and provide need of user operation power,cost and quality. grid management resources does as a diagnostic and assigning resources scheduling and resource monitoring in grid. Scheduling process directs tasks to suitable resources. It must take place some how that load work distributed equally on resources to get the maximum interest out of existed resource,establishing load balancing is one the important performance factors in grid resource management efficiency. in this paper,loading indexes and new resource conditions in accordance with synchronous neighbourhood was suggested and also for resource allocation,a model in accordance with tree and probabilistic scheduling algorithm with load balancing purpose was suggested,that in this algorithm workclass,cost,deadline and herd behaviour have considered. Probabilistic algorithm chooses the resources that have better past and least completion time And leave the duties to it,in case of execution or non-execution on the resource the source will give a reward or punishment. The main purpose of this algorithm is establishing load balancing and reducing the response time and task failure percentage.

关键词： computing grid:load balancing:tree model probable

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 211 212 213 214 215 216 217 218 219 220 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：