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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

236 篇 会议
181 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

249 篇 工学
- 162 篇 计算机科学与技术...
- 131 篇 软件工程
- 49 篇 信息与通信工程
- 37 篇 电气工程
- 30 篇 控制科学与工程
- 28 篇 生物工程
- 25 篇 电子科学与技术（可...
- 22 篇 光学工程
- 17 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 仪器科学与技术
- 15 篇 核科学与技术
- 9 篇 动力工程及工程热...
- 8 篇 化学工程与技术
- 7 篇 网络空间安全
- 6 篇 航空宇航科学与技...
- 6 篇 安全科学与工程
161 篇 理学
- 72 篇 物理学
- 55 篇 数学
- 33 篇 生物学
- 11 篇 化学
- 11 篇 系统科学
- 11 篇 统计学（可授理学、...
- 5 篇 天文学
49 篇 管理学
- 28 篇 图书情报与档案管...
- 23 篇 管理科学与工程(可...
- 14 篇 工商管理
20 篇 医学
- 19 篇 基础医学(可授医学...
- 17 篇 临床医学
- 9 篇 药学(可授医学、理...
8 篇 农学
4 篇 法学
4 篇 教育学
1 篇 军事学
1 篇 艺术学

主题

14 篇 information syst...
13 篇 virtual machinin...
11 篇 computer archite...
11 篇 gravitational wa...
10 篇 ip networks
9 篇 grid computing
9 篇 computational mo...
9 篇 computer network...
8 篇 reinforcement le...
8 篇 peer to peer com...
8 篇 laboratories
8 篇 internet
8 篇 semantics
7 篇 application soft...
7 篇 resource managem...
7 篇 servers
7 篇 machine learning
7 篇 middleware
7 篇 gravitational wa...
6 篇 support vector m...

机构

20 篇 institute for pl...
19 篇 university of so...
17 篇 department of as...
17 篇 scuola di ingegn...
17 篇 infn sezione di ...
17 篇 dipartimento di ...
17 篇 università degli...
17 篇 infn trento inst...
16 篇 advanced technol...
16 篇 king’s college l...
16 篇 kamioka branch n...
16 篇 the university o...
16 篇 ligo laboratory ...
16 篇 university of ma...
16 篇 stony brook univ...
16 篇 università di tr...
16 篇 university of mi...
16 篇 nasa goddard spa...
16 篇 university of rh...
16 篇 department of ph...

作者

18 篇 r. takahashi
18 篇 k. komori
18 篇 t. kajita
18 篇 t. sawada
18 篇 c. kim
17 篇 j. c. bayley
17 篇 f. hellman
17 篇 m. kinley-hanlon
17 篇 t. mcrae
17 篇 a. parisi
17 篇 s. rowan
17 篇 s. m. aronson
17 篇 v. p. mitrofanov
17 篇 g. moreno
17 篇 g. hemming
17 篇 f. muciaccia
17 篇 b. garaventa
17 篇 d. p. kapasi
17 篇 e. payne
17 篇 j. sadiq

语言

398 篇 英文
13 篇 其他
4 篇 中文
2 篇 法文

检索条件"机构=Advanced Computing and Information Systems Laboratory"

共 417 条记录，以下是91-100 订阅

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

详细简洁

排序：

A WAN-optimized live storage migration mechanism toward virtual machine evacuation upon severe disasters

A WAN-optimized live storage migration mechanism toward virt...

引用

作者： Hirofuchi, Takahiro Tsugawa, Maurido Nakada, Hidemoto Kudoh, Tomohiro Itoh, Satoshi Information Technology Research Insti-tute National Institute of Science Technology Tsukuba-shi Japan Advanced Computing Information Systems Laboratory University of Florida Gainesville FL 32611 United States

Wide-area VM migration is a technology with potential to aid IT services recovery since it can be used to evacuate virtualized servers to safe locations upon a critical disaster. However, the amount of data in-volved in a wide-area VM migration is substantially larger compared to VM migrations within LAN due to the need to transfer virtualized storage in addition to memory and CPU states. This increase of data makes it chal-lenging to relocate VMs under a limited time window with electrical power. In this paper, we propose a mechanism to improve live storage migration across WAN. The key idea is to reduce the amount of data to be trans-ferred by proactively caching virtual disk blocks to a backup site during regular VM operation. As a result of pre-cached disk blocks, the proposed mechanism can dramatically reduce the amount of data and consequently the time required to live migrate the entire VM state. The mechanism was evaluated using a prototype implementation under different workloads and network conditions, and we confirmed that it dramatically reduces the time to complete a VM live migration. By using the proposed mechanism, it is possible to relocate a VM from Japan to the United States in just under 40 seconds. This relocation would otherwise take over 1500 seconds, demon-strating that the proposed mechanism was able to reduce the migration time by 97.5%. © 2013 The Institute of Electronics, information and Communication Engineers.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Characterizing User-Level Network Virtualization: Performance, Overheads and Limits

Characterizing User-Level Network Virtualization: Performanc...

引用

IEEE International Conference on e-Science and Grid computing

作者： Maurício Tsugawa José A. B. Fortes Advanced Computing and Information Systems Laboratory Advanced Computing and Information Systems Laboratory Department of Electrical and Computer Engineering University of Florida Gainesville FL USA

Connectivity limitations of the current Internet pose challenges to e-Science infrastructure, as communication between resources is of key importance for the sharing of hardware, software and data across geographically distributed institutions. To overcome such limitations many overlay networks have been developed. Existing solutions report performance that can keep up with slow wide-area links - however the question remains as to how overlay networks perform on new high-speed Internet connections. This paper characterizes the performance of user-level packet processing, which is at the core of most overlay networks implementations. To this end, building blocks of packet processing software are identified and characterized, and performance of IP forwarders developed in C and Java are compared through extensive measurements. Factors that affect the performance of overlay networks and limitations of existing solutions are characterized, providing insights on possible improvements. Experimental results show the following: to achieve maximum throughput, only a few microseconds (2 to 5) can be spent in virtual network processing; processing of small packets can limit TCP throughput; and overlays need to be carefully architected as encapsulation overheads can be substantial.

关键词： IP networks Software performance Java Hardware Throughput Peer to peer computing Routing Resource virtualization Computer networks Distributed computing

来源：评论

学校读者我要写书评

暂无评论

A survey on hand gesture recognition for mobile devices

A survey on hand gesture recognition for mobile devices

引用

作者： Lahiani, Houssem Neji, Mahmoud National School of Electronics and Telecommunications University of Sfax Tunisia Tunisia Multimedia Information Systems and Advanced Computing Laboratory Faculty of Economics and Management University of Sfax Sfax Tunisia

As smartphones and mobile devices become ubiquitous in the daily life of human beings, facilitating interaction with them will have a positive impact on their use. This paper presents an emerging and important area for research on human-machine interaction, involving interaction with mobile devices. Hand gesture recognition is already a quite mature field and its integration on advanced technologies like smartphones makes a survey an interesting and needed contribution. The design of interactive mobile applications should differ from traditional desktop applications. For this purpose, the paper discusses some concepts that help to understand new challenges and introduces techniques that may be useful to properly exploit these devices. This paper gives also an overview of recent works done on vision-based and contact-based hand gesture recognition systems for mobile devices. Used techniques and approaches are also discussed. At the end, we conclude with some reflections. Copyright © 2020 Inderscience Enterprises Ltd.

关键词： Palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

Biometric individual identification system based on the ECG signal 19th

Biometric individual identification system based on the ECG ...

引用

19th International Conference on Intelligent systems Design and Applications, ISDA 2019

作者： Hamza, Sihem Ben Ayed, Yassine Higher Institute of Computer Science and Multimedia ISIMS University of Sfax Sfax Tunisia Multimedia InfoRmation Systems and Advanced Computing Laboratory MIRACL University of Sfax Sfax Tunisia

ISBN: (纸本)9783030493417

Human biometric identification based on the ElectroCardioGram (ECG) is relatively new. This domain is intended to recognize individuals since the ECG has unique characteristics for each individual. These features are robust against forgery. In this study, feature extraction from ECG signals was performed using a combination of three new types of characteristics: MFCC, ZCR, and entropy. We proposed to apply classification methods: K Nearest Neighbors (KNN) and support vector machines (SVM) for human biometric identification. For evaluation we used two bases, namely MIT-BIH arrhythmia and normal sinus rhythm obtained from the Physionet database. For the MIT-BIH database, we used 47 individuals, each recording contains ECG data recorded for 15 s and in the SNR database, we used 18 individuals, the duration of each recording is 10 s. The analysis of the results obtained shows that the combination of all the features proposed makes it possible to improve the efficiency of our identification system to reach a performance rate equal to 100% for the two bases. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

Addressing the P2P Bootstrap Problem for Small Overlay Networks

Addressing the P2P Bootstrap Problem for Small Overlay Netwo...

引用

International Conference on Peer-to-Peer computing

作者： D. I. Wolinsky P. St. Juste P. O. Boykin R. Figueiredo Advanced Computing Information Systems Laboratory University of Florida USA

Peer-to-Peer (P2P) overlays provide a framework for building distributed applications consisting of few to many resources with features including self-configuration, scalability, and resilience to node failures. Such systems have been successfully adopted in large-scale Internet services for content delivery networks, file sharing, and data storage. In small-scale systems, they can be useful to address privacy concerns as well as support for network applications that lack dedicated servers. The bootstrap problem, finding an existing peer in the overlay, remains a challenge to enabling these services for small-scale P2P systems. In large networks, the solution to the bootstrap problem has been the use of dedicated services, though creating and maintaining these systems requires expertise and resources, which constrain their usefulness and make them unappealing for small-scale systems. This paper surveys and summarizes requirements that allow peers potentially constrained by network connectivity to bootstrap small-scale overlays through the use of existing public overlays. In order to support bootstrapping, a public overlay must support the following requirements: a method for reflection in order to obtain publicly reachable addresses, so peers behind network address translators and firewalls can receive incoming connection requests; communication relaying to share public addresses and communicate when direct communication is not feasible; and rendezvous for discovering remote peers, when the overlay lacks stable membership. After presenting a survey of various public overlays, we identify two overlays that match the requirements: XMPP overlays, such as Google Talk and Live Journal Talk, and Brunet, a structured overlay based upon Symphony. We present qualitative experiences with prototypes that demonstrate the ability to bootstrap small-scale private structured overlays from public Brunet or XMPP infrastructures.

关键词： Peer to peer computing IP networks Servers Virtual private networks Internet Book reviews IEEE Communications Society

来源：评论

学校读者我要写书评

暂无评论

Deetoo: Scalable unstructured search built on a structured overlay

Deetoo: Scalable unstructured search built on a structured o...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Tae Woong Choi P. Oscar Boykin Advanced Computing Information Systems Laboratory University of Florida USA

ISBN: (纸本)9781424465330

We present Deetoo, an algorithm to perform completely general queries, for instance high-dimensional proximity queries or regular expression matching, on a P2P network. Deetoo is an efficient unstructured query system on top of existing structured P2P ring topologies. Deetoo provides a reusable search tool to work alongside a DHT, thus, it provides new capabilities while reusing existing P2P models and software. Since our algorithm is for unstructured search, there is no structural relationship between the queries and the network topology and hence no need to provide a mapping of queries onto a fixed DHT structure. Deetoo is optimal in terms of the trade-off in querying and caching cost. For networks of size N, O(¿N) cost for both caching and querying is required to achieve a constant (in N) search success probability. Queries execute a time of O(log 2 N).

关键词： Peer to peer computing Data structures Network topology Broadcasting Cost function Computer networks High performance computing information systems Software reusability Software tools

来源：评论

学校读者我要写书评

暂无评论

AViTExt: Automatic Video Text Extraction: A new Approach for video content indexing Application

AViTExt: Automatic Video Text Extraction: A new Approach for...

引用

3rd International Conference on information and Communication Technologies, vol.2

作者： Baseem Bouaziz Tarek Zlitni Walid Mahdi Multimedia Information systems and Advanced Computing Laboratory Sfax Tunisia

In this paper, we propose a spatial temporal video-text detection technique which proceed in two principal steps: potential text region detection and a filtering process. In the first step we divide dynamically each pair of consecutive video frames into sub block in order to detect change. A significant difference between homologous blocks implies the appearance of an important object which may be a text region. The temporal redundancy is then used to filter these regions and forms an effective text region. The experimentation driven on a variety of video sequences shows the effectiveness of our approach by obtaining a 89,39% as precision rate and 90,19 as recall.

关键词： Component Video indexing and browsing Spatiotemporal approach Text extractin Non compressed video Multiple-frame

来源：评论

学校读者我要写书评

暂无评论

Simplifying resource sharing in voluntary grid computing with the grid appliance

Simplifying resource sharing in voluntary grid computing wit...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： David Isaac Wolinsky Renato J. Figueiredo Advanced Computing and Information Systems Laboratory University of Florida USA

Research projects in many fields are increasingly reliant on the use of computer-based simulation and computing grids. Many projects have successfully leveraged voluntary computing infrastructures by developing and distributing "@home" applications using the BOINC framework. Through generous contributions from the general public, these systems now have a computing backbone on which to have their data processed or simulations run. A shortcoming of such systems is that most users are often limited to contributing resources and few users are capable of developing or porting their own applications in order to use these resources. While many users are satisfied with receiving points (an intangible good) in return for their contribution, the need to port applications presents a barrier to entry to many other users who can potentially benefit from using the voluntary resources. In this paper, we describe enhancements made to the "grid appliance", a virtual machine based system which enables an execution environment in which users are given the opportunity to voluntarily share (providing and using) resources and run unmodified x86/Linux applications. Voluntary grids introduce a host of issues to tackle, most importantly getting users involved quickly. With that in mind, the grid appliance provides many tools for making a user-friendly environment for users, developers, and administrators. This paper summarizes the challenges of getting users involved, reducing the overhead for administrators, and describes the solutions used in the grid appliance.

关键词： Resource management Grid computing Home appliances Computational modeling Computer simulation Distributed computing Application software Spine Virtual machining Linux

来源：评论

学校读者我要写书评

暂无评论

Grey-Box Approach for Performance Prediction in Map-Reduce Based Platforms

Grey-Box Approach for Performance Prediction in Map-Reduce B...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Selvi Kadirvel Jose A. B. Fortes Advanced Computing and Information Systems Laboratory University of Florida USA

Map-Reduce has become an important paradigm for data-intensive computations. The ability to estimate Map-reduce application performance is critical for efficient resource scheduling and provisioning both on dedicated clusters and on the cloud. Current state-of-the-art techniques for performance prediction of Map- Reduce applications use analytical and simulation-based models. In this paper, we make the case for performance prediction using regression techniques based on machine-learning. Through modeling the Map-Reduce environment as a grey-box, we can leverage a combination of externally observed system features and information about sub-system internals. We identify four learning techniques with high prediction accuracy through a detailed comparative study of twenty methods. The powerful capabilities of data analytics platforms are usually accompanied by frequent faults that occur due to scale, complexity and the use of commercial off- the-shelf components. We show that our proposed approach can effectively predict degraded performance under these faulty conditions by the inclusion of additional fault-related input features. A mean prediction error of

关键词： Middleware Computational modeling Predictive models Virtual machining Fault tolerance Fault tolerant systems Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Towards self-caring mapreduce: Proactively reducing fault-induced execution-time penalties

Towards self-caring mapreduce: Proactively reducing fault-in...

引用

International Conference on High Performance computing & Simulation (HPCS)

作者： Selvi Kadirvel José A. B. Fortes Advanced Computing and Information Systems Laboratory University of Florida USA

Self-Caring IT systems are those that can proactively avoid system failures rather than reactively handle failures after they have occurred. In this paper, we are interested in failures in which a MapReduce job is unable to execute within an SLA-based completion time. The existing fault tolerance capability provided by Map Reduce frameworks is simple and the penalty associated with handling failures could potentially lead to excessive job execution times. Our goal in this paper is to bring out the severity of this penalty for different job characteristics and configurable framework parameters. We first quantitatively evaluate the penalty in execution time associated with node failures in the open-source MapReduce framework, Hadoop using the MRPerf simulator. This increase in execution time is particularly expensive in pay-as-you-go cloud infrastructures where users are charged by resource usage duration. Our solution minimizes job-completion-time SLA violations by augmenting the existing fault-tolerance capability of the MapReduce framework using a dynamic resource scaling approach. This resource scaling approach leverages the elastic properties of a cloud, in order to mitigate execution time penalties and hence proactively avoids a potential job failure. Using our proposed approach for various job and framework parameters, we show that performance penalties can be decreased by up to 78% in the case of singlenode failures and by up to 100% in the case of 4-node failures at minimal additional cost.

关键词： Fault tolerance Fault tolerant systems Dynamic scheduling Organizations Runtime Google Distributed databases

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共42页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：