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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

DNK-WSD: A distributed Approach for Knowledge Discovery in Peer to Peer networks

DNK-WSD: A Distributed Approach for Knowledge Discovery in P...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Giovanni Aiello Marco Alessi Massimo Cossentino Pietro Storniolo Alfonso Urso Research and Development Laboratory Engisud SpA Palermo Italy Research and Development Laboratory Engineering Ingegneria Informatica S.p.A. Palermo Italy ICAR-CNR National Research Council Palermo Italy

Service oriented architectures (SOA) represent a recent proposal to obtain cooperation and interoperability in distributed computing environments. A challenge of SOA is services and resources discovery which can be realized both in centralized and distributed way. The distributed approach involves peer-to-peer (P2P) infrastructures supporting the knowledge distribution among peers. In this paper we propose DNK-WSD, a new network architecture providing an efficient distributed Web service and resource discovery mechanism based on the notification pattern. The DNK network is a peer-to-peer architecture built using the distributed network knowledge (DNK) heuristic which represents a lightweight approach to model graphs mapping logical P2P overlay networks. A case study, regarding the deployment of DNK-WSD for information sharing in real time collaborative Web applications, demonstrates the validity of DNK-WSD in terms of fast propagation of the shared data, low network load and reliability

关键词： Peer to peer computing Web services Service oriented architecture Engines distributed computing Research and development Collaboration Java Robustness Network topology

来源：评论

学校读者我要写书评

暂无评论

Study on distributed and parallel Search Strategy of Shortest Path in Urban Road Network

Study on Distributed and Parallel Search Strategy of Shortes...

引用

international conference on Natural Computation (ICNC)

作者： Hao Yue Chunfu Shao School of Traffic and Transportation Beijing Jiaotong University Beijing China

This paper mainly focuses on distributed and parallel search strategy of shortest path in urban road network, which is motivated by the fact that in the shortest path search in complicated urban road network, the search time consumed will increase sharply with the increase of the number of road network nodes. In the algorithm presented in the paper, the whole search road network is first cut into local sub-search road networks, and connections among each local sub-search road network are established through virtual auxiliary nodes; then searches of the shortest paths in local sub-search road networks are conducted in a parallel manner. Finally, the shortest path search of the whole network is completed on the basis of local and parallel search by the virtual auxiliary nodes. The shortest path problem from single-origin to single-destination is studied and analyzed. The correctness of the algorithm is proved.

关键词： Telecommunication traffic Road transportation Heuristic algorithms Shortest path problem Genetic algorithms Intelligent transportation systems Cost function Problem-solving Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A Learner Model for Learning-by-Example Context

A Learner Model for Learning-by-Example Context

引用

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

作者： Yuan Fan Zhang Laurence Capus Nicole Tourigny LSI-ERICAE Département dinformatique et de génie logiciel Facultédes sciences et de génie Université Laval QUE Canada

Nowadays learning environments put more and more accent on the intelligence of the system. The intelligence of a learning environment is largely attributed to its ability of adapting to a specific learner during the learning process. The adaptation depends on individual learner's knowledge of the subject to be learned, and other relevant characteristics of the learner. The knowledge and the relevant information about the learner are maintained in the learner model. A learner model can be defined as structured information about the learning process; and this structure contains some values of the learner's characteristics. This paper proposes a new learner model, which is based on the consideration of what is appropriate to the learning-by-example context. The model records five categories of information about the learner: personal data, learner's characteristics, learning state, learner's interactions with the system, and learner's knowledge. This model is being integrated in Sphinx, an educational environment based on learning by means of examples.

关键词： Context modeling Artificial intelligence Intelligent systems Learning Software engineering distributed computing Intelligent networks Navigation Problem-solving

来源：评论

学校读者我要写书评

暂无评论

State-based Time-Series Analysis and Prediction

State-based Time-Series Analysis and Prediction

引用

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

作者： Jixin Ma School of Computing and Mathematical Sciences University of Greenwich UK

Time representation and temporal reasoning plays an important role in time-series analysis and prediction, which involve dealing with varying situations in terms of states of the world evolving with time. Generally speaking, the world in the discourse persists in a given state until some action(s) is carried out, or some event(s) occurs, to change it into another state. This paper presents a framework for prediction and analysis based on time-series of states. It takes a time theory that addresses both points and intervals as primitive time elements on an equal footing as the temporal basis. A state of the world under consideration is defined as a set of time-varying propositions that include properties, facts, actions, events, processes and anything else with Boolean truth-values that are dependent on time. A time-series of states is then defined as a list of states temporally ordered one after another. The framework supports explicit expression of both absolute and relative temporal knowledge. While a formal schema for expressing general time-series of states is given, allowing a time-series of states to be incomplete in various ways, the concept of complete time-series of states is also formally introduced. As the application of the proposed formalism in prediction and time-series analysis, illustrating examples are provided.

关键词： Time series analysis Calculus Logic Artificial intelligence distributed computing Data models Software engineering Computer networks Concurrent computing Context modeling

来源：评论

学校读者我要写书评

暂无评论

A distributed Cut Set Discovery Algorithm in P2P Environment

A Distributed Cut Set Discovery Algorithm in P2P Environment

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Hao Ren Nong Xiao Zhiying Wang School of Computer Science National University of Defense Technology China

Most overlay networks are highly decentralized and self-organized. Therefore, vertex cutset often exists in such systems due to the lack of centralized management. Vertex cutset is defined as a minimum number set of vertices whose removal increases the number of components. In this paper, we propose a distributed mechanism which efficiently detects the vertex cutset with 1 or 2 vertices and neutralize them into normal nodes with slight overhead. We prove the correctness of this algorithm and evaluate the performance of our design through trace driven simulations. The results show that our algorithm greatly improves the reliability of an overlay network upon the failure of vertex cutset.

关键词： Peer to peer computing Computer aided manufacturing CADCAM Computer science distributed algorithms Telecommunication network reliability Costs Algorithm design and analysis Large-scale systems Protection

来源：评论

学校读者我要写书评

暂无评论

Feature-based Self-synchronous Audio Watermarking Technology

Feature-based Self-synchronous Audio Watermarking Technology

引用

IFIP international conference on Network and parallel computing Workshops (NPC Workshops)

作者： Ren Shuhong Jiang Bo College of Computer Science and Technology Dalian Maritime University China

In order to get the robust performance for audio watermarking, a new idea called synchronous valley approach for hiding location is proposed for public audio transmission. As the audio masking principle, the computation is addressed in the low frequency coefficients in discrete wavelet transforming. Five features for seven rules are drawn from the coefficients in the self-synchronous approach. The secrets are firstly coded with BCH technology and then hidden behind the synchronous positions by the algorithm of quantization discrete wavelet transforming. Experimental results show that the synchronous valley approach is very effective when locating the secrets in the watermarking embedding and extracting process. Meanwhile, the watermarking technology is robust to the common attacks, such as MP3 coding, re-sampling, re-quantization, echo delay, Gaussian noise and cropping.

关键词： Watermarking Mobile agents Information security Data security Application software Protection distributed computing IP networks Educational institutions Computer science

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Simulation of Mobile Wireless networks by Run-time Prediction of Multi-hop Propagation Delay

Efficient Parallel Simulation of Mobile Wireless Networks by...

引用

international conference on Testbeds and Research Infrastructures for the Development of networks and Communities (TRIDENTCOM)

作者： Hirozumi Yamaguchi Kazuki Konishi Teruo Higashino Graduate School of Information Science and Technology Osaka University Suita Osaka Japan

In this paper, we propose a method to improve the performance of parallel and distributed simulation of multi-hop mobile wireless networks. We assume that the simulation field is divided into several pieces and is simulated by multiple parallel processes which synchronize conservatively, i.e., without violation of causality. The basic idea of our approach is to predict the lower bounds of timestamps of "potential" upcoming events which cause inter-process messages based on the timestamps of the currently scheduled events plus minimum multi-hop propagation delay estimated in run-time. By this prediction method, we are able to enlarge the lookahead of parallel processes, and their concurrency can be enhanced. We have implemented the parallel and distributed version of our network simulator MobiREAL, and have also implemented this mechanism. The experimental results have shown that we could achieve 50% speed up in average compared with the version using static lookahead in the simulation of end-to-end communications over 1,200 nodes.

关键词： Predictive models Wireless networks Runtime Spread spectrum communication Propagation delay Discrete event simulation Protocols Synchronization Concurrent computing Information science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 41 42 43 44 45 46 47 48 49 50 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：