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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

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

共 620 条记录，以下是531-540 订阅

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

详细简洁

排序：

Efficient Modular Exponentiation with Three-Moduli (2^{n}±1,2^{n}+3)

Efficient Modular Exponentiation with Three-Moduli (2^{n}±1...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Bangju Wang Huanguo Zhang Yuhua Wang School of Computer Wuhan University of China Wuhan China

Modular exponentiation is the basic computation for most public key cryptosystems and digital signal processing. A new signed binary representation (SBR) of operand is presented, which has less weight than NAF when modulus is one of moduli (2 n plusmn1,2 n +3). The speed of modular squaring with three-moduli (2 n plusmn1,2 n +3) can be improved using the new SBR by reducing partial products and carries. Based on the result, the speed of computation of modular exponentiation using the new SBR may double that of NAF method for some exponents. According to theoretical analyses and experiment comparing to the other methods mentioned in this paper, the new SBR could improve the speed of modular exponentiation efficiently. Moreover, the SBR of integer can be widely used in secure communication and DSP system.

关键词： Arithmetic distributed computing Digital signal processing Computer networks Concurrent computing Public key cryptography Signal processing algorithms Algorithm design and analysis Software engineering Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Using Trust and Reputation Information to Choose Both Request Responders and Servers in Peer-to-Peer networks

Using Trust and Reputation Information to Choose Both Reques...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Yu Jin Zhimin Gu Zhijie Ban College of Science and Technology Inner Mongolia University Hohhot China School of Computer Science and Technology Beijing Institute of Technology Beijing China

In current reputation-based trust models for P2P applications trust and reputation information are mainly used to choose service providers, they are helpless when facing this malicious attack: malicious nodes respond received queries at random in spite of whether it locally has queried resources. Once they are chosen as a provider, they will transmit a fake, even a malicious file. We present a hierarchical, especially reputation-based two-level trust model. In our model trust and reputation information are used to choose both request responders and service providers. So our model can restrain malicious behaviors from the headstream and withstand this attack. Furthermore in our model peers can receive more and better services; trust value in node can be concentrated at a considerable fast speed and malicious nodes can be identified quickly.

关键词： Network servers Peer to peer computing Security Software engineering Artificial intelligence distributed computing Computer science Educational institutions Application software Pollution

来源：评论

学校读者我要写书评

暂无评论

An Efficient Hybrid P2P Incentive Scheme

An Efficient Hybrid P2P Incentive Scheme

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Zhitao Guan Muhammad Hanif Durad Yuanda Cao Liehuang Zhu School of Computer Science and Technology Beijing Institute of Technology China School of Software Beijing Institute of Technology China

P2P systems have suffered a lot from free riding problem i.e. some participants consume more resources than they contribute. In order to deal with this problem efficiently, an incentive model based on peer credit has been proposed. Each peer in this model is a credit entity. Through introducing reward method to the model, peers will allocate resources according to the credits of requesting peers to maximize their own credits. A backtracking algorithm has been suggested to solve the issue of maximizing credit rewards. To avoid inflation of the credit, attenuation method is introduced. The scheme how to apply the credit model in hybrid P2P networks has also been elaborated in this work. The experimental results show that the model can effectively control free riding and improve efficiency of the system.

关键词： Incentive schemes Feedback Peer to peer computing Software engineering Artificial intelligence distributed computing Computer science Resource management Attenuation Game theory

来源：评论

学校读者我要写书评

暂无评论

P2P Trust Model: The Resource Chain Model

P2P Trust Model: The Resource Chain Model

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Sinjae Lee Shaojian Zhu Yanggon Kim Department of Computer and Information Sciences Towson University MD USA

As is well known, computer security has been given more attention; many mechanisms have been developed to increase P2P security like encryption, sandboxing, reputation, and firewall. Among those technologies, reputation mechanism as an active method is especially useful to automatically record, analyze and adjust peers' reputation, trust, histories among the different peers, and this method is suitable for our anonymous and dynamic P2P environment. Therefore, reputation-based trust mechanism is a secure enough reputation system. In this paper, we present a new reputation-based trust management model to prevent the spread of malicious content in the open community using a resource chain model. The main idea of the resource chain model is using a routing table to record the information of nodes' credibility and their recommending nodes' credibility. Therefore, using this model can help us to find the best and safest resource location efficiently and decrease the number of malicious transactions.

关键词： Peer to peer computing Feedback distributed computing Computer security Routing File servers Network servers Software engineering Artificial intelligence Computer networks

来源：评论

学校读者我要写书评

暂无评论

An Experimental Study on Peer Selection in a P2P Network over PlanetLab

An Experimental Study on Peer Selection in a P2P Network ove...

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Fatos Xhafa Leonard Barolli Raul Fernandez Thanasis Daradoumis Department of LSI Polytechnic University of Catalonia Barcelona Spain Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Information Sciences Open University of Catalonia Barcelona Spain

Peer selection is an important aspect in many P2P applications requiring efficient assignment and execution of jobs to peer nodes and search and file transfer, among others. Due to increasing interest of using P2P systems for distributed computing, peer selection is taking relevance and several models have been proposed in the P2P literature. Yet, there are very few experimental studies for peer selection in P2P networks deployed in real large scale networks. In this work we present an experimental study that aims at revealing empirical information about the efficiency of selecting peer nodes in a P2P network when deployed in a real geographically distributed network. To this end, we have used a JXTA-based P2P platform deployed in Planet- Lab, a planetary scale infrastructure, and have empirically evaluated several peer selection models. Our experimental study showed that in order to achieve efficient P2P applications, appropriate selection model should be used according to the characteristics of the application.

关键词： Peer to peer computing distributed computing Large-scale systems Protocols Computer applications Large scale integration Robustness parallel processing Processor scheduling Sun

来源：评论

学校读者我要写书评

暂无评论

First international conference on Complex, Intelligent and Software Intensive System-Title

First International Conference on Complex, Intelligent and S...

引用

international conference on Complex, Intelligent and Software Intensive Systems, CISIS

The following topics are dealt with: wireless networks; grid computing; distributed systems and applications; network performance; MANET; data structure and mathematical modeling; trustworthiness in P2P systems; middl...

关键词：

来源：评论

学校读者我要写书评

暂无评论

A faster closure algorithm for pattern matching in partial-order event data

A faster closure algorithm for pattern matching in partial-o...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Matthew Nichols David Taylor David R. Cheriton School of Computer Science University of Waterloo Canada

When working with large sets of partial-order event data, typically collected by monitoring a distributed application, it is often desirable to search for specific patterns of events within this data. When performing such a search, we must be able to identify temporal relationships between complex sets of events. Searching for hierarchically-specified event patterns requires that a convex-closure algorithm be applied to the partial matches at each stage in the computation and the performance of such a closure algorithm can strongly influence the overall speed of pattern matching. In this paper, we propose improvements to an existing closure algorithm that significantly improve its efficiency, and also briefly discuss other possible approaches for improving performance.

关键词： Pattern matching Application software Interleaved codes Computer science Computerized monitoring Algorithm design and analysis Runtime Computer networks distributed computing Debugging

来源：评论

学校读者我要写书评

暂无评论

A New Inner Congestion Control Mechanism in Terabit Routers

A New Inner Congestion Control Mechanism in Terabit Routers

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Huaxi Gu Kun Wang Chu Ke Changshan Wang Guochang Kang State key Laboratory of ISN Xidian University Xi'an China School of Computer Science Xidian University Xi'an China ZTE Corporation Shenzhen China

Direct interconnection network (DIN) has gained more and more attention when designing the switching fabric in the terabit routers. Various congestion control mechanisms are proposed for DIN when it is employed in the parallel computer systems. However, they all have own shortcomings and are not suitable for fabrics in the terabit routers. Based on the requirements of terabit class routers we propose a new congestion control mechanism in this paper. It uses a new detection criterion, i.e. the length of the source buffer, which is more accurate. Besides, the presence of the real time traffic is considered in particular. No throttling is imposed on such traffic to provide QoS. The input traffic will go into different source queue according to their traffic class. The input queue for the real time traffic will no longer be stopped to provide QoS. Finally, simulations are carried out by OPNET software. The results show that our congestion control mechanism eliminates performance degradation for loads beyond saturation, keeping adequate levels of throughput at high loads.

关键词： Traffic control Fabrics Concurrent computing Throughput Communication system traffic control Internet Multiprocessor interconnection networks Computer networks Communication system control Software engineering

来源：评论

学校读者我要写书评

暂无评论

A Two-phase Flight Data Feature Selection Method Using both Filter and Wrapper

A Two-phase Flight Data Feature Selection Method Using both ...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Liang Zhang Fengming Zhang Yongfeng Hu Engineering Department AFEU Aeronautical Materiel Management Xi'an China

Feature selection is an important issue in flight data mining. By selecting only relevant features of flight data, higher prediction accuracy can be expected and computational complexity can be reduced. In this paper we propose a novel two-phase flight data feature selection approach using both filter and wrapper. It begins by running artificial neural network weight analysis (ANNWA) as a filter approach to remove irrelevant features, then it runs genetic algorithm as a wrapper approach to remove redundant or useless features. We demonstrate the usefulness of the proposed approach on two real- world datasets based on flight data. Our algorithm reduces the size of flight data feature space significantly without compromising the classification or the prediction performance.

关键词： Filters Computer network management conference management Engineering management Aerospace engineering Data engineering Artificial neural networks Genetic algorithms Data mining Military aircraft

来源：评论

学校读者我要写书评

暂无评论

Description of Key Performance Index States based on Cloud Theory and Weight Mean method for Multi-sensor

Description of Key Performance Index States based on Cloud T...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Qiuyu Zhang Lei Sun Yanfeng Jin College of Computer and Communication Lanzhou University of Technology Lanzhou China

Key performance index analysis is a good complementing to the evaluation of past system security states, and the study on it has realistic meanings accordingly. It is realized that cloud theory and the weighted mean method for multi-sensor could qualitatively describe key performance index states. The data gathered from the multi-sensor under normal states will be tested for consistency by using distributing graph method firstly and will come out the fusion of the minimum average mean variance value by using the weighted mean method for multi-sensor secondly. Then the above data fusion will be compared with the key performance index data at every arbitrary moment and each amount of deviation by forgoing compare will be gained. At last the five remark sets constructed from cloud theory combining with the amount of deviation will realize the qualitative description of key performance index states. The experiment result shows the validity of this method.

关键词： Performance analysis Clouds Testing distributed computing Data security Software engineering Artificial intelligence Sun Educational institutions Computer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 50 51 52 53 54 55 56 57 58 59 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：