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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,343 篇 会议
47 篇 期刊文献
18 册 图书

馆藏范围

1,408 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,077 篇 工学
- 1,026 篇 计算机科学与技术...
- 463 篇 软件工程
- 189 篇 电气工程
- 99 篇 信息与通信工程
- 49 篇 控制科学与工程
- 34 篇 机械工程
- 30 篇 电子科学与技术（可...
- 19 篇 生物工程
- 13 篇 动力工程及工程热...
- 13 篇 安全科学与工程
- 12 篇 网络空间安全
- 11 篇 仪器科学与技术
- 10 篇 化学工程与技术
- 9 篇 交通运输工程
- 9 篇 生物医学工程（可授...
- 8 篇 石油与天然气工程
- 6 篇 力学（可授工学、理...
223 篇 理学
- 157 篇 数学
- 32 篇 系统科学
- 26 篇 生物学
- 22 篇 物理学
- 21 篇 统计学（可授理学、...
- 17 篇 化学
120 篇 管理学
- 84 篇 管理科学与工程(可...
- 46 篇 工商管理
- 44 篇 图书情报与档案管...
16 篇 经济学
- 16 篇 应用经济学
14 篇 法学
- 12 篇 社会学
10 篇 医学
- 8 篇 临床医学
6 篇 教育学
- 6 篇 教育学
5 篇 农学
3 篇 文学
1 篇 军事学

主题

91 篇 distributed comp...
85 篇 parallel process...
70 篇 grid computing
61 篇 cloud computing
49 篇 concurrent compu...
47 篇 computational mo...
46 篇 computer network...
45 篇 distributed comp...
38 篇 parallel computi...
37 篇 scalability
35 篇 computer archite...
31 篇 costs
30 篇 high performance...
30 篇 distributed data...
29 篇 algorithm design...
29 篇 parallel process...
29 篇 hardware
27 篇 computer science
27 篇 application soft...
27 篇 parallel program...

机构

7 篇 department of co...
6 篇 institute of com...
5 篇 oak ridge natl l...
5 篇 department of co...
4 篇 univ warwick dep...
4 篇 natl univ def te...
4 篇 chinese acad sci...
4 篇 oak ridge natl l...
4 篇 department of co...
4 篇 university of te...
3 篇 nanyang technol ...
3 篇 institute of par...
3 篇 school of engine...
3 篇 argonne natl lab...
3 篇 univ calif davis...
3 篇 univ manchester ...
3 篇 key laboratory o...
3 篇 purdue univ sch ...
3 篇 hiroshima univ d...
3 篇 cnrs laas 7 ave ...

作者

7 篇 jiannong cao
6 篇 el-baz didier
6 篇 wang huaimin
6 篇 rothermel kurt
5 篇 jack dongarra
5 篇 yin gang
4 篇 ould-khaoua moha...
4 篇 koldehofe boris
4 篇 li maozhen
4 篇 wang tao
4 篇 jeong chang-sung
4 篇 min geyong
4 篇 vlassov v
4 篇 kacsuk peter
4 篇 labarta jesus
4 篇 schulze bruno
4 篇 jin hai
4 篇 ramachandran uma...
3 篇 fahringer thomas
3 篇 taura kenjiro

语言

1,398 篇 英文
5 篇 其他
4 篇 俄文
1 篇 西班牙文

检索条件"任意字段=7th International Symposium on Parallel and Distributed Computing"

共 1408 条记录，以下是1331-1340 订阅

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

详细简洁

排序：

Dynamic update of shortest path tree in OSPF

Dynamic update of shortest path tree in OSPF

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Bin Xiao Jiannong Cao Qingfeng Zhuge Zili Shao E.H.M. Sha Department of Computing Hong Kong Polytechnic University Hong Kong China Department of Computer Science University of Texas Dallas Richardson TX USA

the shortest path tree (SPT) construction is a critical issue to the high performance routing in an interior network using link state protocols, such as open shortest path first (OSPF) and IS-IS. In this paper, we propose a new efficient algorithm for dynamic SPT update to avoid the disadvantages (e.g. redundant computation) caused by static SPT update algorithms. the new algorithm is based on the understanding of the update procedure to reduce redundancy. Only significant elements that contribute to the construction of new SPT from the old one are focused on. the efficiency of our algorithm is improved because it only pay attention to the edges really count for the update process. the running time for the proposed algorithm is maximum reduced, which is shown through experimental results. Furthermore, our algorithm can be easily generalized to solve the SPT updating problem in a graph with negative weight edges and applied to the scenario of multiple edge weight changes.

关键词： Routing protocols Heuristic algorithms Computer networks Network topology Computer science IP networks Costs Delay Buildings Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

parallel distributed Cooperative Control of Multiple Vehicles with Low Communication Traffic

Parallel Distributed Cooperative Control of Multiple Vehicle...

引用

Conference on Vehicle Control and Intelligence (CVCI)

作者： Ma Jie Tang Sichao Gao Feng Liping Yuan State Key Laboratory of Automotive Safety and Energy College of Mechanical and Vechile Engineering Chongqing University Chongqing China College of Mechanical and Vechile Engineering Chongqing University Chongqing China Procurement Center Changan Automobile Co. Ltd. Chongqing China

this paper presents a parallel distributed framework for cooperative control of of connected and automated vehicles (CAV) with low communication traffic. With this framework, the original centralized cooperative control problem is decomposed to a series of separable sub-optimization ones by introducing a set of consensus variables and linear transformation to fully use the computation resources of CAV. Additionally, to reduce the communication traffic between different computing nodes, a communication filtering strategy is designed by limit the transmission of the consensus variables by considering the fact that the interaction process tends to convergence when the variation among adjacent steps is small. To ensure the converge of numerical optimization process, a non-negative decreasing function is used to evaluate the variation of consensus variables. the effectiveness of the proposed cooperative control system is validated and analyzed by several comparative simulations with the original one by considering several indices including cooperation, optimality and communication efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed (Δ + 1)-coloring in the physical model

Distributed (Δ + 1)-coloring in the physical model

引用

7th international symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011

作者： Yu, Dongxiao Wang, Yuexuan Hua, Qiang-Sheng Lau, Francis C. M. Department of Computer Science University of Hong Kong Pokfulam Hong Kong Hong Kong Institute for Interdisciplinary Information Sciences Tsinghua University Beijing 100084 China

ISBN: (纸本)9783642282089

In multi-hop radio networks, such as wireless ad-hoc and sensor networks, nodes employ a MAC (Medium Access Control) protocol such as TDMA to coordinate accesses to the shared medium and to avoid interference of close-by transmissions. these protocols can be implemented using standard node coloring. the (Δ + 1)-coloring problem is to color all nodes in as few timeslots as possible using at most Δ + 1 colors such that any two nodes within distance R are assigned different colors, where R is a given parameter and Δ is the maximum degree of the modeled unit disk graph using the scaling factor R. Being one of the most fundamental problems in distributed computing, this problem is well studied and there are a long chain of algorithms for it. However, all previous work are based on models that are highly abstract, such as message passing models and graph based interference models, which limit the utility of these algorithms in practice. In this paper, for the first time, we consider the distributed Δ + 1-coloring problem under the more practical SINR interference model. In particular, without requiring any knowledge about the neighborhood, we propose a novel randomized (Δ + 1)-coloring algorithm with time complexity O(Δlogn + log2 n). For the case where nodes can not adjust their transmission power, we give an O(Δlog 2 n) randomized algorithm, which only incurs a logarithmic multiplicative factor overhead. © 2012 Springer-Verlag.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

A Privacy and Price-Aware Inter-Cloud System

A Privacy and Price-Aware Inter-Cloud System

引用

IEEE international Conference on Cloud computing Technology and Science (CloudCom)

作者： Yuanfang Chi Wei Cai Zhen Hong Henry C. B. Chan Victor C. M. Leung Department of Electrical and Computer Engineering The University of British Columbia Canada Department of Computing The Hong Kong Polytechnic University Hong Kong

Cloud service selection and financial expense are two main concerns of users considering adoption of cloud computing services. In this paper, we propose a novel cloud federation that is cognitive to the dynamic prices. the cloud federation system first determines on which cloud services should the user applications be deployed. then, when a cloud provider is charging too high for a VM, the proposed system automatically migrates user tasks to a cloud system that is charging at a lower rate. We discuss the architectural framework and platform design, provide a mathematic formulation and investigate a total service fee minimization approach with privacy constraints. Preliminary simulation results demonstrate the proposed system can lower the cost of cloud services by exploiting the advantages of different price policies provided by multiple cloud providers.

关键词： Cloud computing Pricing parallel processing Privacy distributed databases Data security

来源：评论

学校读者我要写书评

暂无评论

A Multi-core parallel Branch-and-Bound Algorithm Using Factorial Number System

A Multi-core Parallel Branch-and-Bound Algorithm Using Facto...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Mohand Mezmaz Rudi Leroy Nouredine Melab Daniel Tuyttens University of Mons Mons Belgium Inria Lille - Nord Europe LIFL-Université Lillel France

ISBN: (纸本)9781479938018

Many real-world problems in different industrial and economic fields are permutation combinatorial optimization problems. Solving to optimality large instances of these problems, such as flowshop problem, is a challenge for multi-core computing. this paper proposes a multi-threaded factoradic-based branch-and-bound algorithm to solve permutation combinatorial problems on multi-core processors. the factoradic, called also factorial number system, is a mixed radix numeral system adapted to numbering permutations. In this new parallel algorithm, the B&B is based on a matrix of integers instead of a pool of permutations, and work units exchanged between threads are intervals of factoradics instead of sets of nodes. Compared to a conventional pool-based approach, the obtained results on flowshop instances demonstrate that our new factoradic-based approach, on average, uses about 60 times less memory to store the pool of subproblems, generates about 1.3 times less page faults, waits about 7 times less time to synchronize the access to the pool, requires about 9 times less CPU time to manage this pool, and performs about 30,000 times less context switches.

关键词： Computational modeling Instruction sets Multicore processing Indexes Optimization parallel processing Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Knowledge states for the caching problem in shared memory multiprocessor systems

Knowledge states for the caching problem in shared memory mu...

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： W.W. Bein L.L. Larmore R. Reischuk School of Computer Science University of Nevada Las Vegas USA Institut für Theoretische Informatik Universität zu Lübeck Germany

Multiprocessor systems with a global shared memory provide logically uniform data access. To hide latencies when accessing global memory each processor makes use of a private cache. Several copies of a data item may exist concurrently in the system. To guarantee consistency when updating an item a processor must invalidate copies of the item in other private caches. To exclude the effect of classical paging faults, one assumes that each processor knows its own data access sequence, but does not know the sequence of future invalidations requested by other processors. Performance of a processor with this restriction can be measured against the optimal behavior of a theoretical omniscient processor, using competitive analysis. A 4/3 competitive randomized online algorithm for this problem for cache size 2 is presented. this algorithm is derived with the help of a new concept we call knowledge states. We also prove a matching lower bound, thus this online algorithm is best possible. Finally, a lower bound of 3/2 on the competitiveness for larger cache sizes is shown.

关键词： Multiprocessing systems Cost function Computer science Delay Performance analysis High performance computing Paging strategies Analytical models parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A Framework for Real-Time Information Derivation from Big Sensor Data

A Framework for Real-Time Information Derivation from Big Se...

引用

IEEE international symposium on Cyberspace Safety and Security

作者： Liehuo Chen Kyoung-Don Kang Dept. of Comput. Sci. State Univ. of New York at Binghamton Binghamton NY USA

ISBN: (纸本)9781479989386

In data-intensive real-time applications, e.g., transportation management and location-based services, the amount of sensor data is exploding. In these applications, it is desirable to extract value-added information, e.g., fast driving routes, from sensor data streams in real-time rather than overloading users with massive raw data. However, achieving the objective is challenging due to the data volume and complex data analysis tasks with stringent timing constraints. Most existing big data management systems, e.g., Hadoop, are not directly applicable to real-time sensor data analytics, since they are timing agnostic and focus on batch processing of previously stored data that are potentially outdated and subject to I/O overheads. To address the problem, we design a new real-time big data management framework, which supports a non-preemptive periodic task model for continuous in-memory sensor data analysis and a schedulability test based on the EDF (Earliest Deadline First) algorithm to derive information from current sensor data in real-time by extending the map-reduce model originated in functional programming. As a proof-of-concept case study, a prototype system is implemented. In the performance evaluation, it is empirically shown that all deadlines can be met for the tested sensor data analysis benchmarks.

关键词： Big Data batch processing (computers) data analysis functional programming parallel processing performance evaluation EDF algorithm I/O overheads batch processing complex data analysis tasks continuous in-memory sensor data analysis data volume data-intensive real-time applications earliest deadline first algorithm nonpreemptive periodic task model real-time big data management framework real-time information derivation real-time sensor big data analytics schedulability test stringent timing constraints timing agnostic value-added information extraction Analytical models Big data Data analysis Data models Mobile radio mobility management Real-time systems Timing Big Sensor Data Real-Time Information

来源：评论

学校读者我要写书评

暂无评论

Constructing a Mobility and Acceleration computing Platform with NVIDIA Jetson TK1

Constructing a Mobility and Acceleration Computing Platform ...

引用

IEEE international symposium on Cyberspace Safety and Security

作者： Min Su Jianjun Tan Chun-Yuan Lin Jin Ye Chung-Hung Wang Che-Lun Hung College of Life Science and Bioengineering Beijing University of Technology Department of Computer Science and Information Engineering Chang Gung University Department of Computer Science and Communication Engineering Providence University

ISBN: (纸本)9781479989386

Current high-end graphics processing units (GPUs), which contain up to thousand cores per-chip, are widely used in the high performance computing community. However, in the past, the cost and power consumption of constructing a high performance platform with graphics cards, such as Tesla and Fermi series, are high. Moreover, these graphics cards all installed in personal computers or servers, and then the immediate and mobility requirements can not be provided by this platform. NVIDIA Jetson TK1 (Tegra K1) is a full-featured platform for embedded applications and it contains 192 CUDA Cores (Kepler CPU). Due to its low cost, low power consumption and high applicability, NVIDIA Jetson TK1 has become a new research direction. In this paper, we construct a mobility and acceleration computing platform with NVIDIA Jetson TK1. Besides, two tools, ClustalWtk and MCCtk are designed based on NVIDIA Jetson TK1. these tools both can achieve 3 and 4 times speedup ratios on single NVIDIA Jetson TK1 by comparing with their CPU versions on Intel XEON E5-2650 CPU and ARM Cortex-A15 CPU, respectively. Moreover, the cost-performance ratio by NVIDIA Jetson TK1 is higher than that by NVIDIA Tesla K20m. In addition, the user friendly interfaces are also provided by these two tools, respectively.

关键词： NVIDIA Jetson TK1 CUDA Mutliple Sequence Alginment Compound Comparison parallel Processing

来源：评论

学校读者我要写书评

暂无评论

Join sequence optimization in parallel query plans

Join sequence optimization in parallel query plans

引用

international Workshop on Database and Expert Systems Applications

作者： U.J. Langer H.F. Meyer CS Department University of Rostock Rostock Germany

We show an alternative way to optimize join sequences in a shared nothing architecture of the distributed relational DBMS HEAD. the hardware resources are also used for database independent applications in concurrency, for database access. To achieve a better hardware utilization we span a complete search space involving all intermediate shapes between left deep, right deep and bushy trees, but without join sequences including cartesian products. the approach is based on any combinatorial search engine and a complex cost function. the cost function involves the actual load of the processors, the network load, and the memory capacities. the new technique has free access to any join sequence in the whole search space. the approach is not restricted to acyclic join conditions.

关键词： Shape Hardware Relational databases Cost function Tree graphs parallel processing Workstations Concurrent computing Search engines Optimization methods

来源：评论

学校读者我要写书评

暂无评论

Adaptive Phase Synchronisation Algorithm for Collaborative Beamforming in Wireless Sensor Networks

Adaptive Phase Synchronisation Algorithm for Collaborative B...

引用

Asia international Conference on Modeling & Simulation

作者： Chen How Wong Zhan Wei Siew Renee Ka Yin Chin Aroland Kiring Kenneth Tze Kin Teo Modelling Simulation & Computing Laboratory Universiti Malaysia Sabah Kota Kinabalu Malaysia Universiti Malaysia Sabah Kota Kinabalu Sabah MY

Collaborative beam forming (CB) is a cooperative technique that utilizes a group of distributed wireless nodes to collectively transmit a common message with proper phase weights to an intended direction. As a result, CB significantly extends the communication range of the sensor node in wireless sensor networks (WSNs). Each sensor node in CB has an independent local oscillator. It becomes a vital problem to achieve CB as the distributed nodes are unaware of their phase relationship. therefore, an efficient phase synchronisation algorithm is needed as the distributed nodes are unaware of their phase relationship. In this paper, an iterative phase synchronisation algorithm using (1+1)-evolution strategy (ES) is proposed to achieve CB in WSNs. Evaluations have been carried out through simulation and the results show that the proposed algorithm is more energy efficient in comparison to the existing phase synchronisation algorithm.

关键词： Synchronization Array signal processing Receivers Wireless sensor networks Simulation Algorithm design and analysis Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共141页 << < 130 131 132 133 134 135 136 137 138 139 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：