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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

389 篇 会议
159 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

348 篇 工学
- 311 篇 计算机科学与技术...
- 223 篇 软件工程
- 60 篇 信息与通信工程
- 34 篇 生物工程
- 26 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 17 篇 网络空间安全
- 15 篇 动力工程及工程热...
- 14 篇 机械工程
- 9 篇 交通运输工程
- 9 篇 生物医学工程（可授...
- 7 篇 光学工程
- 7 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 5 篇 建筑学
- 5 篇 土木工程
118 篇 理学
- 62 篇 数学
- 37 篇 生物学
- 19 篇 系统科学
- 11 篇 化学
- 11 篇 统计学（可授理学、...
- 10 篇 物理学
114 篇 管理学
- 80 篇 管理科学与工程(可...
- 43 篇 图书情报与档案管...
- 37 篇 工商管理
17 篇 法学
- 10 篇 社会学
- 7 篇 法学
9 篇 经济学
- 8 篇 应用经济学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 文学
3 篇 农学
2 篇 教育学
1 篇 军事学
1 篇 艺术学

主题

38 篇 grid computing
24 篇 computational mo...
18 篇 bandwidth
18 篇 servers
17 篇 scalability
17 篇 computer archite...
17 篇 cloud computing
13 篇 computer science
13 篇 memory managemen...
13 篇 semantics
12 篇 virtualization
11 篇 feature extracti...
11 篇 virtual machinin...
10 篇 operating system...
10 篇 deep neural netw...
10 篇 data models
9 篇 parallel process...
9 篇 peer to peer com...
9 篇 throughput
9 篇 resource managem...

机构

100 篇 national enginee...
71 篇 services computi...
55 篇 school of comput...
44 篇 school of cyber ...
31 篇 cluster and grid...
29 篇 cluster and grid...
28 篇 national enginee...
28 篇 cluster and grid...
26 篇 hubei engineerin...
25 篇 huazhong univers...
25 篇 services computi...
23 篇 hubei key labora...
18 篇 school of softwa...
17 篇 zhejiang lab
15 篇 school of inform...
13 篇 services computi...
12 篇 national enginee...
12 篇 service computin...
12 篇 national enginee...
12 篇 huazhong univers...

作者

238 篇 hai jin
237 篇 jin hai
56 篇 xiaofei liao
50 篇 liao xiaofei
38 篇 deqing zou
32 篇 zou deqing
28 篇 song wu
25 篇 wu song
22 篇 haikun liu
22 篇 shi xuanhua
19 篇 hu shengshan
17 篇 long zheng
16 篇 yu zhang
15 篇 ran zheng
15 篇 xuanhua shi
14 篇 jiang xiao
14 篇 liu haikun
13 篇 wan yao
13 篇 zhang leo yu
13 篇 jiang wenbin

语言

528 篇 英文
22 篇 其他
6 篇 中文

检索条件"机构=Cluster and Grid Computing Lab"

共 555 条记录，以下是371-380 订阅

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

详细简洁

排序：

SDPMN: Privacy Preserving MapReduce Network Using SDN

SDPMN: Privacy Preserving MapReduce Network Using SDN

引用

International Conference on Cloud computing and Big Data (CCBD)

作者： He Li Hai Jin 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

ISBN: (纸本)9781479966226

MapReduce is a popular programming model and an associated implementation for parallel processing big data in the distributed environment. Since large scaled MapReduce data centers usually provide services to many users, it is an essential problem to preserve the privacy between different applications in the same network. In this paper, we propose SDPMN, a framework that using software defined network (SDN) to distinguish the network between each application, which is a manageable and scalable method. We design this framework based on the existing SDN structure and Hardtop networks. Since the rule space of each SDN device is limited, we also propose the rule placement optimization for this framework to maximize the hardware supported isolated application networks. We state this problem in a general MapReduce network and design a heuristic algorithm to find the solution. From the simulation based evaluation, with our algorithm, the given network can support more privacy preserving application networks with SDN switches.

关键词： Privacy Ports (Computers) Data privacy Network topology Virtualization IP networks Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

esDMT: Efficient and scalable deterministic multithreading through memory isolation

esDMT: Efficient and scalable deterministic multithreading t...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Jie Sun Xiaofei Liao Long Zheng Hai Jin Yu Zhang School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Cluster and Grid Computing Lab

Deterministic multithreading (DMT) system is well-known to eliminate the harmful program behaviors caused by nondeterminism, i.e., always proceeding the program execution into the same thread schedule for the same given input. To achieve this goal, two kinds of schedules are enforced by existing DMT systems. 1) A mem-based schedule ensures the determinism with the total order of the shared memory accesses, and 2) A sync-based schedule makes it by only enforcing the total order of the synchronization operations. Mem-schedule achieves full determinism but suffers from prohibitive overhead; while sync-schedule mitigates this overhead but cannot ensure the determinism for the race schedules, i.e., part determinism. Much recent research is devoted to the hybrid schedule combining the determinism of mem-schedule and efficiency of sync-schedule. However, they suffer from the practicability and scalability problems due to the defects of their technical characteristics, such as trace collection in advance and huge schedule memoization. To address the above problem, this paper proposes esDMT, an efficient and scalable DMT system using a new technique of memory isolation. It can improve the efficiency by proceeding the execution of each thread in parallel within its private virtual memory, and defers the determinism guarantee by updating private memory into shared memory in a deterministic order according to deterministic lock algorithm, thus further reducing the overhead of inter-thread waiting. In contrast to the previous hybrid work avoiding the nondeterminism of race schedules offline based on the enormous historical records, our key insight is to eliminate the nondeterminism of race schedules online at runtime. Our experimental results on PARSEC benchmarks show that esDMT eliminates the nondeterminism successfully, almost gains the same performance as the sync-schedule (with

关键词： Instruction sets Schedules Synchronization Scalability Clocks Computer crashes Runtime

来源：评论

学校读者我要写书评

暂无评论

A Secure Synchronized Reading System over Time-Critical Online Contests

A Secure Synchronized Reading System over Time-Critical Onli...

引用

IEEE International Conference on Communications

作者： Wei Wang Peng Xu Hui Li Laurence Tianruo Yang Key Lab of Cloud Computing Technology Peking University Shenzhen China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Embedded and Pervasive Computing Lab Huazhong University of Science and Technology Wuhan China

The time-critical online contest environment calls for an elegant and precise management system to start a contest online. The management system should simultaneously follow three rules of security that are confidentiality, anonymity and fairness. We present in this paper a novel system named Secure Synchronized Reading (SSR) system as well as its corresponding security model according to the three rules. SSR can evoke a synchronized start for all competitors in a contest at the intended time by employing a Randomness-reused Identity-Based Encryption (RIBE) scheme. It can avoid huge differences among delivery delays of heterogeneous competitors and any false start by an adverse competitor. Consequently when an online contest begins, the SSR system performs quasi real-time with ignorable communication delays in the security model. As a complement, the analysis on the provable security of SSR is given finally, as well as a further analysis on the achievement of synchronization.

关键词： Synchronization Encryption Delays Real-time systems Identity-based encryption

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Exploiting Spatial Locality to Improve Disk Efficiency in Virtualized Environments

Exploiting Spatial Locality to Improve Disk Efficiency in Vi...

引用

International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Xiao Ling Shadi Ibrahim Hai Jin Song Wu Songqiao Tao Cluster and Grid Computing Lab Services Computing Technology Huazhong University of Science and Technology Wuhan China INRIA Rennes - Bretagne Atlantique Rennes France

Virtualization has become a prominent tool in data centers and is extensively leveraged in cloud environments: it enables multiple virtual machines (VMs) - with multiple operating systems and applications - to run within a physical server. However, virtualization introduces the challenging issue of preserving the high disk utilization (i.e., reducing the seek delay and rotation overhead) when allocating disk resources to VMs. Exploiting spatial locality, a key technique for improving disk utilization and performance, faces additional challenges in the virtualized cloud because of the transparency feature of virtualization (hyper visors do not have the information about the access patterns of applications running within each VM). To this end, this paper contributes a novel disk I/O scheduling framework, named Pregather, to improve disk I/O efficiency through exposure and exploitation of the special spatial locality in the virtualized environment (regional and sub-regional spatial locality corresponds to the virtual disk space and applications' access patterns, respectively), thereby improving the performance of disk-intensive applications without harming the transparency feature of virtualization (without a priori knowledge of the applications' access patterns). The key idea behind Pregather is to implement an intelligent model to predict the access regularity of sub-regional spatial locality for each VM. We implement the Pregather disk scheduling framework and perform extensive experiments that involve multiple simultaneous applications of both synthetic benchmarks and a MapReduce application on Xen-based platforms. Our experiments demonstrate the accuracy of our prediction model and indicate that Pregather results in the high disk spatial locality and a significant improvement in disk throughput and application performance.

关键词： Virtual machine monitors Virtualization Predictive models Analytical models Prediction algorithms Data models Throughput

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：