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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

294 篇 会议
8 册 图书
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

192 篇 工学
- 176 篇 计算机科学与技术...
- 87 篇 软件工程
- 27 篇 电气工程
- 16 篇 电子科学与技术（可...
- 15 篇 信息与通信工程
- 9 篇 控制科学与工程
- 8 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 3 篇 机械工程
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
40 篇 理学
- 23 篇 数学
- 10 篇 系统科学
- 8 篇 生物学
- 5 篇 物理学
- 4 篇 统计学（可授理学、...
- 2 篇 大气科学
- 1 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
29 篇 管理学
- 22 篇 管理科学与工程(可...
- 16 篇 工商管理
- 10 篇 图书情报与档案管...
2 篇 农学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
- 2 篇 公共卫生与预防医...

主题

22 篇 parallel process...
17 篇 cloud computing
16 篇 distributed comp...
15 篇 computational mo...
13 篇 routing
12 篇 computer archite...
11 篇 scalability
11 篇 servers
10 篇 graphics process...
10 篇 peer-to-peer com...
9 篇 concurrent compu...
9 篇 resource managem...
9 篇 protocols
9 篇 hardware
9 篇 distributed comp...
8 篇 runtime
8 篇 monitoring
8 篇 real-time system...
8 篇 performance eval...
7 篇 computer science

机构

5 篇 institute of com...
3 篇 university of ch...
2 篇 school of scienc...
2 篇 vienna universit...
2 篇 shanghai key lab...
2 篇 guangdong provin...
2 篇 college of compu...
2 篇 department of co...
2 篇 tu münchen garch...
2 篇 school of comput...
2 篇 green univ bangl...
2 篇 univ chinese aca...
2 篇 school of cybers...
2 篇 school of comput...
2 篇 university of pi...
2 篇 isislab - dipart...
2 篇 department of co...
2 篇 institute of par...
2 篇 tennessee tech u...
2 篇 rwth aachen univ...

作者

3 篇 hai jin
3 篇 gonzalez teofilo...
2 篇 dan meng
2 篇 li cui
2 篇 roy palash
2 篇 chaudhary vipin
2 篇 haibin cai
2 篇 hassan mohammad ...
2 篇 michael alexande...
2 篇 liu yang
2 篇 roberto g. casce...
2 篇 shigeng zhang
2 篇 qiang li
2 篇 alexandru costan
2 篇 ammar reda a.
2 篇 luís lopes
2 篇 emmanuel jeannot
2 篇 vittorio scarano
2 篇 xiaofei liao
2 篇 stephen l. scott

语言

304 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=20th International Conference on Parallel and Distributed Computing Systems, PDCS 2007"

共 306 条记录，以下是71-80 订阅

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

详细简洁

排序：

Efficient algorithms and routing protocols for handling transient single node failures

Efficient algorithms and routing protocols for handling tran...

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Bhosle, Amit M. Gonzalez, Teofilo F. Department of Computer Science University of California Santa Barbara CA 93106 United States *** 1200 12th Ave. S. Seattle WA - 98144 United States

ISBN: (纸本)9780889867741

Single node failures represent more than 85% of all node failures[7] in the today's large communication networks such as the Internet. Also, these node failures are usually transient. Consequently, having the routing paths globally recomputed does not pay off since the failed nodes recover fairly quickly, and the recomputed routing paths need to be discarded. Instead, we develop algorithms and protocols for dealing with such transient single node failures by suppressing the failure (instead of advertising it across the network), and routing messages to the destination via alternate paths that do not use the failed node. We compare our solution to that of [11], which also discusses such a proactive recovery scheme for handling transient node failures. We show that our algorithms are faster by an order of magnitude while our paths are equally good. We show via simulation results that our paths are usually within 15% of the optimal for randomly generated graph with 100-1000 nodes.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

On the timeliness of a cluster based large scale online video surveillance

On the timeliness of a cluster based large scale online vide...

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Sinha, Koushik Chowdhury, Atish Datta Ghosh, Subhas K. Banerjee, Satyajit Honeywell Technology Solutions 151/1 Bannerghatta Road Bangalore 560076 India

ISBN: (纸本)9780889867741

Timeliness is an important issue for video based surveillance and is often quantified by the delay between the time of availability of image frames from cameras and completion of their processing. Most existing commercial video surveillance systems focus on the issues of efficient storage and retrieval, remote monitoring, data streaming, forensics and limited real-time analysis - but not explicitly on the timeliness issues of large scale online analysis vis-a-vis resource utilization. In this paper we present a new load distribution strategy for on-line, large scale video data processing clusters that are used as an aid to manual surveillance. We propose a novel approach for fine grained load balancing, modeled as a minimization of average completion time problem. the proposed approach is robust in the sense that it is not dependent on the estimates of future loads or on the worst case execution requirements of the video processing load. Simulation results with real-life video surveillance data establish that for a desired timeliness in processing the data, our approach reduces the number of compute nodes by more than a factor of two, compared to systems without the load migration heuristics.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

Entrust: usEr ceNtric plaTform foR continoUS healthcare 20

Entrust: usEr ceNtric plaTform foR continoUS healThcare

引用

20th Annual international conference on distributed computing in Smart Sensor systems and the Internet of things (DCOSS-IoT)

作者： D'Aniello, Giuseppe Greco, Luca Pupo, Francesco Savaglio, Claudio Univ Salerno DIEM Fisciano SA Italy Univ Calabria DIMES Arcavacata Di Rende CS Italy

ISBN: (纸本)9798350369458;9798350369441

the continuous growth in the worldwide demand for medical services pushes the traditional model of hospital care towards a more sustainable one which makes continuous monitoring of health status as well as remote treatment of diseases (where possible) feasible. In this context, the synergic exploitation of well-established paradigms such as Internet of things (IoT), Wearable computing and Edge Intelligence (EI) within a single platform can represent a game-changer with respect to the current smart healthcare scenario. In this paper we introduce ENTRUST (usEr ceNtric plaTform foR continoUS healthcare), an innovative solution pivoted around a seamless edge-cloud architecture and a simulation-based approach for the development of next-generation, daily healthcare services. the system desiderata and challenges towards its implementation are hence discussed and a use case reported to exemplify the envisioned ENTRUST approach.

关键词： Internet of things Edge Intelligence Healthcare Wearable computing

来源：评论

学校读者我要写书评

暂无评论

Realization of Chaotic Sequence Encryption Algorithm in MapReduce distributed parallel Model 20

Realization of Chaotic Sequence Encryption Algorithm in MapR...

引用

20th IEEE international conference on High Performance computing and Communications (HPCC) / 16th IEEE international conference on Smart City (SmartCity) / 4th IEEE international conference on Data Science and systems (DSS)

作者： Su, Yixin Shen, Gang Sun, Xianbo Tang, Zhengshuang Wuhan Univ Technol Sch Automat Wuhan Hubei Peoples R China Hubei Univ Nationalities Enshi Peoples R China

ISBN: (纸本)9781538666142

With the popularity of the Internet and the rise of cloud computing, it is a tendency that users save their large amounts of data into the cloud. However, the security issue of large-scale data has hindered the development of Internet and cloud computing. It can pose potential security risks when the traditional cryptographic mechanism is applied directly to encrypt massive data. In this paper, we propose a Cipher-Feedback Encryption Algorithm of Double Chaotic Sequence (CFBA-DCS) for large-scale data set encryption based on ciphertext feedback and chaotic sequence theory. then, the algorithm is implemented by the MapReduce distributed data processing model of Hadoop platform, which realizes the parallelization test of algorithm. Security analysis and experimental results show that the proposed CFBA-DCS can counter exhaustive attack and statistical analysis attack. Whats more, the acceleration ratio of the algorithm will increase with the number of nodes in the cluster and the size of the plaintext. the acceleration ratio can reach 2.2 when the number of data nodes is 5.

关键词： chaos steam cipher feedback massive data

来源：评论

学校读者我要写书评

暂无评论

Simulation of level-2 cache locking in multicore parallel computing systems

Simulation of level-2 cache locking in multicore parallel co...

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Rani, Manira Asaduzzaman, Abu Koivisto, Darryl Department of Computer Science and Engineering Florida Atlantic University 777 Glades Road SE43-409 Boca Raton FL 33431 United States Architecture Modeling Group Mirabilis Design Inc. 3000 Scott Blvd Santa Clara CA 95054 United States

ISBN: (纸本)9780889867741

In order to fulfill the demands for increased performance / power ratio, most chip-vendors are deploying multicore processors to their product lines. Multicore processors are frequently deployed with multilevel cache memories. parallel thread execution in such a multicore system is difficult as it relates to cache sharing to achieve the best performance. Due to the increased execution time unpredictability, it becomes a challenge to support realtime applications on multicore systems with multilevel caches. Studies show that predictability can be improved using cache locking techniques. However, entire locking at level-1 cache may be inefficient for smaller data size (when compared with the cache size). Also, way locking at level-1 cache is not permitted on some processors (like PowerPC 750GX), but way locking at level-2 cache is possible. By locking at level-2 cache, Xenon processor achieves the effect of using local storage by Cell SPEs. In this work, we simulate a multicore parallel computing system with two levels of caches to explore the impact of level-2 cache locking on the performance, power consumption, and predictability. Experimental results show that performance and predictability can be increased and power consumption can be decreased by adding a level-2 cache locking mechanism to an efficient cache sharing structure.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for disjoint paths in star networks

A distributed algorithm for disjoint paths in star networks

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Hamad, Ahmad Karaata, Mehmet Hakan Department of Computer Engineering Kuwait University P.O. Box 5969 Safat 13060 Kuwait

ISBN: (纸本)9780889867741

A stabilizing system guarantees that, regardless of the current configuration, the system reaches a legal configuration in a bounded number of steps and the system configuration remains legal thereafter. Whereas, a stabilizing system that maintains no explicit variables in the processes of the system is referred to as an inherently stabilizing system, and hence all system states are legal by construction. Due to this attribute, inherently stabilizing systems are immune to transient faults and do not experience any delay due arbitrary system initialization. We view a fault that perturbs the system configuration but not the program as transient fault. Due to these features, inherently stabilizing distributed protocols for peer-to-peer, sensor and mobile networks are desirable. Hypercube, star networks and their variations that provide an increased degree of scalability have been initially design for parallel networks. However, their scalability and the presence of multiple disjoint paths in these topologies make them viable alternatives to existing peer-to-peer and sensor networks topologies. In this paper, we proposed an inherently stabilizing algorithm for delivering messages over all node-disjoint paths from a process to another in star networks. the proposed algorithm has numerous applications including VLSI layout, reliable networks routing, secure message transmission, and network survivability. the proposed routing algorithm is optimal with respect to its state space and lengths of the node-disjoint paths.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

DLBS: Decentralized Load Balancing Scheme for Event-driven Cloud Frameworks 20

DLBS: Decentralized Load Balancing Scheme for Event-driven C...

引用

20th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Li, Changlong Zhou, Xuehai Sun, Mingming Lu, Kun Zhou, Jinhong Zhuang, Hang Dai, Dong Univ Sci & Technol China Hefei Peoples R China Texas Tech Univ Lubbock TX 79409 USA

ISBN: (纸本)9781479976157

With the development of cloud computing, more and more applications are moving to a distributed fashion to solve problems. these applications usually contain complex iterative or incremental procedures and have a more urgent requirement on low-latency. thus many event-driven cloud frameworks are proposed. To optimize this kind of frameworks, an efficient strategy to minimize the execution time by redistributing work- loads is needed. Nowadays, load balance is a critical issue for the efficient operation of cloud platforms and many centralized schemes have already been proposed. However, few of them have been designed to support event-driven frameworks. Besides, as the cluster size and volume of tasks increases, centralized scheme will lead to a bottleneck of master node. In this paper, we demonstrate a decentralized load balancing scheme named DLBS for event-driven cloud frameworks and present two technologies to optimize it. In our design, schedulers are placed in every node for independently load-monitoring, autonomous decision-making and parallel task-scheduling. With the help of DLBS, master frees from the burden and tasks are executed with lower latency. We analyze the excellence of DLBS theoretically and proof it through simulation. At last, we implement and deploy it on a 64-machine cluster and demonstrate that it performs within 20% of an ideal scheme, which are consistent with simulation results.

关键词： Decentralized load balancing Event-driven framework Cloud computing

来源：评论

学校读者我要写书评

暂无评论

X10-Based distributed and parallel Betweenness Centrality and Its Application to Social Analytics

X10-Based Distributed and Parallel Betweenness Centrality an...

引用

20th international conference on High Performance computing (HiPC)

作者： Houngkaew, Charuwat Suzumura, Toyotaro Tokyo Inst Technol Tokyo Japan IBM Res Tokyo Japan

ISBN: (纸本)9781479907298

Betweenness centrality is a measure that determines the relative importance of a vertex (or an edge) within a graph based on shortest paths. Recently, large- scale graphs have emerged in many different domains, as social networks, road networks, protein interaction networks, etc., and they are too large to fit into the memory of a single SMP. the algorithm proposed by Edmonds et al. [1] is capable of running on distributed memory systems. However, the algorithm does not expose intra- node parallelism. In this paper we investigated the inter- and intra- node parallelism of computing betweenness centrality on distributed memory systems. We developed the implementation based on the algorithm proposed by Edmonds et al. using X10 programming language [2]. We further improved the performance of the implementation by optimizing the network transport of the X10 runtime. We thoroughly evaluated the performance of our implementation on synthetic graphs of various scales against the existing implementation of Edmonds' algorithm from PBGL. We estimated the betweenness centrality of the huge Twitter networks [3] and found that its distribution follows a power law.

关键词： betweenness centrality parallel processing PGAS X10

来源：评论

学校读者我要写书评

暂无评论

VKM: A Virtual Keyboard and Mouse Solution Towards a Lightweight computing System 20

VKM: A Virtual Keyboard and Mouse Solution Towards a Lightwe...

引用

20th Annual international conference on distributed computing in Smart Sensor systems and the Internet of things (DCOSS-IoT)

作者： Bisht, Divyansh Pal, Amitangshu Banerjea, Shashwati Indian Inst Technol Kanpur Comp Sci & Engn Kanpur Uttar Pradesh India Motilal Nehru Natl Inst Technol Allahabad Comp Sci & Engn Prayagraj UP India

ISBN: (纸本)9798350369458;9798350369441

this paper provides a novel solution for developing a virtual keyboard and mouse (VKM) system that is easily manageable and portable. the traditional keyboards and mouse devices take up valuable desk space and are not easily customizable to different languages. On-screen keyboards and 3-D cameras are alternatives, but they also have drawbacks. Our proposed method makes use of computer vision techniques and calls for a mini-projector and a web camera as necessary hardware. the system tracks hand keypoints to detect real-time touch events and uses the Mediapipe tool to detect hands and keystrokes. the mouse functionality is also implemented by monitoring the finger hovering. through experimentation, we show that our VKM solution can provide an accuracy of >90% for detecting the correct keystroke, with a typing speed of similar to 55 letters/min.

关键词： Virtual keyboard user interface computer vision hand gesture touch detection

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study on Performance and Resource Utilization of Real-time distributed Messaging systems for Big Data 20

A Comparative Study on Performance and Resource Utilization ...

引用

20th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD 2019)

作者： Intorruk, Somprasong Numnonda, thanisa King Mongkuts Inst Technol Ladkrabang Fac Informat Technol Bangkok Thailand

ISBN: (纸本)9781728116518

In the past few years, data continuously increase and in various forms called Big Data. Besides, data analytics play an important role more and more in most organizations. From these reasons, many efficiently distributed messaging systems have been introducing to handle Big Data in real-time. However, choosing the appropriate and efficient methods and tools to transfer Big Data is still challenging. therefore, this paper purposes of comparing the architecture, performance, and resource utilization between Apache Kafka which is one of the favorite tools for Big Data and Apache Pulsar which is similar to Kafka and become one of the latest tools for big data. After we implemented both systems in the same environment, the results show that Pulsar outperforms in throughput, latency, and average resource utilization especially when the size of messages is small (such as 1 KB and 1MB).

关键词： Kafka Pulsar distributed messaging Big Data

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：