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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

416 篇 会议
157 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

350 篇 工学
- 314 篇 计算机科学与技术...
- 228 篇 软件工程
- 59 篇 信息与通信工程
- 33 篇 生物工程
- 28 篇 电气工程
- 24 篇 电子科学与技术（可...
- 24 篇 控制科学与工程
- 19 篇 网络空间安全
- 17 篇 动力工程及工程热...
- 15 篇 机械工程
- 13 篇 交通运输工程
- 10 篇 生物医学工程（可授...
- 9 篇 安全科学与工程
- 8 篇 光学工程
- 8 篇 化学工程与技术
- 6 篇 仪器科学与技术
- 6 篇 土木工程
121 篇 理学
- 64 篇 数学
- 36 篇 生物学
- 21 篇 系统科学
- 13 篇 化学
- 13 篇 统计学（可授理学、...
- 10 篇 物理学
99 篇 管理学
- 79 篇 管理科学与工程(可...
- 32 篇 工商管理
- 32 篇 图书情报与档案管...
15 篇 法学
- 8 篇 法学
- 7 篇 社会学
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...

机构

102 篇 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...
16 篇 zhejiang lab
15 篇 school of inform...
13 篇 services computi...
13 篇 huazhong univers...
12 篇 national enginee...
12 篇 national enginee...

作者

248 篇 jin hai
242 篇 hai jin
60 篇 xiaofei liao
51 篇 liao xiaofei
39 篇 deqing zou
33 篇 shi xuanhua
32 篇 zou deqing
30 篇 wu song
27 篇 song wu
23 篇 hu shengshan
22 篇 ran zheng
19 篇 long zheng
19 篇 haikun liu
18 篇 jiang wenbin
17 篇 yu zhang
16 篇 zhang leo yu
16 篇 xuanhua shi
15 篇 jiang xiao
13 篇 xia xie
13 篇 yuan pingpeng

语言

556 篇 英文
19 篇 其他
6 篇 中文

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

共 580 条记录，以下是71-80 订阅

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

详细简洁

排序：

Container-Based Customization Approach for Mobile Environments on Clouds 13th

Container-Based Customization Approach for Mobile Environmen...

引用

13th International Conference on Green, Pervasive, and Cloud computing, GPC 2018

作者： Hu, Jiahuan Wu, Song Jin, Hai Chen, Hanhua Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783030150921

Recently, mobile cloud which utilizes the elastic resources of clouds to provide services for mobile applications, is becoming more and more popular. When building a mobile cloud platform (MCP), one of the most important things is to provide an execution environment for mobile applications, e.g., the Android mobile operating system (OS). Many efforts have been made to build Android environments on clouds, such as Android virtual machines (VMs) and Android containers. However, the need of customizable Android execution environments for MCP has been ignored for many years, since the existing OS customization solutions are only designed for hardware-specific platforms or driver-specific applications, and taking little account of frequently-changing scenarios on clouds. Moreover, they lack a unified method of customization, as well as an effective upgrade and maintenance mechanism. As a result, they are not suitable for varied and large-scale scenarios on clouds. Therefore, in this paper, we propose a unified and effective approach for customizing Android environments on clouds. The approach provides a container-based solution to custom-tailor Android OS components, as well as a way to run Android applications for different scenarios. Under the guidance of this approach, we develop an automatic customization toolkit named AndroidKit for generating specific Android OS components. Through this toolkit, we are able to boot new Android VM instances called AndroidXs. These AndroidXs are composed of OS images generated by AndroidKit, which can be easily customized and combined for varied demands on clouds. © 2019, Springer Nature Switzerland AG.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

Minimizing Overheads of Checkpoints in Distributed Stream Processing systems 7

Minimizing Overheads of Checkpoints in Distributed Stream Pr...

引用

7th IEEE International Conference on Cloud Networking, CloudNet 2018

作者： Muhammad Abrar Akber, Syed Chen, Hanhua Wang, Yonghui Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab Services Computing Technology and System Lab Big Data Technology and System Lab Wuhan430074 China

ISBN: (纸本)9781538668313

Failure occurrence in large-scale systems is inevitable, which makes the resilience a key challenge for modern systems. Checkpoints with rollback recovery is a well-known approach to provide fault tolerance in distributed systems. The checkpoint based fault tolerance approach periodically persists the application state to reliable storage, which serves as a recovery point in case of failure. These periodic checkpoints are not inline with the failure rate of the systems as many studies conclude that failure occurrence is not periodic. The optimal size of checkpoint interval is a crucial decision, which directly determines the checkpoint overheads. To minimize the checkpoint overheads, we propose to reduce the number of checkpoints during the application execution. We suggest reducing the number of checkpoints by successively increasing the checkpoint intervals. We consider the failure probability of the underlying infrastructure and iteratively increase the checkpoint intervals. The proposed checkpoint approach tailors the checkpoint initializing based on the failure probability. If failure probability is low, it increases the checkpoint interval, and eventually reduces the total number of checkpoints triggered during application timespan. Reducing the total number of checkpoints during application execution results in decreasing the checkpoint overheads. The experiment results show that the proposed checkpoint policy considerably reduces the checkpoint overheads as compared to periodic checkpoints. © 2018 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

引用

25th IEEE International Conference on Network Protocols, ICNP 2017

作者： Chen, Hanhua Zhang, Fan Jin, Hai Cluster and Grid Computing Lab Services Computing Technology and System Lab Big Data Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781509065011

Real-world stream data with skewed distribution raises unique challenges to distributed stream processing systems. Existing stream workload partitioning schemes usually use a 'one size fits all' design, which leverage either a shuffle grouping or a key grouping strategy for partitioning the stream workloads among multiple processing units, leading to notable problems of unsatisfied system throughput and processing latency. In this paper, we show that the key grouping based schemes result in serious load imbalance and low computation efficiency in the presence of data skewness while the shuffle grouping schemes are not scalable in terms of memory space. We argue that the key to efficient stream scheduling is the popularity of the stream data. We propose and implement a differentiated distributed stream processing system, call DStream, which assigns the popular keys using shuffle grouping while assigns unpopular ones using key grouping. We design a novel efficient and light-weighted probabilistic counting scheme for identifying the current hot keys in dynamic real-time streams. Two factors contribute to the power of this design: 1) the probabilistic counting scheme is extremely computation and memory efficient, so that it can be well integrated in processing instances in the system;2) the scheme can adapt to the popularity changes in the dynamic stream processing environment. We implement the DStream system on top of Apache Storm. Experiment results using large-scale traces from real-world systems show that DStream achieves a 2.3× improvement in terms of processing throughput and reduces the processing latency by 64% compared to state-of-the-art designs. © 2017 IEEE.

关键词： Higher order statistics

来源：评论

学校读者我要写书评

暂无评论

A Novel routing scheme for paired peers in P2P network

A Novel routing scheme for paired peers in P2P network

引用

2007 Asian technology Information Program's (ATIP's) 3rd Workshop on High Performance computing in China - Solution Approaches to Impediments for High Performance computing, CHINA HPC'07

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

ISBN: (纸本)9781595939036

Peer-to-Peer (P2P) networks have been shown to be a promising approach to provide instant voice services over the Internet for its potential high scalability. However, for one paired peers, how to efficiently transmit voice data among peers in such networks remains a major challenge. Hereby this paper proposed some hybrid routing schemes for P2P transmitting system, which include improved random detection algorithm, delay binary tree search algorithm, AS-aware discovery algorithm. With the help of these novel routing schemes, we can choose the correct algorithm to transfer media data, in small size but low delay, among peers in P2P network. Simulations show that these new routing strategies achieve obvious effect. © 2008 ACM.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Agent-based data loading method in medlmgrid

Agent-based data loading method in medlmgrid

引用

2009 International Conference on New Trends in Information and Service Science, NISS 2009

作者： Zheng, Ran Jin, Hai Zhang, Qin Liu, Xin Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769536873

Agent-based grid data loading method aims at integrating heterogeneous hospitals' information systems into a medical information exchange platform based on grid middleware. It collects distributed data sets for decision support system, which makes data sources expanded from independent database modes to medical information systems in wide area. Virtual data access with grid service improves data security and makes data modification in local system more flexible. HL7 protocol and middleware are utilized to transform HL7 data into various local data structures for keeping the independence of each hospital information system and providing more convenience and expansibility for various medical applications. © 2009 IEEE.

关键词： Medical applications

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

VAST: Automatically combining keywords and visual features for web image retrieval

VAST: Automatically combining keywords and visual features f...

引用

2008 10th International Conference on Advanced Communication technology

作者： Hai, Jin Ruhan, He Wenbing, Tao Aobing, Sun Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9788955191356

A large-scale image retrieval system for the WWW, named VAST (VisuAl & SemanTic image search), is presented in this paper. Based on the existing inverted file and visual feature clusters, we form a semantic network on top of the keyword association on the visual feature clusters. The system is able to automatically combine keyword and visual features for retrieval by the semantic network The combination is automatic, simple, and very fast, which is suitable for large-scale web dataset Meanwhile, the retrieval takes advantage of the semantic contents of the images in addition to the low-level features, which remarkably improves the retrieval precision. The experimental results demonstrate the superiority of the system.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Ontology based grid information interoperation

Ontology based grid information interoperation

引用

21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07

作者： Di, Sheng Jin, Hai Li, Shengli Chen, Ling Qi, Li Wang, Chengwei Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0769528473

A series of problems arises with the emergence and fast development of grid. Among all the problems, one of them is how to smoothly connect heterogeneous grid platforms. There are a number of ways to solve this problem and the relatively more efficient one is using ontology. Based on this method, we focus on alleviating semantic inconsistency of various platforms and designing a novel ontology. This ontology is depicted by Resource Description Framework (RDF) and transacted by adapters. Finally, we test our method and analyze its performance. © 2007 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Scalable DHT-based Information Service for large-scale grids 08

Scalable DHT-based Information Service for large-scale grids

引用

2008 Conference on computing Frontiers, CF'08

作者： Jin, Hai Tao, Yongcai Wu, Song Shi, Xuanhua Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605580777

Current grid information service is centralized or hierarchical and proves inefficient as grid scale rapidly increases. The introduction of P2P techniques into grids breaks an encouraging path. However, frequent join and departure of resource nodes require strong self-organization capacity of system to maintain their rigid structure. Moreover, arranging identifier space for P2P nodes is knotty and has great impact on system performance. If the identifier space is too large, some nodes will be overloaded. On the contraiy, small identifier space will bring the same problem as millennium bug. To address the issues, this paper proposes a scalable DHT-based (Distributed Hash Table) Information Service (DIS) for grid system, which organizes grid resources into a DHT ring based on VO (Virtual Organization). To save the identifier space while retaining the scalability and system performance, only stable VOs can join DIS via a new DHT node, whereas volatile VOs join DIS through being the sub-domain of other VO. Experimental results show that DIS provides rapid resource query, strong scalability and high throughput, meanwhile avoiding the key node failure as well as the bottleneck problem. Copyright 2008 ACM.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：