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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,681 篇 工学
- 1,476 篇 计算机科学与技术...
- 671 篇 软件工程
- 489 篇 信息与通信工程
- 354 篇 电气工程
- 93 篇 控制科学与工程
- 82 篇 网络空间安全
- 65 篇 生物工程
- 56 篇 电子科学与技术（可...
- 42 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 26 篇 交通运输工程
- 26 篇 安全科学与工程
- 25 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
322 篇 理学
- 191 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
216 篇 管理学
- 143 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
28 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
82 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 peer-to-peer com...
59 篇 internet of thin...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,720 篇 英文
28 篇 其他
6 篇 中文
2 篇 法文

检索条件"任意字段=11th International Conference on Distributed Computing and Networking"

共 2755 条记录，以下是2441-2450 订阅

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

详细简洁

排序：

Efficient task scheduling with duplication for bounded number of processors

Efficient task scheduling with duplication for bounded numbe...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： S. Pasham Wei-Ming Lin Department of Electrical Engineering University of Texas San Antonio San Antonio TX USA

Task scheduling has been known to be one of the challenging issues in parallel and distributed computing. there have been many scheduling algorithms proposed for scheduling tasks onto unlimited number of processors, while, in practical situations, there are only a limited number of processors available. thus, the goal of this work is to propose several new features to vastly improve the already-efficient bounded-CPFD algorithm (Ahmad and Kwok, 1998). the proposed technique, instead of considering only parent processors when scheduling a task in the original bounded-CPFD algorithm, allows other processors to be considered as well. this heuristic intends to provide a better load balance among the processors in leading to a shorter overall schedule length by allowing potentially more task duplication. Results from an extensive simulation show significant performance improvement from the proposed techniques over the bounded-CPFD.

关键词： Processor scheduling Scheduling algorithm distributed computing Computational modeling NP-complete problem Delay Polynomials Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Charge-based flooding algorithm for looking up multimedia objects in peer-to-peer overlay networks

Charge-based flooding algorithm for looking up multimedia ob...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： K. Watanabe T. Enokido M. Takizawa K. Kim Tokyo Denki University Japan Rissho University Japan University of California Irvine USA

Various types of multimedia objects are distributed to peer computers (peers) in peer-to-peer (P2P) overlay networks. An application has to find target peers which can support enough quality of service (QoS) of target multimedia objects. We discuss acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. We discuss a charge-based flooding (CBF) algorithm to find target peers based on charge and acquaintance concepts so that areas in P2P overlay networks where target peers are expected to exist are more deeply searched. We evaluate the CBF algorithm compared with a traditional flooding algorithm in terms of the number of messages transmitted in networks.

关键词： Intelligent networks Peer to peer computing Quality of service Permission distributed computing Computer networks Application software Object detection LAN interconnection Scalability

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Practical Defense Method Against DDoS Attack at the Source-End

An Efficient and Practical Defense Method Against DDoS Attac...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Yanxiang He Wei Chen Wenling Peng Bin Xiao Computer School The State Key Laboratory of Software Engineering Wuhan University of China Wuhan Hubei China Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

distributed Denial-of-Service (DDoS) attack is one of the most serious threats to the Internet. Detecting DDoS at the source-end has many advantages over defense at the victim-end and intermediate-network. One of the main problems for source-end methods is the performance degradation brought by these methods, which discourages Internet service providers (ISPs) to deploy the defense system. We propose an efficient detection approach, which only requires limited fixed-length memory and low computation overhead but provides satisfying detection results. the low cost of defense is expected to attract more ISPs to join the defense. the experiments results show our approach is efficient and feasible for defense at the source-end

关键词： Computer crime Data structures Web and internet services Monitoring distributed computing Degradation Telecommunication traffic Information filtering Information filters Helium

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of the concurrent execution of NAS parallel benchmarks with BYTE sequential benchmarks on a cluster

Performance evaluation of the concurrent execution of NAS pa...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： A.M. Goscinski A.K.L. Wong School of Information Technology Deakin University Geelong VIC Australia

Computers of a non-dedicated cluster are often idle (users attend meetings, have lunch or coffee breaks) or lightly loaded (users carry out simple computations). these underutilized computers can be employed to execute parallel applications not only during weekends and at nights but also during office hours. thus, they have to be shared by parallel and sequential applications which could lead to the improvement of their execution performance. However, there is a lack of experimental study showing the behavior and performance of parallel and sequential applications executing concurrently on clusters. We present here the result of an experimental study into load balancing based scheduling of a mixture of parallel and sequential applications on a non-dedicated cluster.

关键词： Processor scheduling Application software Concurrent computing High performance computing Job shop scheduling Computer networks Personal communication networks Information technology Australia Load management

来源：评论

学校读者我要写书评

暂无评论

Hardware-based Packet Classification Made Fast and Efficient

Hardware-based Packet Classification Made Fast and Efficient

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Pi-Chung Wang Chun-Liang Lee Chia-Tai Chan Hung-Yi Chang Telecommunication Laboratories Chunghwa Telecom Company Limited Taipei Taiwan Department of Information Management I-Shou University Kaohsiung Taiwan

To achieve fast packet classification, a hardware-based scheme, cross-producting recurrence (CPR), based on a formerly proposed cross-producting scheme is proposed. this scheme simplifies the classification procedure and decrease the distinct combinations of fields by hierarchically decomposing the multi-dimensional space. In the new scheme, the multi-dimensional space is endowed with a hierarchical property which self-divides into several smaller subspaces, whereas the procedure of packet classification is translated into repeatedly searching for matching subspaces. the required storage of the proposed scheme is significantly reduced since the distinct fields of subspaces is controlled by a pre-defined configuration and can be much less than that of the filters. the experimental results demonstrate the effectiveness and scalability of the proposed scheme

关键词： Scalability Matched filters Protocols Data structures Clustering algorithms Laboratories Telecommunications Information management Next generation networking Costs

来源：评论

学校读者我要写书评

暂无评论

A parallel solution-adaptive scheme for multi-phase core flows in solid propellant rocket motors

A parallel solution-adaptive scheme for multi-phase core flo...

引用

11th Annual conference of the CFD-Society-of-Canada

作者： Sachdev, JS Groth, CPT Gottlieb, JJ Univ Toronto Ontario Inst Aerosp Studies Toronto ON M3H 5T6 Canada

the development of a parallel adaptive mesh refinement (AMR) scheme is described for solving the governing equations for multi-phase (gas-particle) core flows in solid propellant rocket motors (SRMs). An Eulerian formulation is used to describe the coupled motion between the gas and particle phases. A cell-centred upwind finite-volume discretization and the use of limited linear reconstruction, Riemann solver based flux functions for the gas and particle phases, and explicit multi-stage time-stepping allows for high solution accuracy and computational robustness. A Riemann problem is formulated for prescribing boundary data at the burning surface and a mesh adjustment algorithm has been implemented to adjust the multi-block quadrilateral mesh to the combustion interface. A flexible block-based hierarchical data structure is used to facilitate automatic solution-directed mesh adaptation according to physics-based refinement criteria. Efficient and scalable parallel implementations are achieved with domain decomposition on distributed memory multi-processor architectures. Numerical results are described to demonstrate the capabilities of the approach for predicting SRM core flows.

关键词： adaptive mesh refinement parallel computing multi-phase flow solid propellant rocket motors

来源：评论

学校读者我要写书评

暂无评论

A scalable semantic routing architecture for grid resource discovery

A scalable semantic routing architecture for grid resource d...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： J. Li Son Vuong Computer Science Department University of British Columbia Canada

Grids technology enables the sharing and collaborating of wide variety of resources. To fully utilize these resources, effective discovery techniques are necessities. However, the complicated and heterogeneous characteristics of the grid resource make sharing and discovering a challenging issue. In this paper, we propose a comprehensive semantic-based resource discovery framework, which performs an effective searching according to the semantic properties of what is searched. In the framework, nodes are grouped into clusters according to some criteria. Resources are indexed and aggregated with a highly compressed format. the summarized index can act as network knowledge to guide routing in the network. Intra-cluster and inter-cluster routing strategies are proposed to support scalable and efficient searching. Results from simulation demonstrate that this architecture is very effective in grid resource discovery.

关键词： Routing Peer to peer computing Grid computing Computer architecture Computer networks Resource description framework Clustering algorithms Computer science Collaboration Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A technique to analyse session initiation protocol traffic

A technique to analyse session initiation protocol traffic

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： G. De Marco G. Iacovoni L. Barolli Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Ericsson Laboratory Italy Rome Italy

the session initiation protocol (SIP) will provide the signaling network in the next generation networks, such as UMTS and cdma2000. Here we study the traffic load generated by the use of this protocol from a methodological point of view. We propose an analytical technique to simulate SIP finite state machine (FSM) in an IP network by means of the theory of queuing networks. Based on this approach, we derive a simple model which can be applied to different network scenarios for performance evaluation and engineering purposes. We conclude this study by showing some results about call dropping rate in a wireless access network.

关键词： Protocols Telecommunication traffic Traffic control Next generation networking 3G mobile communication Analytical models Automata IP networks Queueing analysis Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Delegatable Access Control for Fine-Grained XML

Delegatable Access Control for Fine-Grained XML

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Jing Wu J. Seberry Yi Mu Chun Ruan School of IT and CS University of Wollongong Australia School of Computing and IT University of Western Ontario Sydney Australia

the access control mechanisms are critical to ensure security in XML (extensible markup language). Several such mechanisms have been used or proposed; however, the notion of delegation in XML has not been studied in the literature. In this paper, we propose an access control model encapsuling delegation authorization rules for XML documents that allow flexible data granularity and limited inference protection. Our access control policy specification is basically DTD-based. It can also be considered to be document-based

关键词： Access control XML Authorization Data security Protection Permission Tree data structures Australia Standardization Markup languages

来源：评论

学校读者我要写书评

暂无评论

An efficient partition-based parallel PageRank algorithm

An efficient partition-based parallel PageRank algorithm

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Bundit Manaskasemsak Arnon Rungsawang Faculty of Engineering Massive Information & Knowledge Engineering Department of Computer Engineering Kasetsart University Bangkok Thailand

PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Researchers have then devoted much attention in studying an efficient way to compute the PageRank scores of a very large Web graph. However, only a few of them focus on large-scale PageRank computation using parallel processing techniques. In this paper, we propose a partition-based parallel PageRank algorithm that can efficiently run on a low-cost parallel environment like the PC cluster. For comparison, we also study the other two known techniques, as well as propose an analytical discussion concerning I/O and synchronization cost, and memory usage. Experimental results with two Web graphs synthesized from the .th domain and the Stanford WebBase project are very promising.

关键词： Partitioning algorithms Clustering algorithms Knowledge engineering Costs Computer architecture Iterative algorithms Large-scale systems Concurrent computing Parallel processing Web sites

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 241 242 243 244 245 246 247 248 249 250 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：