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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

309 篇 会议
129 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 196 篇 计算机科学与技术...
- 150 篇 软件工程
- 49 篇 信息与通信工程
- 40 篇 控制科学与工程
- 24 篇 生物工程
- 19 篇 电子科学与技术（可...
- 18 篇 机械工程
- 18 篇 电气工程
- 11 篇 动力工程及工程热...
- 9 篇 力学（可授工学、理...
- 8 篇 仪器科学与技术
- 7 篇 农业工程
- 6 篇 土木工程
- 6 篇 化学工程与技术
- 6 篇 网络空间安全
- 5 篇 建筑学
- 5 篇 交通运输工程
- 5 篇 核科学与技术
115 篇 理学
- 70 篇 数学
- 25 篇 物理学
- 24 篇 生物学
- 19 篇 系统科学
- 11 篇 统计学（可授理学、...
- 5 篇 化学
65 篇 管理学
- 43 篇 管理科学与工程(可...
- 24 篇 图书情报与档案管...
- 11 篇 工商管理
9 篇 法学
- 8 篇 社会学
7 篇 农学
- 7 篇 作物学
5 篇 经济学
- 5 篇 应用经济学
3 篇 医学
2 篇 文学
2 篇 军事学
2 篇 艺术学
1 篇 教育学

主题

17 篇 computational mo...
15 篇 deep learning
15 篇 training
14 篇 benchmark testin...
14 篇 algorithm design...
14 篇 cloud computing
13 篇 computer archite...
13 篇 feature extracti...
11 篇 servers
10 篇 scalability
10 篇 clustering algor...
9 篇 task analysis
9 篇 throughput
9 篇 laboratories
9 篇 distributed proc...
9 篇 hardware
9 篇 distributed data...
8 篇 runtime
8 篇 parallel process...
8 篇 fault tolerance

机构

134 篇 science and tech...
51 篇 college of compu...
23 篇 national laborat...
22 篇 science and tech...
16 篇 science and tech...
14 篇 national laborat...
13 篇 school of comput...
12 篇 national key lab...
10 篇 laboratory of di...
9 篇 national laborat...
8 篇 school of comput...
8 篇 national key lab...
7 篇 national univers...
7 篇 department of co...
7 篇 college of compu...
7 篇 laboratory of so...
7 篇 college of scien...
6 篇 national laborat...
6 篇 national laborat...
6 篇 college of compu...

作者

35 篇 liu jie
33 篇 jie liu
19 篇 yijie wang
15 篇 zhigang luo
15 篇 wang yijie
15 篇 peng yuxing
14 篇 qinglin wang
13 篇 naiyang guan
13 篇 zuocheng xing
12 篇 wang huaimin
11 篇 chen xinhai
11 篇 chunye gong
11 篇 kai lu
10 篇 yuxing peng
10 篇 huaimin wang
10 篇 wang qinglin
9 篇 dongsheng li
9 篇 xiaodong wang
9 篇 li dongsheng
9 篇 xuhui huang

语言

396 篇 英文
23 篇 中文
21 篇 其他

检索条件"机构=Science and Technology on Paralled and Distributed Processing Laboratory"

共 440 条记录，以下是411-420 订阅

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

详细简洁

排序：

A Multi-agent Simulation of Escape Panic

A Multi-agent Simulation of Escape Panic

引用

International Joint Conference on Computational sciences and Optimization, CSO

作者： Chuanjun Ren Chenghui Yang Shiyao Jin National Laboratory for Parallel & Distributed Processing College of Computer Science National University of Defense Technology Changsha China National Laboratory for Parallel & Distributed Processinz National University of Defense Technology Changsha China National University of Defense Technology Changsha Hunan CN

The modeling and simulation on evacuation has recently become a topic of great interest. We present an agent-based model to construct crowd evacuations for emergency response from an area under an explosion. Various types of agents are designed as well as the interactions of them are concerned in contrast to traditional models in which the total populations are considered to be consisted of identical individuals and the interactions between them are omitted. Different cases are taken into account to test the effect of our model by iterative simulations. At last, plenty simulation results suggest several effective ways to minimize the harmful consequences of such life-threaten events.

关键词： Explosions Computational modeling Computer simulation Testing Accidents Humans Analytical models Concurrent computing distributed computing distributed processing

来源：评论

学校读者我要写书评

暂无评论

An Optimal Mapping Algorithm Based on Balanced Load Cutting for DVE Systems

An Optimal Mapping Algorithm Based on Balanced Load Cutting ...

引用

International Symposium on Intelligent Information technology Application, IITA

作者： Wei Zhang Min Xi Hangjun Zhou Yuxing Peng Sikun Li National Laboratory for Parallel and Distributed Processing National University of Defense Technology ChangSha China Department of Computer Science Xi'an Jiaotong University Xi'an China

In distributed virtual environment (DVE) systems, a distributed server infrastructure is often used to reduce the latency between servers and clients. Under this infrastructure, mapping clients to proper servers is one of the key issues for improving the interactivity and overall performance. Most traditional methods of mapping the clients to servers only consider the load balancing problem. However, there are two other important aspects that should be involved: the physical world integrity and the virtual world integrity. In this work, we propose a novel mapping algorithm which takes care of all three aspects at the same time. The algorithm converts the mapping problem into cutting stage and matching stage to get optimal result with polynomial complexity. The experimental results show that our algorithm improves the overall performance of DVE systems significantly.

关键词： Delay Network servers Computer science Virtual environment Load management Polynomials Quality of service Information technology Application software distributed processing

来源：评论

学校读者我要写书评

暂无评论

An Irregular cutting based distributed mapping algorithm for DVE systems

An Irregular cutting based distributed mapping algorithm for...

引用

Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA

作者： Wei Zhang Hangjun Zhou Yuxing Peng Sikun Li Min Xi National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China Department of Computer Science Xi'an Jiaotong University Xi'an China

distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world integrity, the virtual environment should be divided into several parts and mapped to multiple servers, which are located in geographically different places. Many centralized algorithms based on regular cutting method are proposed to solve this problem. However, the dynamic property of clients and distributed property of the system make the existing algorithms unable to undertake it. In this paper, we propose a metric to measure the cutting quality and design a distributed mapping algorithm based on an irregular cutting. Simulation results show that our algorithm greatly decreases the costs of DVE systems for migration of clients and effectively improves the satisfaction degree of users.

关键词： Defense industry Virtual environment Computer industry Computer science Algorithm design and analysis Delay Partitioning algorithms Industrial training Computational intelligence Application software

来源：评论

学校读者我要写书评

暂无评论

Optimizing Reference Gene Set for Inter-Chip Normalization Using Genetic Algorithm

Optimizing Reference Gene Set for Inter-Chip Normalization U...

引用

International Conference on BioMedical Engineering and Informatics (BMEI)

作者： Fei Li Wenjian Xu Peng Li XiaoChen Bo Yuxing Peng Department of Computer Science National Laboratory of Parallel & Distributed Processing National University of Defense Technology Changsha China Beijing Institute of Radiation Medicine Beijing China

Due to the existence of systematic bias in the measurements, inter-chip normalization is required before integrated data analysis of multiple microarray datasets. Current inter-chip normalization methods rely on some assumptions, which can rarely be verified by experiments, such as the invariant expression level of housekeeping genes or the stability of statistical data distribution. In this paper, we present a highly verifiable inter-chip normalization method using genetic optimization algorithm, which depends only on a small number of housekeeping genes, and therefore facilitates experimental validation without any accuracy lost.

关键词： Genetic algorithms Gene expression Laboratories Data analysis Optimization methods Genomics Bioinformatics Statistical distributions Probes Computer science

来源：评论

学校读者我要写书评

暂无评论

Modelling with relational calculus of object and component systems - RCOS

Modelling with relational calculus of object and component s...

引用

作者： Chen, Zhenbang Hannousse, Abdel Hakim Van Hung, Dang Knoll, Istvan Li, Xiaoshan Liu, Zhiming Liu, Yang Nan, Qu Okika, Joseph C. Ravn, Anders P. Stolz, Volker Yang, Lu Zhan, Naijun International Institute for Software Technology United Nations University China Faculty of Science and Technology University of Macau Department of Computer Science Aalborg University Denmark Lab. of Computer Science Institute of Software CAS China National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)3540852883

This chapter presents a formalization of functional and behavioural requirements, and a refinement of requirements to a design for CoCoME using the Relational Calculus of Object and Component Systems (rCOS). We give a model of requirements based on an abstraction of the use cases described in Chapter 3.2. Then the refinement calculus of rCOS is used to derive design models corresponding to the top level designs of Chapter 3.4. We demonstrate how rCOS supports modelling different views and their relationships of the system and the separation of concerns in the development. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Flexible Routing in Grouped DHTs

Flexible Routing in Grouped DHTs

引用

International Conference on Peer-to-Peer Computing

作者： Yiming Zhang Dongsheng Li Lei Chen Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achieve this, in this paper we present grouped tapestry (GTap), a novel tapestry-based DHT that supports organizing nodes into groups and allows flexible DHT routing. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations.

关键词： Routing Fingers Peer to peer computing Maintenance engineering Security Availability Data structures

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approximation for Weapon-Target Assignment

An Efficient Approximation for Weapon-Target Assignment

引用

ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM

作者： Lina Chen ChuanJun Ren Su Deng C4ISR Technology National Defense Science and Technology Key Laboratory National University of Defense Technology Changsha Hunan China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. We present firstly a technique founded on the use weapon cell, which enables one-to-many mapping about weapon-target to become one-to-one mapping. Next, we introduce a framework of solving the WTA problem. Based on this framework, an approximation algorithm that is grounded on the rules about weapon cells and targets is proposed. Finally, the simulative results show that the proposed algorithm indeed is very efficient.

关键词： Weapons Heuristic algorithms Algorithm design and analysis Resource management Artificial neural networks Genetic algorithms Operations research

来源：评论

学校读者我要写书评

暂无评论

Collaborative search in large-scale unstructured peer-to-peer networks

Collaborative search in large-scale unstructured peer-to-pee...

引用

36th International Conference on Parallel processing in Xi'an, ICPP

作者： Zhang, Yiming Li, Dongsheng Chen, Lei Lu, Xicheng National Laboratory for Parallel and Distributed Processing NUDT Department of Computer Science Hong Kong University of Science and Technology

ISBN: (纸本)076952933X

Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a Parallel, cOllaborative and Probabilistic search mechanism, in which query messages are viewed as search units to collaborate with each other and aggregate the distributed hints during the search process. A scheme called distributed Bloom Filter (DBF) is presented to propagate the hints with a bandwidth-aware manner, in which a node divides the received Bloom filter vector into subvectors and disseminates the fragments to its neighbors according to their bandwidth capacity. The effectiveness of POP is demonstrated through theoretical analysis and extensive simulations. © 2007 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks

Collaborative Search in Large-scale Unstructured Peer-to-Pee...

引用

International Conference on Parallel processing (ICPP)

作者： Yiming Zhang Dongsheng Li Lei Chen Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a Parallel, collaborative and Probabilistic search mechanism, in which query messages are viewed as search units to collaborate with each other and aggregate the distributed hints during the search process. A scheme called distributed Bloom filter (DBF) is presented to propagate the hints with a bandwidth-aware manner, in which a node divides the received Bloom filter vector into subvectors and disseminates the fragments to its neighbors according to their bandwidth capacity. The effectiveness of POP is demonstrated through theoretical analysis and extensive simulations.

关键词： Large-scale systems Peer to peer computing Bandwidth Information filtering Information filters Analytical models Aggregates Space technology International collaboration Laboratories

来源：评论

学校读者我要写书评

暂无评论

A push-based prefetching for cooperative caching RAM Grid

A push-based prefetching for cooperative caching RAM Grid

引用

International Conference on Parallel and distributed Systems (ICPADS)

作者： Rui Chu Nong Xiao Lei Chen Xicheng Lu National Laboratory for Parallel and Distributed Processing ChangSha Hunan China Hong Kong University of Science and Technology Kowloon Hong Kong China

As an innovative distributed computing technique for sharing the memory resources in high-speed network, RAM Grid exploits the distributed free nodes, and provides remote memory for the nodes which are short of memory. One of the RAM Grid systems named DRACO, tries to provide cooperative caching to improve the performance of the user node which has mass disk I/O but lacks local memory. However, the performance of DRACO is constrained with the network communication cost. In order to hide the latency of remote memory access and improve the caching performance, we proposed using push- based prefetching to enable the caching providers to push the potential useful memory pages to the user nodes. Specifically, for each caching provider, it employs sequential pattern mining techniques, which adapts to the characteristics of memory page access sequences, on locating useful memory pages for prefetching. We have verified the effectiveness of the proposed method through system analysis and trace-driven simulations.

关键词： Prefetching Cooperative caching Random access memory Read-write memory Delay High-speed networks File systems Costs Laboratories distributed processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：