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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

333 篇 会议
140 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

309 篇 工学
- 282 篇 计算机科学与技术...
- 207 篇 软件工程
- 54 篇 信息与通信工程
- 32 篇 生物工程
- 25 篇 电气工程
- 21 篇 控制科学与工程
- 20 篇 电子科学与技术（可...
- 16 篇 网络空间安全
- 14 篇 动力工程及工程热...
- 10 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 光学工程
- 7 篇 化学工程与技术
- 5 篇 仪器科学与技术
- 5 篇 土木工程
- 5 篇 安全科学与工程
107 篇 理学
- 53 篇 数学
- 35 篇 生物学
- 19 篇 系统科学
- 11 篇 化学
- 9 篇 统计学（可授理学、...
- 8 篇 物理学
96 篇 管理学
- 68 篇 管理科学与工程(可...
- 36 篇 图书情报与档案管...
- 31 篇 工商管理
16 篇 法学
- 9 篇 社会学
- 7 篇 法学
9 篇 经济学
- 8 篇 应用经济学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 文学
3 篇 农学
2 篇 教育学
1 篇 军事学

主题

24 篇 grid computing
20 篇 computational mo...
15 篇 scalability
15 篇 cloud computing
14 篇 bandwidth
13 篇 semantics
11 篇 servers
11 篇 virtualization
10 篇 deep neural netw...
10 篇 feature extracti...
9 篇 memory managemen...
9 篇 computer archite...
9 篇 data models
9 篇 training
8 篇 computer science
8 篇 operating system...
8 篇 software enginee...
8 篇 mapreduce
8 篇 machine learning
8 篇 privacy

机构

100 篇 national enginee...
71 篇 services computi...
53 篇 school of comput...
44 篇 school of cyber ...
31 篇 cluster and grid...
28 篇 national enginee...
27 篇 cluster and grid...
26 篇 hubei engineerin...
25 篇 services computi...
24 篇 huazhong univers...
23 篇 hubei key labora...
18 篇 school of softwa...
15 篇 school of inform...
14 篇 zhejiang lab
13 篇 services computi...
12 篇 national enginee...
12 篇 national enginee...
12 篇 huazhong univers...
11 篇 services computi...
11 篇 cluster and grid...

作者

211 篇 jin hai
191 篇 hai jin
42 篇 xiaofei liao
37 篇 liao xiaofei
31 篇 deqing zou
29 篇 zou deqing
25 篇 wu song
24 篇 shi xuanhua
21 篇 song wu
19 篇 hu shengshan
17 篇 haikun liu
14 篇 jiang xiao
14 篇 ran zheng
13 篇 zhang leo yu
13 篇 yu zhang
12 篇 xia xie
12 篇 wan yao
12 篇 zhou ziqi
12 篇 li minghui
11 篇 zhang hongyu

语言

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

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

共 480 条记录，以下是331-340 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Near-duplicate detection using GPU-based simhash scheme

Near-duplicate detection using GPU-based simhash scheme

引用

International Conference on Smart computing (SMARTCOMP)

作者： Xiaowen Feng Hai Jin Ran Zheng Lei Zhu Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Information & Communication Company of Hunan Electric Power Corporation Changsha Hunan China

ISBN: (纸本)9781479957125

With the rapid growth of data, near-duplicate documents bearing high similarity are abundant. Elimination of near-duplicates can reduce storage cost and improve the quality of search indexes in data mining. A challenging problem is to find near-duplicate records in large-scale collections efficiently. There have already been several efforts on implementing near-duplicate detection on different architectures. In this paper, a new implementation, using a special hash function namely simhash, is proposed to identify near-duplicate documents on CUDA enabled devices. Two mechanisms are designed to achieve higher performance, including swapping and dynamic allocating. Experimental results show that our parallel implementation outperforms the serial CPU version, achieving up to 18 times.

关键词： Graphics processing units Fingerprint recognition Instruction sets Hamming distance Dynamic scheduling Kernel Computer architecture

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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 scalab.lity. 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 scalab.lity 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 scalab.lity 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

来源：评论

学校读者我要写书评

暂无评论

Supporting parallel soft real-time applications in virtualized environment

Supporting parallel soft real-time applications in virtualiz...

引用

22nd ACM International Symposium on High-Performance Parallel and Distributed computing, HPDC 2013

作者： Zhou, Like Wu, Song Sun, Huahua Jin, Hai Shi, Xuanhua Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781450319102

The prevalence of multicore processors and virtualization technology enables parallel soft real-time applications to run in virtualized environment. However, current hypervisors do not provide adequate support for them because of soft real-time constraints and synchronization problems, which result in frequent deadline misses and serious performance degradation. In this paper, we propose a novel parallel soft real-time scheduling algorithm which addresses them well, and implement a parallel soft real-time scheduler, named Poris, based on Xen. Our evaluation shows that Poris shortens the execution time of PARSEC benchmark by up to 44.12% compared to Credit scheduler. © 2013 Authors.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Accelerating GPGPU architecture simulation

Accelerating GPGPU architecture simulation

引用

2013 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer systems, SIGMETRICS 2013

作者： Yu, Zhibin Eeckhout, Lieven Goswami, Nilanjan Li, Tao John, Lizy K. Jin, Hai Xu, Chengzhong Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China ELIS Department Ghent University Belgium Intelligent Design of Efficient Architectures Lab. University of Florida Gainesville FL United States Department of Electrical and Computer Engineering University of Texas Austin TX United States Service Computing Technologies and System Lab./Cluster and Grid Computing Lab. HUST Wuhan China Department of Electrical and Computer Engineering Wayne State University MI United States

ISBN: (纸本)9781450319003

Recently, graphics processing units (GPUs) have opened up new opportunities for speeding up general-purpose parallel applications due to their massive computational power and up to hundreds of thousands of threads enabled by programming models such as CUDA. However, due to the serial nature of existing micro-architecture simulators, these massively parallel architectures and workloads need to be simulated sequentially. As a result, simulating GPGPU architectures with typical benchmarks and input data sets is extremely time-consuming. This paper addresses the GPGPU architecture simulation challenge by generating miniature, yet representative GPGPU kernels. We first summarize the static characteristics of an existing GPGPU kernel in a profile, and analyze its dynamic behavior using the novel concept of the divergence flow statistics graph (DFSG). We subsequently use a GPGPU kernel synthesizing framework to generate a miniature proxy of the original kernel, which can reduce simulation time significantly. The key idea is to reduce the number of simulated instructions by decreasing per-thread iteration counts of loops. Our experimental results show that our approach can accelerate GPGPU architecture simulation by a factor of 88X on average and up to 589X with an average IPC relative error of 5.6%.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Vehicle Tracking with Non-overlapping Views for Multi-camera Surveillance system

Vehicle Tracking with Non-overlapping Views for Multi-camera...

引用

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Wenbin Jiang Chang Xiao Hai Jin Shuo Zhu Zhiwei Lu Services Computing Technology and System Lab Cluster and Grid Computing Huazhong University of Science and Technology Wuhan China

With the rapid development of intelligent video surveillance system for transportation, traditional single-camera-based video analysis has become insufficient. Many researches have focused on the non-overlapping multi-camera target tracking. However, the tracking precision and the computing overhead are still big obstacles. This paper proposes a novel vehicle tracking approach for non-overlapping multi-camera targets with data fusion by using minimum cost and maximum flow method. Structured information of moving targets is extracted and associated with other information such as motion time, the topology of camera network to solve targeted vehicle tracks. Besides, to improve the performance of the process, a parallelization algorithm for camera network topology partitioning is presented, which makes it possible for each sub-graph to track target independently in parallel. The experiment results show that the presented approach is able to perform target vehicle tracking analysis with high efficiency and accuracy.

关键词： Cameras Target tracking Vehicles Feature extraction Network topology Topology

来源：评论

学校读者我要写书评

暂无评论

MultiGreen: Cost-minimizing multi-source datacenter power supply with online control 13

MultiGreen: Cost-minimizing multi-source datacenter power su...

引用

4th ACM International Conference on Future Energy systems, e-Energy 2013

作者： Deng, Wei Liu, Fangming Jin, Hai Wu, Chuan Liu, Xue Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Hong Kong Hong Kong Hong Kong School of Computer Science McGill University Montreal QC Canada

ISBN: (纸本)9781450320528

Faced by soaring power cost, large footprint of carbon emission and unpredictable power outage, more and more modern Cloud Service Providers (CSPs) begin to mitigate these challenges by equipping their Datacenter Power Supply system (DPSS) with multiple sources: (1) smart grid with timevarying electricity prices, (2) uninterrupted power supply (UPS) of finite capacity, and (3) intermittent green or renewable energy. It remains a significant challenge how to operate among multiple power supply sources in a complementary manner, to deliver reliable energy to datacenter users over time, while minimizing a CSP's operational cost over the long run. This paper proposes an efficient, online control algorithm for DPSS, called MultiGreen. MultiGreen is based on an innovative two-timescale Lyapunov optimization technique. Without requiring a priori knowledge of system statistics, MultiGreen allows CSPs to make online decisions on purchasing grid energy at two time scales (in the long-term market and in the real-time market), leveraging renewable energy, and opportunistically charging and discharging UPS, in order to fully leverage the availab.e green energy and low electricity prices at times for minimum operational cost. Our detailed analysis and trace-driven simulations based on one-month real-world data have demonstrated the optimality (in terms of the tradeoff between minimization of DPSS operational cost and satisfaction of datacenter availab.lity) and stability (performance guarantee in cases of fluctuating energy demand and supply) of MultiGreen. © 2013 ACM.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共48页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：