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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是241-250 订阅

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

详细简洁

排序：

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

引用

10th IEEE International Conference on Computer and Information technology, CIT-2010, 7th IEEE International Conference on Embedded Software and systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Yu, Linchen Liao, Xiaofei Jin, Hai Qin, Pengcheng Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China School of Computer China University of Geosciences Wuhan 430074 China

ISBN: (纸本)9780769541082

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. © 2010 IEEE.

关键词： Voice/data communication systems

来源：评论

学校读者我要写书评

暂无评论

LEEN: Locality/fairness-aware key partitioning for MapReduce in the cloud

LEEN: Locality/fairness-aware key partitioning for MapReduce...

引用

2nd IEEE International Conference on Cloud computing technology and Science, CloudCom 2010

作者： Ibrahim, Shadi Jin, Hai Lu, Lu Wu, Song He, Bingsheng Qi, Li Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan 430074 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Information and Technology Department China Development Bank Beijing 100037 China

ISBN: (纸本)9780769543024

This paper investigates the problem of Partitioning Skew1 in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence of partitioning skew causes a huge amount of data transfer during the shuffle phase and leads to significant unfairness on the reduce input among different data nodes. As a result, the applications experience performance degradation due to the long data transfer during the shuffle phase along with the computation skew, particularly in reduce phase. We develop a novel algorithm named LEEN for locality-aware and fairness-aware key partitioning in MapReduce. LEEN embraces an asynchronous map and reduce scheme. All buffered intermediate keys are partitioned according to their frequencies and the fairness of the expected data distribution after the shuffle phase. We have integrated LEEN into Hadoop-0.18.0. Our experiments demonstrate that LEEN can efficiently achieve higher locality and reduce the amount of shuffled data. More importantly, LEEN guarantees fair distribution of the reduce inputs. As a result, LEEN achieves a performance improvement of up to 40% on different workloads. © 2010 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Network and Parallel computing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Hai Jin Daniel Reed Wenbin Jiang

ISBN: (数字)9783540322467

ISBN: (纸本)9783540298106

These proceedings contain the papers presented at the 2005 IFIP International Conference on Network and Parallel computing (NPC 2005), held in Beijing, China, between November 30 and December 3, 2005. The goal of the conference was to establish an international forum for engineers and scientists to present their ideas and experiences in network and parallel computing. A total of 320 submissions were received in response to our Call for Papers. These papers were from the following countries or regions: Australia, Canada, China, France, Germany, Hong Kong, India, Iran, Italy, Japan, Korea, Lux- burg, Nepal, Netherlands, Taiwan, United Arab Emirates, and United States. Each submission was sent to at least three *** paper was judged - cording to its originality, innovation, readability, and relevance to the expected ***,atotalof68paperswereretainedfor- clusionin *** the 68 papers,48 wereacceptedasfull papers for presentation at the conference. We also accepted 20 papers as short papers for a possible brief presentation at the conference, followed by discussion during a poster session. Thus, only 21% of the total submissions could be included in the ?nal program.

关键词： Theory of Computation Computer Communication Networks Software Engineering Operating systems Algorithm Analysis and Problem Complexity Information systems Applications (incl. Internet)

来源：评论

学校读者我要写书评

暂无评论

An efficient and robust one-time message authentication code scheme using feature extraction of iris in cloud computing

An efficient and robust one-time message authentication code...

引用

作者： Abduljabbar, Zaidameen Jin, Hai Zou, Deqing Yassin, Ali A. Hussien, Zaidalaa Hussain, Mohammed Abdulridha Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China University of Basrah Basrah Iraq Southern Technical University Basrah Iraq

ISBN: (纸本)9781479947652

Cloud computing suffers from a number of problems in terms of security issues. Authentication and integrity play an important role in the security field and numerous concerns have been raised to recognizeor protect any tampering with exchanges of text between two entities (sender and receiver) within the cloud environment. Many schemes in this area can be vulnerable to well known methods of attack such as replay attack, forgery attack, dictionary, insider, and modification attacks. A robust scheme is therefore required to detect or prevent any modification or manipulation of a message during transmission. In this paper, we propose a new message authentication code (MAC) based on feature extraction of the user's iris in order to assure the integrity of the user's message. Features are extracted from the user's iris to generate a message code for each user's login and to prohibit malicious attacks such as replay, forgery and insider attacks. Our proposed scheme enjoysseveral important security attributes such as a user's one time bio-key, robust message anonymity, data integrity for a user's message, phase key agreement, bio-key management,and one time message code for each user's session. Finally, our security analysis and experimental results demonstrate and prove the invulnerability and efficiency of our proposed scheme. © 2014 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

iDARE: Proactive data replication mechanism for P2P VoD system

iDARE: Proactive data replication mechanism for P2P VoD syst...

引用

作者： Liao, Xiaofei Zhang, Fan Jin, Hai Yu, Linchen Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China School of Computer China University of Geosciences Wuhan 430074 China

ISBN: (纸本)9780769541082

Peer-to-peer (P2P) on-demand streaming systems inevitably suffer from peers churn that is the inherent dynamic characteristic of overlay network. With frequent peer departure, a large amount of media data cached on peer disk turns offline and unavailable, which becomes the major reason of heavy server load. To address the above issue, a new proactive data replication mechanism is proposed and implemented in existing P2P on-demand system GirdCast. Based on the new mechanism, peer can proactively replicate data chunks to stable cache servers for future sharing, when it has high possibility to leave the overlay. Two key heuristic algorithms are designed for departure prediction and replicated chunks selection. system trace driven simulation shows that the mechanism greatly decreases bandwidth load of media source server and improves the availability of chunks highly demanded but poorly provisioned by overlay peers. © 2010 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Page classifier and placer: A scheme of managing hybrid caches

Page classifier and placer: A scheme of managing hybrid cach...

引用

11th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2014

作者： Yu, Xin Shi, Xuanhua Jin, Hai Liao, Xiaofei Wu, Song Li, Xiaoming Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Department of ECE University of Delaware Newark DE United States

ISBN: (纸本)9783662449165

Hybrid cache architecture (HCA), which uses two or more cache hierarchy designs in a processor, may outperform traditional cache architectures because no single memory technology can deliver the optimal power, performance and density at the same time. The general HCA scheme has also been proposed to manage cache regions that have different usage patterns. However previous HCA management schemes control data placement at cache set level and are oblivious to software's different power and performance characteristics in different hardware cache regions. This hardware-only approach may lead to performance loss and may fail to guarantee quality of service. We propose a new HCA approach that enables OS to be aware of underlying hybrid cache architecture and to control data placement, at OS page level, onto difference cache regions. Our approach employs a light-weighted hardware profiler to monitor cache behaviors at OS page level and to capture the hot pages. With this knowledge, OS will be able to dynamically select different cache placement policies to optimize placement of data to achieve higher performance, lower power consumption and better quality of service. Our simulation experiments demonstrate that the proposed hybrid HCA achieves 7.8% performance improvement on a dual-core system compared to a traditional SRAM-only cache architecture and at the same time reduces area cost. © 2014 IFIP International Federation for Information Processing.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Robust One-TimeMessage Authentication CodeScheme using Feature Extraction of Iris in Cloud computing

An Efficient and Robust One-TimeMessage Authentication CodeS...

引用

2014 International Conference on Cloud computing and Internet of Things (CCIOT)(2014年第一届云计算和物联网国际会议)

作者： Mohammed Abdulridha Hussain ZaidAmeen Abduljabbar Deqing Zou Hai Jin Ali A.Yassin ZaidAlaa Hussien Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scien 1Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scie University of Basrah BasrahIraq Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scien

Cloud computing suffers from a number of problems in terms of security *** and integrity play an important role in the security field and numerous concerns have been raised to recognizeor protect any tampering with exchanges of text between two entities(sender and receiver)within the cloud *** schemes in this area can be vulnerable to well known methods of attack such as replay attack,forgery attack,dictionary,insider,and modification attacks.A robust scheme is therefore required to detect or prevent any modification or manipulation of a message during *** this paper,we propose a new message authentication code(MAC)based on feature extraction of the user's iris in order to assure the integrity of the user's *** are extracted from the user's iris to generate a message code for each user's login and to prohibit malicious attacks such as replay,forgery and insider *** proposed scheme enjoysseveral important security attributes such as a user's one time bio-key,robust message anonymity,data integrity for a user's message,phase key agreement,bio-key management,and one time message code for each user's ***,our security analysis and experimental results demonstrate and prove the invulnerability and efficiency of our proposed scheme.

关键词： Cloud computing Iris Features Extraction One Time Bio-key One Tim Message Authentication Code MAC.

来源：评论

学校读者我要写书评

暂无评论

FedMoS: Taming Client Drift in Federated Learning with Double Momentum and Adaptive Selection 42

FedMoS: Taming Client Drift in Federated Learning with Doubl...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Wang, Xiong Chen, Yuxin Li, Yuqing Liao, Xiaofei Jin, Hai Li, Bo Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Wuhan China Wuhan University School of Cyber Science and Engineering Wuhan China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350334142

Federated learning (FL) enables massive clients to collaboratively train a global model by aggregating their local updates without disclosing raw data. Communication has become one of the main bottlenecks that prolongs the training process, especially under large model variances due to skewed data distributions. Existing efforts mainly focus on either single momentum-based gradient descent, or random client selection for potential variance reduction, yet both often lead to poor model accuracy and system efficiency. In this paper, we propose FedMoS, a communication-efficient FL framework with coupled double momentum-based update and adaptive client selection, to jointly mitigate the intrinsic variance. Specifically, FedMoS maintains customized momentum buffers on both server and client sides, which track global and local update directions to alleviate the model discrepancy. Taking momentum results as input, we design an adaptive selection scheme to provide a proper client representation during FL aggregation. By optimally calibrating clients' selection probabilities, we can effectively reduce the sampling variance, while ensuring unbiased aggregation. Through a rigid analysis, we show that FedMoS can attain the theoretically optimal O(T - 2/3) convergence rate. Extensive experiments using real-world datasets further validate the superiority of FedMoS, with 58%-87% communication reduction for achieving the same target performance compared to state-of-the-art techniques. © 2023 IEEE.

关键词： Momentum

来源：评论

学校读者我要写书评

暂无评论

LOPO: An Out-of-order Layer Pulling Orchestration Strategy for Fast Microservice Startup 42

LOPO: An Out-of-order Layer Pulling Orchestration Strategy f...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Gu, Lin Huang, Junhao Huang, Shaoxing Zeng, Deze Li, Bo Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China China University of Geosciences School of Computer Science Wuhan China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350334142

Container based microservices have been widely applied to promote the cloud elasticity. The mainstream Docker containers are structured in layers, which are organized in stack with bottom-up dependency. To start a microservice, the required layers are pulled from a remote registry and stored on its host server, following the layer dependency order. This incurs long microservice startup time and hinders the performance efficiency. In this paper, we discover that, for the first time, the layer pulling order can be adjusted to accelerate the microservice startup. Specifically, we address the problem on microservice layer pulling orchestration for startup time minimization and prove it as NP-hard. We propose a Longest-chain based Out-of-order layer Pulling Orchestration (LOPO) strategy with low computational complexity and guaranteed approximation ratio. Through extensive real-world trace driven experiments, we verify the efficiency of our LOPO and demonstrate that it reduces the microservice startup time by 22.71% on average in comparison with state-of-the-art solutions. © 2023 IEEE.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

TBF: A high-efficient query mechanism in de-duplication backup system

TBF: A high-efficient query mechanism in de-duplication back...

引用

7th International Conference on Advances in Grid and Pervasive computing, GPC 2012

作者： Zhou, Bin Jin, Hai Xie, Xia Yuan, PingPeng Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology South-Central University for Nationalities Wuhan China

ISBN: (纸本)9783642307669

For the big data, the fingerprints of the data chunks are very huge and cannot be stored in the memory completely. Accordingly, a new query mechanism namely Two-stage Bloom Filter mechanism is proposed. First, each bit of the second grade bloom filter represents the chunks having the identical fingerprints which reducing the rate of false positives. Second, a two-dimensional list is created corresponding to the two grade bloom filter to gather the absolute addresses of the data chunks with the identical fingerprints. Finally, we suggest a new hash function class with the strong global random characteristic. Two-stage Bloom Filter decreases the number of accessing disks, improves the speed of detecting the redundant data chunks, and reduces the rate of false positive. Our experiments indicate that Two-stage Bloom Filter reduces about 30~40% storage accessing of false positive with the same length of the first grade Bloom Filter. © 2012 Springer-Verlag.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：