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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

169 篇 会议
70 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

99 篇 工学
- 75 篇 计算机科学与技术...
- 49 篇 软件工程
- 16 篇 信息与通信工程
- 11 篇 生物工程
- 9 篇 电气工程
- 9 篇 网络空间安全
- 7 篇 控制科学与工程
- 5 篇 机械工程
- 4 篇 动力工程及工程热...
- 4 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 轻工技术与工程
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
34 篇 理学
- 15 篇 生物学
- 13 篇 数学
- 5 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 大气科学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 天文学
30 篇 管理学
- 26 篇 管理科学与工程(可...
- 7 篇 工商管理
- 4 篇 图书情报与档案管...
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 2 篇 作物学
2 篇 医学
- 2 篇 基础医学(可授医学...

主题

30 篇 grid computing
25 篇 virtual machinin...
20 篇 peer to peer com...
19 篇 servers
16 篇 computers
15 篇 computer science
15 篇 cloud computing
14 篇 resource managem...
13 篇 bandwidth
12 篇 application soft...
12 篇 kernel
11 篇 protocols
11 篇 virtual machine ...
11 篇 hardware
10 篇 scalability
9 篇 operating system...
8 篇 computational mo...
8 篇 computer network...
8 篇 large-scale syst...
7 篇 access control

机构

52 篇 services computi...
38 篇 school of comput...
38 篇 school of cyber ...
28 篇 national enginee...
26 篇 hubei key labora...
26 篇 hubei engineerin...
24 篇 services computi...
24 篇 cluster and grid...
17 篇 school of softwa...
15 篇 school of inform...
12 篇 national enginee...
11 篇 services computi...
11 篇 cluster and grid...
8 篇 huazhong univers...
8 篇 services computi...
8 篇 jinyinhu laborat...
7 篇 cluster and grid...
6 篇 key laboratory o...
5 篇 cluster and grid...
5 篇 nanyang technolo...

作者

134 篇 hai jin
45 篇 jin hai
25 篇 xiaofei liao
24 篇 deqing zou
20 篇 song wu
18 篇 hu shengshan
14 篇 zhang leo yu
13 篇 li minghui
13 篇 fangming liu
12 篇 xuanhua shi
11 篇 zou deqing
11 篇 zhou ziqi
10 篇 ran zheng
9 篇 long zheng
8 篇 qin zhang
8 篇 wan wei
8 篇 hong yao
7 篇 kan hu
7 篇 shi xuanhua
7 篇 wang xianlong

语言

225 篇 英文
12 篇 中文
4 篇 其他

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

共 241 条记录，以下是131-140 订阅

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

详细简洁

排序：

A Hierachical VoIP system Based on Peer-to-Peer SIP: A Manageable Approach

A Hierachical VoIP System Based on Peer-to-Peer SIP: A Manag...

引用

International Conference on Computer and Information technology (CIT)

作者： Linchen Yu Xiaofei Liao Hai Jin Pengcheng Qin Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer China University of Geoscience Wuhan China

Peer-to-Peer SIP is proposed to leverage Peer-to-Peer computing to control multimedia sessions in a decentralized manner. A lot of companies can be benefited if conventional SIP environment does not require the configuration and maintenance of central servers. However, existing P2PSIP systems put too much emphasis on the decentralization of SIP elements and the briefness of distribution. To some extent, P2PSIP system is manageable, but the control of the entire system is still relatively weak. In this paper, we propose a hierarchical P2PSIP system to address the manageable problems. Actual deployment and exhaustive simulations are performed to evaluate the performance of our P2PSIP schemes. Results indicate that the manageable approach not only solves the control liability problem, but also performs good reliability, scalability, and interoperability.

关键词： Servers Tin Reliability Protocols IP networks Authentication Registers

来源：评论

学校读者我要写书评

暂无评论

A Web-Based Phylogenetic Analysis for a Query Gene

A Web-Based Phylogenetic Analysis for a Query Gene

引用

International Conference on Bioinformatics and Biomedical Engineering (ICBBE)

作者： Shenglong Tan Song Wu School of Computer Hubei University of Economics Wuhan China Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

We present a robust web server called Phytree of a query gene for phylogenetic analysis from the latest protein database with a user-friendly, interactive graphical user interface. Phytree of a query gene combines a BLAST search with a suite of tools that allows interactive, phylogenetic-oriented exploration of the BLAST results and flexible selection of homologous sequences among the BLAST hits. Once the selection of the BLAST hits is done, the corresponding sequences can be passed to the phylogenetic tree reconstruction pipelines (multiple alignment, data process, phylogenetic reconstruction, tree visualization). As the major technological innovation, selection of a meaningful subset of BLAST hits is implemented using pipeline programming and tree visualization used Java-based recursive method that allows trees to be integrated and viewed seamlessly in standard web browsers with no extra software required. Phytree of a query gene only needs users to copy their amino acid sequence of their query gene to the input box, and the phylogenetic tree will be built once and for all. This function is very practical for non-specialist in phylogeny. Moreover, Phytree of a query gene introduces several new methods in treatment of intermediate results, which makes it much faster, easier and more accurate, robust in phylogenetic tree reconstruction. It is specially designed for users who have no experience in phylogeny. It is freely available on our web page: http://211.69.198.144/***.

关键词： Phylogeny Databases Pipelines Proteins Bioinformatics Visualization Software

来源：评论

学校读者我要写书评

暂无评论

SMOG: Accelerating Subgraph Matching on GPUs

SMOG: Accelerating Subgraph Matching on GPUs

引用

IEEE Conference on High Performance Extreme computing (HPEC)

作者： Zhibin Wang Ziheng Meng Xue Li Xi Lin Long Zheng Chen Tian Sheng Zhong State Key Laboratory for Novel Software Technology Nanjing University Alibaba Group“ National Engineering Research Center for Big Data Technology and System/ Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Zhejiang Lab

Subgraph matching is a crucial problem in graph theory with diverse applications in fields, such as bioinformatics, social networks and recommendation systems. Accelerating subgraph matching can be greatly facilitated by GPUs, which offer exceptional parallelism and high memory bandwidth. By leveraging the power of multiple GPU cards, subgraph matching can be scaled to achieve unprecedented levels of performance. In this paper, we propose SMOG, an abbreviation for. Subgraph Matching On Multi-Card GPUs. It is a general, high-performance and scalable sub graph matching system that utilizes multi-card GPUs. To address the issue of duplication resulting from subgraph automorphism, SMOG introduces a two-step approach. Firstly, it analyzes the symmetry within the subgraph. Then, it adaptively adjusts the graph preprocessing and generates subgraph-aware GPU codes tailored to the given subgraph. Furthermore, SMOG leverages multi-level parallelism by designing the specific strategy for each level, enabling it to scale from 1 to 1,024 GPU cards, resulting in an extraordinary $553\times$ speedup. We evaluate SMOG on various subgraph queries and datasets. The experimental results demonstrate that SMOG outperforms the triangle-specific system TRUST with an average speedup of $2.94\times$ . And it performs significantly better than the subgraph matching system RPS by $203.55\times$ and the graph processing system Gunrock by 35, $455.52\times$ on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Public auditing for secure data storage in cloud through a third party auditor using modern ciphertext

Public auditing for secure data storage in cloud through a t...

引用

International Symposium on Information Assurance and Security (IAS)

作者： Zaid Alaa Hussien Hai Jin Zaid Ameen Abduljabbar Ali A. Yassin Mohammed Abdulridha Hussain Salah H. Abbdal Deqing Zou Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China University of Basrah Basrah Iraq

ISBN: (纸本)9781467387163

Outsourced data in cloud and computation results are not always trustworthy because data owners lack physical possession and control over the data as a result of virtualization, replication, and migration techniques. Protecting outsourced data from security threats has become a challenging and potentially formidable task in cloud computing; hence, many schemes have focused on ameliorating this problem and on enabling public auditability for cloud data storage security. These schemes drop into two categories: total computation cost and burden on client side. Researchers have used bilinear map technology with public key cryptography. Although this technology is highly efficient, computation time is long and overhead cost is high. The client needs to perform numerous computations to ensure the integrity of data storage. To reduce auditing cost, we propose an efficient and robust scheme to maintain data integrity in cases that involve public auditing. Our scheme adopts modern cipher cryptography with a cryptographic hash function. We consider allowing a third party auditor to preprocess data on behalf of cloud users before uploading them to cloud service providers and then verifying data integrity afterward. Our proposed scheme has important security characteristics, such as privacy, key management, low cost computation, key exchange, low overhead cost, no burden on client side, inability of cloud service providers to create correct verifier respond without data, and one-time key. Finally, efficiency analysis shows that our scheme is faster and more cost-efficient than the bilinear map-based scheme.

关键词： Cloud computing Cryptography Memory Metadata Outsourcing Protocols

来源：评论

学校读者我要写书评

暂无评论

Modeling and Analyzing Dynamic Forensics system Based on Intrusion Tolerance

Modeling and Analyzing Dynamic Forensics System Based on Int...

引用

International Conference on Computer and Information technology (CIT)

作者： Lin Chen Zhitang Li Cuixia Gao Yingshu Liu School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

As an important part of computer forensics, network forensics particularly places emphasis on dynamic network information collection and proactive defense. Most forensics systems based on intrusion detection or honeypot rarely emphasize the availability of actual servers. In addition, few of them discussed the occasion of dynamic forensics particularly. The work presented in this paper is based on an idea to assist dynamic forensics with intrusion tolerance and deception technology to enhance the availability of server system and gather more useful evidences on a proper occasion. A mechanism of dynamic forensics based on intrusion forensics is proposed and is modeled with finite state machine. The workflow is described. A semi Markov process based on the embedded Markov chain of the states transition model is built and described. Finally, the forensics capability and server availability are analysis. According to the numerical analysis result, the security performance and forensics capability of the forensics system are enhanced to a certain degree.

关键词： Intrusion detection Computer networks Information analysis Computer science Markov processes Grid computing Network servers Protection Digital forensics Law

来源：评论

学校读者我要写书评

暂无评论

A Novel Application-layer Relay Strategy for Low Delay P2P SIP VoIP system

A Novel Application-layer Relay Strategy for Low Delay P2P S...

引用

International Conference on Ubiquitous Information Technologies and Applications (ICUT)

作者： Hong Yao Hai Jin Siwei Zhou Linchen Yu Xiaofei Liao Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Geoscience Wuhan China

Development of Internet brings the great increasing communication requirement. This demand impels the developing progress of Voice over Internet Protocol (VoIP). It is difficult to supply the high quality user experience for VoIP services, which has brought great challenges to VoIP developer because of the dynamic property of Internet. We obtain the following results in lots of existing VoIP systems: (1) many relay peer selections are suboptimal; (2) the waiting time to select a relay node can be quite long; (3) there are a large number of unnecessary probes, resulting in heavy network traffic. This paper presents a way called novel application-layer relay strategy (NARS) to solve relay problem and improve scalability. We introduce the mechanism in detail, and test our mechanism in NS2 network simulation environment and get a high relay node hit ratio result, which confirms the feasibility of NARS. Also we make a comparison with the other existing models.

关键词： Relays Delay Peer to peer computing Internet telephony Web and internet services Probes Telecommunication traffic Traffic control Scalability Testing

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource scheduling in cloud radio access network with mobile cloud computing

Dynamic resource scheduling in cloud radio access network wi...

引用

International Workshop on Quality of Service

作者： Xinhou Wang Kezhi Wang Song Wu Sheng Di Kun Yang Hai Jin Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan China University of Essex UK Argonne National Laboratory USA

Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile cloud computing (MCC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile users' devices to provide better quality of service (QoS). But the power consumption has become skyrocketing for MSP as it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MCC separately while less work had considered the integration of C-RAN with MCC. In this paper, we present a unifying framework for optimizing the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MCC to minimize the power consumption of MSP while still guaranteeing the QoS for mobile users. Our objective is to maximize the profit of MSP. To achieve this objective, we first formulate the resource scheduling issue as a stochastic problem and then propose a Resource onlIne sCHeduling (RICH) algorithm using Lyapunov optimization technique to approach a time average profit that is close to the optimum with a diminishing gap (1/V) for MSP while still maintaining strong system stability and low congestion to guarantee the QoS for mobile users. With extensive simulations, we demonstrate that the profit of RICH algorithm is 3.3× (18.4×) higher than that of active (random) algorithm.

关键词： Mobile communication Servers Power demand Cloud computing Mobile computing Quality of service Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

A Cloud Service Cache system Based on Memory Template of Virtual Machine

A Cloud Service Cache System Based on Memory Template of Vir...

引用

ChinaGrid Annual Conference (ChinaGrid)

作者： Xuanhua Shi Chao Liu Song Wu Hai Jin Xiaoxin Wu Li Deng Services Computing Technology and System Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Huawei Technologies Company Limited China

In data centers and cloud computing environments, the number of virtual machines (VMs) increases when the number of service requests increases. Since services are invoked on demand, the corresponding virtual machines will be created and shut down frequently. This makes the time of starting a virtual machine a crucial performance bottleneck for services in data centers. Besides, if virtual machines read image files from disks to start themselves, additional overhead to access disk will be generated. In this paper, we present a cloud service cache system based on memory template of virtual machines - VCache to improve the response time of cloud computing services, and to reduce the disk access overhead. This system can create and maintain service cache VMs through memory templates, which are snapshots of running virtual machines. By creating virtual machines from cached image files, the service running in these VMs can be deployed rapidly, which greatly reduces the launching time of the service and disk I/O load. We evaluate our system with experiments, and the experimental results show that the average time for creating a VM is reduced about 80% and the amount of data through disk access decreases more than 50%.

关键词： Virtual machining Random access memory IP networks Memory management Image restoration Cloud computing Cloning

来源：评论

学校读者我要写书评

暂无评论

Finedge: A Dynamic Cost-Efficient Edge Resource Management Platform for NFV Network

Finedge: A Dynamic Cost-Efficient Edge Resource Management P...

引用

International Workshop on Quality of Service

作者： Miao Li Qixia Zhang Fangming Liu National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (数字)9781728168876

ISBN: (纸本)9781728168883

With the evolution of network function virtualization (NFV) and edge computing, software-based network functions (NFs) can be deployed on closer-to-end-user edge servers to support a broad range of new services with high bandwidth and low latency. However, due to the resource limitation, strict QoS requirements and real-time flow fluctuations in edge network, existing cloud-based resource management strategy in NFV platforms is inefficient to be applied to the edge. Thus, we propose Finedge, a dynamic, fine-grained and cost-efficient edge resource management platform for NFV network. First, we conduct empirical experiments to find out the effect of NFs' resource allocation and their flow-level characteristics on performance. Then, by jointly considering these factors and QoS requirements (e.g., latency and packet loss rate), Finedge can automatically assign the most suitable CPU core and tune the most cost-efficient CPU quota to each NF. Finedge is also implemented with some key strategies including real-time flow monitoring, elastic resource scaling up and down, and also flexible NF migration among cores. Through extensive evaluations, we validate that Finedge can efficiently handle heterogeneous flows with the lowest CPU quota and the highest SLA satisfaction rate as compared with the default OS scheduler and other state-of-the-art resource management schemes.

关键词： Resource management Noise measurement Packet loss Servers Throughput Quality of service

来源：评论

学校读者我要写书评

暂无评论

Heat to Power: Thermal Energy Harvesting and Recycling for Warm Water-Cooled Datacenters

Heat to Power: Thermal Energy Harvesting and Recycling for W...

引用

Annual International Symposium on Computer Architecture, ISCA

作者： Xinhui Zhu Weixiang Jiang Fangming Liu Qixia Zhang Li Pan Qiong Chen Ziyang Jia National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (数字)9781728146614

ISBN: (纸本)9781728146621

Warm water cooling has been regarded as a promising method to improve the energy efficiency of water-cooled datacenters. In warm water-cooling systems, hot spots occur as a common problem where the hybrid cooling architecture integrating thermoelectric coolers (TECs) emerges as a new remedy. Equipped with this architecture, the inlet water temperature can be raised higher, which provides more opportunities for heat recycling. However, currently, the heat absorbed from the server components is ejected directly into the water without being recycled, which leads to energy wasting. In order to further improve the energy efficiency, we propose Heat to Power (H2P), an economical and energy-recycling warm water cooling architecture, where thermoelectric generators (TEGs) harvest thermal energy from the “used” warm water and generate electricity for reusing in datacenters. Specifically, we propose some efficient optimization methods, including an economical water circulation design, fine-grained adjustments of the cooling setting and dynamic workload scheduling for increasing the power generated by TEGs. We evaluate H2P based on a real hardware prototype and cluster traces from Google and Alibaba. Experiment results show that TEGs equipped with our optimization methods can averagely generate 4.349 W, 4.203 W, and 3.979 W (4.177 W averagely) electricity on one CPU under the drastic, irregular and common workload traces, respectively. The power reusing efficiency (PRE) can reach 12.8%~16.2% (14.23% averagely) and the total cost of ownership (TCO) of datacenters can be reduced by up to 0.57%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共25页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：