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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

414 篇 会议
155 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

346 篇 工学
- 311 篇 计算机科学与技术...
- 229 篇 软件工程
- 55 篇 信息与通信工程
- 33 篇 生物工程
- 26 篇 电气工程
- 24 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 17 篇 动力工程及工程热...
- 15 篇 机械工程
- 15 篇 网络空间安全
- 10 篇 生物医学工程（可授...
- 9 篇 交通运输工程
- 8 篇 光学工程
- 8 篇 化学工程与技术
- 6 篇 仪器科学与技术
- 6 篇 土木工程
- 5 篇 安全科学与工程
117 篇 理学
- 60 篇 数学
- 36 篇 生物学
- 21 篇 系统科学
- 13 篇 化学
- 10 篇 物理学
- 9 篇 统计学（可授理学、...
96 篇 管理学
- 76 篇 管理科学与工程(可...
- 33 篇 工商管理
- 28 篇 图书情报与档案管...
16 篇 法学
- 8 篇 法学
- 8 篇 社会学
10 篇 经济学
- 9 篇 应用经济学
5 篇 医学
4 篇 文学
- 4 篇 新闻传播学
2 篇 农学
1 篇 军事学

主题

27 篇 cloud computing
24 篇 grid computing
24 篇 computational mo...
22 篇 servers
19 篇 scalability
19 篇 semantics
17 篇 bandwidth
17 篇 virtualization
17 篇 virtual machine
14 篇 computer archite...
13 篇 memory managemen...
13 篇 feature extracti...
13 篇 instruction sets
13 篇 data models
12 篇 algorithm design...
12 篇 heuristic algori...
11 篇 throughput
11 篇 protocols
10 篇 computer science
10 篇 parallel process...

机构

100 篇 national enginee...
69 篇 services computi...
55 篇 school of comput...
53 篇 services computi...
49 篇 services computi...
49 篇 school of cyber ...
33 篇 national enginee...
31 篇 hubei engineerin...
29 篇 services computi...
27 篇 cluster and grid...
27 篇 services computi...
26 篇 hubei key labora...
25 篇 huazhong univers...
17 篇 school of softwa...
15 篇 zhejiang lab
15 篇 school of inform...
13 篇 services computi...
12 篇 national enginee...
12 篇 national enginee...
12 篇 huazhong univers...

作者

244 篇 jin hai
238 篇 hai jin
60 篇 xiaofei liao
49 篇 liao xiaofei
39 篇 deqing zou
33 篇 shi xuanhua
32 篇 zou deqing
29 篇 wu song
27 篇 song wu
23 篇 hu shengshan
21 篇 ran zheng
19 篇 haikun liu
18 篇 long zheng
18 篇 jiang wenbin
16 篇 zhang leo yu
16 篇 yu zhang
16 篇 xuanhua shi
15 篇 jiang xiao
13 篇 xia xie
13 篇 yuan pingpeng

语言

554 篇 英文
17 篇 其他
6 篇 中文

检索条件"机构=Services Computing Technology and System Lab"

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

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

详细简洁

排序：

Dev store: Distributed storage system for desktop virtualization

Dev store: Distributed storage system for desktop virtualiza...

引用

8th International Conference on Computer Science and Education, ICCSE 2013

作者： Jiang, Yue Jin, Hai Liao, Xiaofei Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781467344623

With the development of desktop virtualization technology, more and more companies begins to deploy virtual desktop. Traditional NAS and SAN storages can only support small-scale users due to network bandwidth limit and poor scalability. Another disadvantage is that NAS and SAN storages are very expensive. The distributed file systems such as GFS, PVFS, and Lustre are with low cost, high scalability and mass storage, but they are only designed for specific scenarios and can not meet the need of desktop virtualization storage. The characteristics of virtual desktop I/O are small random I/O, high IOPS, snapshot needed and frequent access of the root image. Based on these I/O characteristics, DevStore is designed for desktop virtualization, and aims to be low cost, good scalability and performance. Experiments show that DevStore image's write performance is 70MB/s and read performance is 60MB/s in gigabit Ethernet. The snapshot time of DevStore is less than 1ms. DevStore is also easy to expand. Experiments also show that DevStore is better than QCOW in NFS environment and meets the desktop virtualization storage need. © 2013 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

RTRM: A response time-based replica management strategy for cloud storage system

引用

8th International Conference on Grid and Pervasive computing, GPC 2013

作者： Bai, Xiaohu Jin, Hai Liao, Xiaofei Shi, Xuanhua Shao, Zhiyuan Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642380266

Replica management has become a hot research topic in storage systems. This paper presents a dynamic replica management strategy based on response time, named RTRM. RTRM strategy consists of replica creation, replica selection, and replica placement mechanisms. RTRM sets a threshold for response time, if the response time is longer than the threshold, RTRM will increase the number of replicas and create new replica. When a new request comes, RTRM will predict the bandwidth among the replica servers, and make the replica selection accordingly. The replica placement refers to search new replica placement location, and it is a NP-hard problem. Based on graph theory, this paper proposes a reduction algorithm to solve this problem. The simulation results show that RTRM strategy performs better than the five built-in replica management strategies in terms of network utilization and service response time. © 2013 Springer-Verlag.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

DDASTM: Ensuring conflict serializability efficiently in distributed STM

引用

8th International Conference on Grid and Pervasive computing, GPC 2013

作者： Zhang, Yu Jin, Hai Liao, Xiaofei Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642380266

CS (Conflict Serializability) is a recently proposed relaxer correctness criterion that can increase transactional memory's parallelism. DDA (Distributed Dependency-Aware) model is currently proposed to implement CS in distributed STM (Software Transactional Memory) for the first time. However, its transactions detect conflicts individually via detecting cycles in PG (Precedence Graph) and cause extra runtime overhead, especially at the condition that the transactions access lots of objects or the PG is large. In this paper, we propose an approach to make each cycle in PG detected by those transactions, which construct this cycle, together in parallel way, instead of detecting cycle individually. Experimental results show that the average execution time and communication cost of all transactions, including aborted ones, in our approach, can be decreased to 76% and 78% of those in DDA respectively. Its speedup is up to 2.56x against baseDSTM, employing two-phase locking. © 2013 Springer-Verlag.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Accelerate mapreduce on GPUs with multi-level reduction 13

Accelerate mapreduce on GPUs with multi-level reduction

引用

5th Asia-Pacific Symposium on Internetware, Internetware 2013

作者： Zheng, Ran Liu, Kai Jin, Hai Zhang, Qin Feng, Xiaowen Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781450323697

With Graphics Processing Units (GPUs) becoming more and more popular in general purpose computing, more attentions have been paid on building a framework to provide convenient interfaces for GPU programming. MapReduce can greatly simplify the programming for data-parallel applications in cloud computing environment, and it is also naturally suitable for GPUs. However, there are some problems in recent reduction-based MapReduce implementation on GPUs. Its performance is dramatically degraded when handling massive distinct keys because the massive data cannot be stored in tiny shared memory entirely. A new MapReduce framework on GPUs, called Jupiter, is proposed with continuous reduction structure. Two improvements are supported in Jupiter, a multi-level reduction scheme tailored for GPU memory hierarchy and a frequencybased cache policy on key-value pairs in shared memory. Shared memories are utilized efficiently for various dataparallel applications whether involving little or abundant distinct keys. Experiments show that Jupiter can achieve up to 3x speedup over the original reduction-based GPU MapReduce framework on the applications with lots of distinct keys. Categories and Subject Descriptors D.1.3 [Programming Techniques]: Concurrent Programming- parallel programming General Terms Algorithms, Performance, Design.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Friends based keyword search over online social networks

引用

8th International Conference on Grid and Pervasive computing, GPC 2013

作者： Huang, Jinzhou Jin, Hai Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642380266

Online social networks are rapidly becoming popular for users to share, organize and locate interesting content. Users pay much attention to their close friends, those direct or two-hop friends. Users of Facebook commonly browse relevant profiles and the homepages, which are inefficient in obtaining desired information for a user due to the large amount of relevant data. In this paper, we propose a summary index with a ranking model by extending existing Bloom filter techniques, and achieve efficient full-text search over large scale OSNs to reduce inter-server communication cost and provide much shorter query latency. Furthermore, we conduct comprehensive simulations using traces from real world systems to evaluate our design. Results show that our scheme reduces the network traffic by 94.1% and reduces the query latency by 82.4% with high search accuracy. © 2013 Springer-Verlag.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Waveform decreasing multi-copy based routing in low node density DTNs

Waveform decreasing multi-copy based routing in low node den...

引用

Joint International Conference on Pervasive computing and the Networked World, ICPCA/SWS 2012

作者： Yu, Chen Zhang, Longbo Jin, Hai Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642370144

Delay Tolerant Networks (DTN) is one of the mobile wireless networks that topology logic may change frequently. Variable topology logic characteristics lead to several low efficiency routing problems, and in which how to increase the routing efficiency in low node density is an important issue that must be solved. The mainstream DTN routing strategy is multi-copy based routing and in order to solve the problem of flooding scale, the routing strategy always makes the messages flooding scale change under specific conditions called Waveform Decreasing Multi-copy (WDM) routing strategy: the flooding scale could increase or decrease. In this paper, we propose an improved routing strategy named WDM routing strategy aimed to improve the routing efficiency under low node density in DTN environment. Using several special mechanisms, the improved WDM routing strategy can obtain good performance in the case of low node density: transfer new messages first, special message transfer list, and the way of flooding scale changed. The simulation results show the WDM routing significantly improve the performance than the two mainstream routing: the Spray and Wait routing and the MaxProp routing. © 2013 Springer-Verlag.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Cranduler: A dynamic and reusable scheduler for cloud infrastructure service

Cranduler: A dynamic and reusable scheduler for cloud infras...

引用

Joint International Conference on Pervasive computing and the Networked World, ICPCA/SWS 2012

作者： Shi, Xuanhua Xie, Bo Wu, Song Jin, Hai Zhu, Hongqing Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642370144

As an import trend of cyberspace in the future, cloud computing has attracted much attention from the IT industry. Many research institutions and companies have launched their own cloud platforms, which have virtual machine schedulers to manage the infrastructure resource pool. The virtual machine scheduling modules in these platforms are built in the platform and it is hard for developers to re-program. Since developers cannot design and implement special policies in the platform, the flexibility of the virtual machine scheduler is poor. Furthermore, the schedule architecture which has a firm and unchangeable interface is designed and customized for one kind of cloud platform. It leads to poor portability. To target the problems above, this paper presents a dynamic and reusable scheduling system for cloud infrastructure service, called Cranduler, which introduces the advantages of cluster schedulers to the virtual machine scheduling in cloud infrastructure. The scheduling policies of Cranduler could be dynamically configured by developers. Developers can easily insert the custom policy. In addition, Cranduler provides a set of unified interfaces to the cloud platform, which make the system easily access resources from different cloud platforms and be reused in different cloud platforms. © 2013 Springer-Verlag.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Cloud authentication based on anonymous one-time password

Cloud authentication based on anonymous one-time password

引用

7th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2012

作者： Yassin, Ali A. Jin, Hai Ibrahim, Ayad Qiang, Weizhong Zou, Deqing Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9789400758568

Cloud computing contains many enterprise applications that require from each user to perform authenticate at first step. Then, he will gain a permit from the service provider to access resources at second step. The issue breach remains facing a modern computing model. A more secure scheme is the two-factor authentication (2FA) that requires a second factor (such as finger print, token) with username/password. Nevertheless, the feasibility of 2FA is largely limited by high device cost, malicious attack and the deployment complexity. In this paper, we propose a scheme of 2FA in cloud computing systems that depends on One-Time Password (OTP), Asymmetric Scalar-product Preserving Encryption (ASPE) and RSA digital signature as two factors. Furthermore, it overcomes aforementioned issues and does not require extra devices such as token device, card reader in smart card and scanner in physiological biometrics. The proposed scheme distinguishes to resist practical attacks, high-security level, anonymous password, mutual authentication, identity management, the cloud server and a user can establish authenticated session keys, reduces the cost, and good performance. © 2013 Springer Science+Business Media.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

An enhanced security mechanism for web service based systems

An enhanced security mechanism for web service based systems

引用

Joint International Conference on Pervasive computing and the Networked World, ICPCA/SWS 2012

作者： Jiang, Wenbin Dong, Hao Jin, Hai Xu, Hui Liao, Xiaofei Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642370144

Web service technologies have been widely used in diverse applications. However, there are still many security challenges in reliability, confidentiality and data nonrepudiation, which are prominent especially in some Web service systems that have massive resources in diverse forms. An enhanced mechanism for secure accesses of Web resources is presented and implemented based on the combination of modules of identity authentication, authorized access, and secure transmission to improve the security level of these systems. In the identity authentication, the highly safe and recognized authentication method U-Key is used. For the aspect of authorized access, the integration of an improved Spring Security framework and J2EE architecture is applied to ensure authorized access to Web resources, while the security interceptor of Spring Security is extended and a series of security filters are added to keep web attacks away. Moreover, some improvements of the XML encryption and XML decryption algorithm are made to enhance the security and speed of data transmission, by means of mixing RSA and DES algorithm. The above security mechanism has been applied to an online virtual experiment platform based on Web services named VeePalms. The experimental results show that most security problems with high severity in the system have been solved and medium-low severe problems degreased dramatically. © 2013 Springer-Verlag.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Scalable SAPRQL querying processing on large RDF data in cloud computing environment

Scalable SAPRQL querying processing on large RDF data in clo...

引用

Joint International Conference on Pervasive computing and the Networked World, ICPCA/SWS 2012

作者： Wu, Buwen Jin, Hai Yuan, Pingpeng Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642370144

Recently the flexibility of RDF data model makes increasing number of organizations and communities keep their data available in the RDF format. There is a growing need for querying these data in scalable and efficient way. MapReduce is a parallel data processing solution for processing large data-intensive workloads, which is not supported directly for join-intensive workloads. In this paper, we present a schema based hybrid partitioning technique for RDF triples placement according to the relationships between them, and reduce the necessary number of MR cycles in each SAPRQL query job. Then we propose a lightweight sideways information passing techniques which pass the join information across MR jobs to decrease the intermediate results involved in join operations. The experimental results show that our approaches achieve a substantial performance improvement, and outperform the previous system by a factor of 2-20 using LUBM benchmark. © 2013 Springer-Verlag.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：