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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
223 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

635 篇 工学
- 536 篇 计算机科学与技术...
- 447 篇 软件工程
- 123 篇 信息与通信工程
- 90 篇 控制科学与工程
- 44 篇 电子科学与技术（可...
- 43 篇 电气工程
- 41 篇 生物工程
- 36 篇 机械工程
- 28 篇 动力工程及工程热...
- 26 篇 光学工程
- 23 篇 化学工程与技术
- 22 篇 建筑学
- 21 篇 材料科学与工程（可...
- 19 篇 安全科学与工程
- 18 篇 仪器科学与技术
- 18 篇 土木工程
- 18 篇 交通运输工程
- 16 篇 生物医学工程（可授...
- 10 篇 航空宇航科学与技...
356 篇 理学
- 259 篇 数学
- 59 篇 物理学
- 56 篇 统计学（可授理学、...
- 52 篇 系统科学
- 43 篇 生物学
- 27 篇 化学
214 篇 管理学
- 120 篇 管理科学与工程(可...
- 110 篇 图书情报与档案管...
- 57 篇 工商管理
25 篇 法学
- 19 篇 社会学
16 篇 经济学
- 16 篇 应用经济学
8 篇 医学
6 篇 教育学
6 篇 农学
4 篇 艺术学
1 篇 文学
1 篇 军事学

主题

22 篇 semantics
13 篇 computational mo...
13 篇 web services
12 篇 data mining
10 篇 computer science
10 篇 optimization
10 篇 forecasting
9 篇 clustering algor...
8 篇 conferences
8 篇 computer archite...
8 篇 neural networks
8 篇 analytical model...
7 篇 ordinary differe...
7 篇 software quality
7 篇 feature extracti...
7 篇 software
7 篇 cloud computing
7 篇 measurement
7 篇 privacy
7 篇 training

机构

87 篇 state key lab. f...
56 篇 state key lab. o...
28 篇 state key lab. o...
28 篇 university of ch...
26 篇 state key lab. o...
22 篇 state key lab. o...
22 篇 computer school ...
14 篇 tianjin key lab....
14 篇 state key lab. f...
13 篇 department of co...
13 篇 school of comput...
12 篇 beijing key lab....
12 篇 state key lab. o...
11 篇 key laboratory o...
11 篇 school of comput...
10 篇 department of co...
10 篇 state key labora...
10 篇 hunan provincial...
10 篇 school of comput...
10 篇 nanjing universi...

作者

22 篇 zhan naijun
19 篇 xue bai
15 篇 liu jin
12 篇 guosheng kang
11 篇 du junping
11 篇 chen ling
10 篇 liu wei
10 篇 wang hongan
10 篇 liu jianxun
9 篇 kang guosheng
9 篇 zhan bohua
8 篇 he keqing
8 篇 bai xue
8 篇 wu enhua
8 篇 sanglu lu
8 篇 he yanxiang
8 篇 dai guozhong
8 篇 jianxun liu
7 篇 zhang degan
7 篇 zhang xiaolong

语言

792 篇 英文
31 篇 中文
11 篇 其他

检索条件"机构=Key Lab. of System Software and State Key Lab. of Computer Science"

共 834 条记录，以下是561-570 订阅

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

详细简洁

排序：

Research on the adaptable reputation-based scheduling for storage resources in data grids

Research on the adaptable reputation-based scheduling for st...

引用

International Conference on Internet Technology and Applications, ITAP 2010

作者： Liu, Wei Huang, Xun Du, Wei Department of Computer Science Wuhan University of Technology Wuhan 430063 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Institute of Computer Science Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781424451432

Data grids provide the data-intensive applications with a large virtual stroage framework. We use a reputation-based trust aggregation approach for data providers to quantitatively predict and calculate whether or not they are reliable and credible. In the same time, adaptable trust service is increasingly important for applications running on data grids. However, existing systems are unable to satisfy the flexible trust needs of complex data-intensive applications. This paper introduced a novel approach and proposed a quality of reputation-based trust framework for storage resources in data grids (QRTF). QRTF leverages the manager to dynamically control quality of trust for application requests, thereby achieving good tradeoffs between reputation-based trust service and system performance. Experimental results based on a simulated grid with storage resources show that the proposed framework is capable of significantly improving trust service quality and guaranteeing desired response time. ©2010 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

A kind of service-aware computing method for Web-based mobile application with uncertainty

A kind of service-aware computing method for Web-based mobil...

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Zhang, De-Gan Kang, Xue-Jing Dai, Wen-Bo Chen, Ying Fayek, Moaty Tianjin Key Lab. of Lntelligent Computing and Novel Software Technology Tianjin University of Technology 300191 China Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300191 Tiajin China Department of Computer Science California State University Chico CA 95929 United States

ISBN: (纸本)9781424464388

As we know, service-aware computing is an important part of pervasive computing for Web-based mobile application with uncertainty. We modified the fusion method of evidence information after considering context's reliability, time-efficiency, and relativity, which has improved the classical fusion rule of D-S (Dempster-Shafer) Evidence Theory when being used in the pervasive computing paradigm. We call it EDS. After extending the process, we overcome the drawbacks of classical D-S Evidence Theory. All these suggested technologies have been successfully used in our service-aware computing projects. The efficiency of our researches has been shown by our many application practices. © 2010 IEEE.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

The optimal replica distribution to minimize the search size in the unstructured overlay

The optimal replica distribution to minimize the search size...

引用

IEEE International Conference on High Performance Computing and Communication

作者： Feng, Guofu Li, Wenzhong Lu, Sanglu Chen, Daoxu School of Information Science Nanjing Audit University Nanjing 210029 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9780769542140

Replication is a widely used technique in unstructured overlays to improve the content availab.lity or the system performance. Among the prior work on replication, a fundamental question is often addressed: how many replicas should be kept for each data item if given the fixed request rates and the limited storage capability? The Square-Root Replication, in which the replica number of an item is proportional to the square root of its global request rate and proportional to its item size, is usually considered to be optimal as far as the minimization of the search size is concerned. However, our work shows that this viewpoint is not always true, especially in the realistic environments. Firstly, we hold that the replica number should be inversely proportional to the square root of the item size in the optimal replication under the theoretical settings. Secondly, the Square-Root Replication is not optimal when TTL (Time to Live) is small or replica density is low in the practical applications. In this paper, we firstly formulate the questions and present the formal proofs, and finally provide some simulations to validate our conclusions. © 2010 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Bandwidth-Aware Overlay for the maximum throughput in the unstructured peer-to-peer

An Adaptive Bandwidth-Aware Overlay for the maximum throughp...

引用

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

作者： Feng, Guofu Sun, Yuxing Li, WenZhong Lu, Sanglu School of Information Science Nanjing Audit University Nanjing 210029 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9780769542355

Heterogeneity among users is the main concern in building the unstructured P2P topology. However, the related algorithms either only pay attention to the weight heterogeneity in hitting the queries to improve the search success rate, or think much of the capability heterogeneity in data transmission to achieve load-balancing or high throughput. Because the search and transmission are two inseparable stages in an application, they perhaps do not work well in the real applications. The peers with high weight are easily overloaded, and the outstanding peers in data transmission may suffer from the deficiency in requests. Therefore, the optimization only in success rate does not simultaneously mean the optimization in throughput, and vice versa. In this paper an optimization solution of overlay network, ABAO (Adaptive Bandwidth-Aware Overlay), is proposed. In ABAO, the factors of weight heterogeneity in hitting requests and the capability heterogeneity in data transmission are both considered. The connections are adaptively adjusted with low cost according to the availab.e bandwidth and the availab.e requests. Accordingly the throughput can be improved to serve more customers. Our simulations show that our method can improve the system throughput as much as 22%. © 2010 IEEE.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Program slicing based web-service generation and composition

Program slicing based web-service generation and composition

引用

5th IEEE International Symposium on Service-Oriented system Engineering, SOSE 2010

作者： Fu, Wei Zhang, Yingzhou Han, Wei Fan, Xiaowei Yang, Geng College of Computer Nanjing Univ. of Posts and Telecomm. Nanjing 210003 China State Key Lab. of Networking and Switching Technology Beijing Univ. of Posts and Telecomm. Beijing 100876 China State Key Lab. of Novel Software Technology Nanjing Univ. Nanjing 210093 China

ISBN: (纸本)9780769540818

As the development of web services, much attention has been drawn to web service because of its convenience and platform-independence. However, how to discover, generate and compose services has become an open issue recently. This paper proposes a method based on program slicing to realize the generation and composition of web services. It gives the method about how to generate a WSDL file and a SOAP message from source codes as well as a theory of function dependence graph. The results of experiments show that our methods of web service generation and composition are feasible and effective. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

D-TDMA: An approach of dynamic TDMA scheduling for target tracking in wireless sensor networks

D-TDMA: An approach of dynamic TDMA scheduling for target tr...

引用

2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010

作者： Wang, Yun Shi, Peizhong Li, Kai Chen, Zhikui Department of Computer Science and Engineering Southeast University Key Lab. of Computer Network and Information Integration Nanjing 210096 China School of Software Technology Dalian University of Technology Dalian 116024 China

ISBN: (纸本)9780769543314

In the application of target tracking based on dynamic convey tree-based collab.ration (DCTC) in wireless sensor networks, collisions and interferences among nodes pose a challenge for data aggregation. In this paper, we refine slot allocation to the nodes in dynamic convey tree and design an energy efficient MAC protocol called D-TDMA, which avoids collisions and interferences and allocates contiguous active slots to nodes as far as possible during data aggregation from leaf nodes to a root node. As a result, the energy consumption in switching from sleeping to active state is saved. Simulation results show that D-TDMA not only gets rid of the impact of collisions and interferences among nodes in dynamic convey tree, but also performs similar throughput to that of CSMA-like mechanism where nodes work without active/sleep scheduling strategy. Our protocol outperforms ESR in both energy efficiency and low delay. © 2010 IEEE.

关键词： Time division multiple access

来源：评论

学校读者我要写书评

暂无评论

Coherent depth test scheme in FreePipe

Coherent depth test scheme in FreePipe

引用

作者： Liu, Fang Huang, Mengcheng Liu, Xuehui Wu, En-Hua SuperComputing Center Computer Network Information Center Chinese Academy of Sciences China State Key Lab. of Computer Sciences Institute of Software Chinese Academy of Sciences China University of Macau China

ISBN: (纸本)9781450304597

This paper presents a rasterization rendering pipeline namely FreePipe. The system builds a bridge between the traditional graphics pipelines and the general purpose computing architecture CUDA by taking advantages of both sides. The core of FreePipe is a z-buffer based rasterizer entirely implemented in CUDA. The graphics pipeline can be easily mapped to the CUDA programming model with each stage fully open to the programmers. Within this flexible architecture, we propose a coherent depth test scheme for concurrent capture of both depth and color attributes using the atomicCAS operation in CUDA. The scheme can be easily extended to multiple level for efficient rendering of order independent transparency, which has significant performance improvement over the state-of-the-art methods based on traditional graphics pipelines. Copyright © 2010 by the Association for Computing Machinery, Inc.

关键词： Rasterization

来源：评论

学校读者我要写书评

暂无评论

GA-based container terminal stockpile block plan optimization and simulation

GA-based container terminal stockpile block plan optimizatio...

引用

2nd International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC 2010

作者： Li, Li Hu, Wenbin Hu, Zhengbing Sun, Ni Min, Zhenyu Cheng, Yuheng Zhanghai Lu, Bin Computer School Wuhan University Wuhan 430079 China State Key Lab. for Novel Software Technology Nanjing University China Department of Information Technology Huazhong Normal University China

ISBN: (纸本)9780769540115

In the stockpile schedule, a reasonable block allocation plan was a good foundation for the bay allocation plans, location choices for coming containers, containers turning schedule, and the shipments. This paper has built a mathematical model for block allocation plan of outward containers. The model tried to minimize the distance between the ship and the storage blocks, and avoid shipments for multiple ships in the same block, under the condition that the number of allocated blocks equals the result of each port's experiential formula. The genetic algorithm was used to solve this problem. The encoding used binary encoding. The length of the chromosome was the total number of blocks in the yard. Each gene in the chromosome was expressed for the each block. The value of '1' meant that the corresponding block was allocated;'0' meant that the corresponding block wasn't allocated for the ship. By verifying, the model and the algorithm had good performance. © 2010 IEEE.

关键词： Ships

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm to optimize the access time of data broadcast in mobile computing environments

An improved algorithm to optimize the access time of data br...

引用

2nd International Workshop on Education Technology and computer science, ETCS 2010

作者： Xu, Long Hu, Wenbin Hu, Zhengbing Tan, Xinlong Xia, Chang Computer School Wuhan University Wuhan 430079 China State Key Lab. for Novel Software Technology Nanjing University China Department of Information Technology Huazhong Normal University China

ISBN: (纸本)9780769539874

With its large market potential and large amounts of clients, mobile data broadcasting has been a very essential part of nowadays communication. As mobile data broadcasting become more important, the algorithm to make it more efficient has been a highly-focused area of scientists in related field. A algorithm called Naïve Approach Schedule Algorithm(NASA for short) was presented by some professors. Its aim is to optimize average data access time as much as possible. It can be divided into 2 main stages: determine data's broadcasting ratio;determine data items' broadcasting schedule. However, data's broadcasting ratio is not accurately calculated,which affects the performance of this algorithm *** paper proposes an algorithm based on Naïve Approach Schedule Algorithm to optimize the access time of a data schedule. It calculates data's broadcasting ratio carefully, and make the ratio close to its optimized *** the same time, a small change is made in determining data items' broadcasting schedule. Features of the algorithm presented in this paper are shown and related experiments are conducted. The result shows that, compared with NASA algorithm, it has almost the same average accessing time with relatively longer period. In other words, when their periods are the same, its performance is relatively better. And it maintains other important features of NASA algorithm. © 2010 IEEE.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Mixed-row-based space allocation strategy for outbound containers

Mixed-row-based space allocation strategy for outbound conta...

引用

2nd International Conference on Information Engineering and computer science, ICIECS 2010

作者： Min, Zhenyu Hu, Wenbin Hu, Zhengbing Li, Li Sun, Ni Lu, Bin Computer School Wuhan University Wuhan 430079 China State Key Lab. for Novel Software Technology Nanjing University China Department of Information Technology Huazhong Normal University China

ISBN: (纸本)9781424479412

In this paper, a model is built to solve the problem of finding an optimal location for the outbound container when it will be loaded. And also a mixed-row-based strategy is put forward, together with a multiple-decision method for allocating outbound containers. The model is aimed at minimizing the reshuffle containers of the yard, so as to reduce the times of shifting containers and improve the efficiency of the yard. The model is based on real-timing and randomicity of loading containers, according to the requirement of business process. Considering that efficiency comes first, a mixed-row strategy was proposed. As a result of this model, locating containers will become more efficient and easier, outbound containers will be more convenient to manage. The simulation shows that the model proposed in this paper owns a good performance. ©2010 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：