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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Coal Thickness Prediction Based on Support Vector Machine Regression

Coal Thickness Prediction Based on Support Vector Machine Re...

引用

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

作者： Li Zhengwei Xia Shixiong Niuqiang Xia Zhanguo School of Computer Science and Technology China University of Mining and Technology Xuzhou Jiangsu China China University of Mining and Technology China

A novel method based on support vector machine for coal thickness prediction through seismic attribute technology is proposed in this paper. Based on SVM which embodies the structural risk minimization principle, the proposed method is more generalized in performance and accurate than artificial neural network which embodies the embodies risk minimization principle. In order to improve prediction accuracy, grid search and cross-validation are integrated in this paper to select SIM parameter. Error analysis of predicting coal thickness is carried out to prove that SIM could achieve greater accuracy than the BP neural network.

关键词： Support vector machines Risk management Artificial neural networks Support vector machine classification Artificial intelligence Learning systems Kernel Equations Software engineering distributed computing

来源：评论

学校读者我要写书评

暂无评论

Research on Topology Discovery for IPv6 networks

Research on Topology Discovery for IPv6 Networks

引用

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

作者： Junhai Luo Mingyu Fang Danxia Ye University of Electronic Science and Technology of China China

With some new features introduced by IPv6 network, such as a wider address space, a different scope based on addressing scheme, a modified protocol field and so on, IPv6 topology discovery faces some challenging problems. And many of topology discovery algorithms developed to collect IPv4 network topology information can not be readily applied to IPv6 network. In this paper, a few problems generated by IPv6 network, some methods and algorithms for IPv6 network topology discovery are discussed in detail. Their advantages and disadvantages are fully summarized. Finally, the new problems and some suggestions for the research work are put forward.

关键词： Network topology Circuit topology Space technology Protocols Spine Software engineering Artificial intelligence distributed computing Computer science Testing

来源：评论

学校读者我要写书评

暂无评论

Secure Routing for Mobile Ad Hoc networks

Secure Routing for Mobile Ad Hoc Networks

引用

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

作者： Jing Liu Fei Fu Junmo Xiao Yang Lu People''s Liberation Army University of Science and Technology China

Buttyan found out a security flaw in Ariadne (Y.C. Hu, A. Perrig, andD. B. Johnson, "Ariadne: a secure on-demand routing protocol for ad hoc networks," in Proc. of the Eighth ACM hitl Conf. on Mobile computing and Networking (*** 2002), pp.23-28. Atlanta, GA.2002.) and proposed a secure routing protocol, EndairA (L. Buttyan, and I. Vajda, "Towards provable security for ad hoc routing protocols", in Proc. of the 2nd ACM Workshop on Security of ad hoc and Sensor networks, 2005 and G. Acs, L. Buttyan, and I. Vajda, "Provably secure on-demand source routing in mobile ad hoc networks," IEEE Transactions on Mobile computing, Vol. 5, No. 11, November 2006.), with the ability to resist active-1-1 attacks. But unfortunately we discover an as yet unknown active-0- 1 attack which we call man-in-the-middle attack and EndairA couldn 't resist. Accordingly we propose a new secure routing protocol, EndairALoc. Analysis shows that EndairALoc can resist not only active-1-1 attacks but also the wormhole attack. Furthermore EndairALoc uses pairwise secret keys instead of public keys used in EndairA. Compared with EndairA, EndairALoc can save more energy in the routing establishment.

关键词： Mobile ad hoc networks Routing protocols Resists Security Public key Cryptography Software engineering Artificial intelligence distributed computing Programmable logic arrays

来源：评论

学校读者我要写书评

暂无评论

Modeling Cooperative Problem Solving Process with Extended Alternating-time Temporal Logic

Modeling Cooperative Problem Solving Process with Extended A...

引用

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

作者： Zhengyuan Ning Xianwei Lai Shanli Hu Qingqing Zhan Computer and Information College Fujian Agriculture and Forestry University China Department of Computer Science and Technology Fuzhou University China

The paradigm example of social interaction is cooperative problem solving, in which a group of autonomous agents choose to work together to achieve a common goal. In order to improve existing work on developing formal computing model for cooperative problem solving in multi-agent systems, several efforts are made in this paper. Firstly, a new multi-agent cooperation logic called ATI-BDI designed in our previous work is enhanced so as to make it more suitable for modeling cooperative problem solving. Secondly, basing on ATI-BDI, the cooperative problem solving process is formally described. The corresponding new computing models of cooperation recognition, team formation, plan formation and execution are developed. The iteration of these steps is also well considered. Several important properties are gained and proved finally.

关键词： Problem-solving Logic design Artificial intelligence distributed computing Autonomous agents Multiagent systems Contracts Protocols Software engineering Computer networks

来源：评论

学校读者我要写书评

暂无评论

Mining of Reuse Patterns in CDMA Network Optimization

Mining of Reuse Patterns in CDMA Network Optimization

引用

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

作者： Wen Ye Hongxu Cui School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing China

CAP, a classical problem in cellular mobile communication networks such as GSM/GPRS or CDMA cellular mobile networks, refers to assigning a limited number of available channels to many mobile voice or data users while minimizing electromagnetic interferences. Most existing researches on CAP focus mainly on channel separation constraints, but pay little attention to geometric constraints defined by reuse patterns that is of great value in engineering applications. An extended CAP model named RCAP (reuse-pattern-oriented CAP) is proposed, which takes account of both of these two constraints. A systematic solution to RCAP is elaborated, which includes two sequential steps, i.e., partition of reuse groups and channel assignment in the groups. Partition of reuse groups is reduced to subgraph isomorphism and can be tackled by subgraph mining while channel assignment in groups is solved in a heuristic manner. The effectiveness of RCAP and its solution was verified by three benchmarks. RCAP was applied to PN offsets assignment in the CDMA networks in several cities of Liaoning Province, and a case study is illustrated in the paper. These results indicate that the proposed RCAP scheme is a very promising solution to channel assignment problems in practical CDMA networks.

关键词： Multiaccess communication Interference constraints GSM Ground penetrating radar Cellular networks Mobile communication Mobile computing Electromagnetic interference Electromagnetic compatibility and interference Electromagnetic compatibility

来源：评论

学校读者我要写书评

暂无评论

Message Dissemination under the Multicasting Communication Mode

Message Dissemination under the Multicasting Communication M...

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Teofilo F. Gonzalez Department of Computer Science University of California Santa Barbara USA

We discuss algorithms, complexity issues, and applications for message dissemination problems under the multicasting communication mode. These problems arise while executing in a parallel or distributed computing environment iterative methods for solving scientific computation applications, dynamic programming procedures, sparse matrix multiplication, etc. Our message communication problems also arise when disseminating information over ad-hoc wireless networks. Given a communication environment and a set of messages that need to be exchanged, the message dissemination problem is to find a schedule to transmit all the messages in the least total number of communication rounds. Generating an optimal communication schedule (with the least total number of communication rounds) for message dissemination problems over a wide range of communication environments is an NP-hard problem. To cope with intractability efficient message dissemination approximation algorithms have been developed for different types of communication environments and message communication patterns (the communications that must take place). The communication environment consists of the communication network (the direct communications allowed for each processor), primitive operations (the basic communication operations allowed by the system), and the communication model (possible operations during each communication round or step). Our goal is to present scattered research results developed during the last decade to establish that the multicasting (one-to-many) communication environment is a powerful communication primitive that allows for solutions that are considerable better than those achievable under the telephone (or one-to-one) communication environment. The multicasting communication environment has been available for quite some time in parallel computing systems. We also establish that, within the multicasting communication mode, forwarding plays an important role by allowing solutions that a

关键词： distributed computing Multicast algorithms Iterative algorithms Iterative methods Computer applications Concurrent computing Dynamic programming Sparse matrices Wireless networks Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance Comparison of IDS Models with Multilayer Perceptron and Radial Basis Function networks

Fault Tolerance Comparison of IDS Models with Multilayer Per...

引用

international Joint conference on Neural networks (IJCNN)

作者： Masayuki Murakami Nakaji Honda Department of Systems Engineering University of Electro-Communications Chofu Tokyo Japan

The ink drop spread (IDS) method is a modeling technique developed by algorithmically mimicking the information-handling processes of the human brain. This method is a new paradigm of soft computing. The structure of IDS models is similar to that of artificial neural networks: they comprise distributed processing units. The beneficial property of fault tolerance is obtained when such parallel processing networks are implemented with dedicated hardware. This paper compares the IDS models with multilayer perceptron and radial basis function networks in terms of fault tolerance. The experimental results based on stuck-at fault tests reveal that the IDS models possess good fault tolerance.

关键词： Fault tolerance Intrusion detection Multilayer perceptrons Radial basis function networks Ink Brain modeling Humans Artificial neural networks distributed processing parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Quick Algorithm for computing Core Based on the Positive Region

A Quick Algorithm for Computing Core Based on the Positive R...

引用

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

作者： Wei-Dong Cai Zhang-Yan Xu Wei Song Bing-Ru Yang School of Information Engineering University of Science and Technology Beijing Beijing China School of Information Science and Engineering University of Ji'nan Jinan China Department of computer Guangxi Normal University Guilin China

Some scholars provided the discernibility matrix based on the positive region. The time complexity of the algorithm for computing core with this discernibility matrix is O(|CparU| 2 ). For cutting down the time complexity of the algorithm, the definition of simplified discernibility matrix based on the positive region and the corresponding definition of the core are provided. At the same time, it is proved that this core is equivalent to the core based on the positive region. Since the partition of U/C is the key process for computing simplified discernibility matrix, a quick algorithm for computing U/C is designed with the idea of radix sorting. Its time complexity is O(|CparU|). On this condition, a new algorithm for computing core based on the positive region is designed with the simplified discernibility. Its time complexity is cut down to max{O(|CparU' pos parU/C|), O(|CparU|)}.

关键词： Partitioning algorithms Decision making Artificial intelligence distributed computing Partial response channels Algorithm design and analysis Computer networks Concurrent computing Sorting Set theory

来源：评论

学校读者我要写书评

暂无评论

A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP

A (t, n)-Threshold Verified Multi-secret Sharing Scheme Base...

引用

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

作者： Ruanhua Shi Hong Zhong Liusheng Huang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China Department of Computer Science and Technology University of Science and Technology Hefei China

In this article, we propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconstruction and requires less public values than Chien's [7] and Yang's schemes. Furthermore, the shares in our scheme can be verified their validity with t public values based on ECDLP, and there are two verified forms: one is computationally secure as Feldman 's scheme [12] and other is unconditionally secure as Pedersen's scheme [13]. In addition, for the main computation: a i,1 P 1 + a i,2 P 2 + hellip + a i,t P t in our scheme, we present a new method based on the signed factorial expansion and implement it, the results show that it is more efficient than the current public methods. Thus our scheme is a secure and efficient (t,n) threshold verified multi-secret sharing scheme.

关键词： Elliptic curve cryptography Equations Artificial intelligence distributed computing Elliptic curves Public key cryptography Software engineering Laboratories Intelligent networks Computer networks

来源：评论

学校读者我要写书评

暂无评论

A Numerical Prediction Product FNN Prediction Model Based on Condition Number and Analog Deviation

A Numerical Prediction Product FNN Prediction Model Based on...

引用

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

作者： Long Jin Xvming Shi Guangxi Research Institute of Meterological Disasters Mitigation Nanning Guangxi China

Aiming at the problem that the fuzzy neural network (FNN) technique itself does not provide the input matrix to the FNN prediction model, we present a prediction modeling methodology which combines the computation and analysis of condition number with FNN, and design the computation and analysis of analog deviation for the input matrix to choose samples close correlated with predictand as training samples, thus effectively reducing the scale of network and evidently enhancing the prediction ability of the FNN prediction model. Using the same CMA T213 and Japanese numerical prediction product (NPP) data, we performed the contrast experiments and analyses of the FNN prediction model for daily regional mean precipitation based on condition number and analog deviation against the condition number-FNN prediction model and the traditional stepwise regression prediction model, and results show that under the condition of the same number of selected predictors, the prediction accuracy of the FNN prediction model based on condition number and analog deviation is 12.6% higher than that of the stepwise regression model in the experiment of independent samples of 49 days.

关键词： Predictive models Fuzzy neural networks distributed computing Analog computers Biological system modeling Weather forecasting Computer networks Concurrent computing Atmospheric modeling Mathematical model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：