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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,698 篇 会议
32 篇 期刊文献
25 册 图书

馆藏范围

2,755 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,682 篇 工学
- 1,477 篇 计算机科学与技术...
- 671 篇 软件工程
- 490 篇 信息与通信工程
- 355 篇 电气工程
- 93 篇 控制科学与工程
- 82 篇 网络空间安全
- 65 篇 生物工程
- 56 篇 电子科学与技术（可...
- 42 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 26 篇 交通运输工程
- 26 篇 安全科学与工程
- 25 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
323 篇 理学
- 192 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
216 篇 管理学
- 143 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
28 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
82 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 peer-to-peer com...
59 篇 internet of thin...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,720 篇 英文
28 篇 其他
6 篇 中文
2 篇 法文

检索条件"任意字段=11th International Conference on Distributed Computing and Networking"

共 2755 条记录，以下是2161-2170 订阅

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

详细简洁

排序：

Anycast routing in Delay Tolerant Networks using genetic algorithms for route decision

Anycast routing in Delay Tolerant Networks using genetic alg...

引用

international conference on Computer and Information Technology (ICCIT)

作者： Ederson Rosa da Silva Paulo Roberto Guardieiro Faculty ofElectrical Engineering Federal University of Uberlandia (UFU) Uberlandia Minas Gerais Brazil

Delay/Disruption Tolerant networking (DTN) architecture adopts the concept of intermittent networks that may suffer frequent disconnections, with the possibility of never having end-to-end connectivity between the source and destination over a given period of time. therefore, the design of protocols for those networks becomes a unique challenge. Routing in DTNs is one of the key components and remains open for discussion. In this paper we treat the routing for anycast delivery that is useful in situations where a host, applications or users wish to locate a host which supports a particular service. However, if several servers support the service, any of these servers can be used. then we implement a routing algorithm using genetic algorithm (GA), because the route and destination decision influence many parameters simultaneously. Our simulation results have shown that the routing using GA performs better than the shortest path algorithm.

关键词： Routing Disruption tolerant networking Genetic algorithms Delay effects Genetic engineering IP networks distributed computing Protocols Partitioning algorithms Internet

来源：评论

学校读者我要写书评

暂无评论

IFIP TC6 11th international conference on Personal Wireless Communications, PWC 2006

IFIP TC6 11th International Conference on Personal Wireless ...

引用

10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based distributed Systems, FMOODS 2008

ISBN: (纸本)3540688625

the proceedings contain 17 papers. the special focus in this conference is on Mobile and wireless networking, QoS, Ad-Hoc (I), Security, Ad-Hoc (II), Wireless LAN, Cross-layer desing, Wireless sensor networks (I), Physical layer, Wireless sensor networks (II), and Mobile and wireless applications. the topics include: Mobility protocols for handoff management in heterogeneous networks;supporting group communication in WCDMA networks;scheme for improving transmission performance of realtime traffic in handover between HMIPv6 intermap domains;donorlist: a new distributed channel allocation scheme for cellular networks;QoS-Aware video communications over TDMA/TDD wireless networks;channel state-aware joint dynamic cell coordination scheme using adaptive modulation and variable reuse factor in OFDMA downlink;comparative analysis among different monitoring functions in a bandwidth renegotiation scheme for packet switched cellular networks;load balancing approach for wireless IEEE 802.11 QoS enhancement;stable and energy efficient clustering of wireless ad hoc networks with LIDAR algorithm;DNS-Based service discovery in ad hoc networks: evaluation and improvements;a hop-by-hop multipath routing protocol using residual bandwidth for wireless mesh networks;lowest weight: reactive clustering algorithm for adhoc networks;distributed self-policing architecture for fostering node cooperation in wireless mesh networks;RFID systems: a survey on security threats and proposed solutions;TMSI allocation mechanism using a secure VLR authorization in the GSM system;on the anomaly intrusion-detection in mobile ad hoc network environments;locally-constructed trees for adhoc routing;and overlay small group multicast mechanism for MANET.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parallel performance of domain decomposition method on distributed computing environment

Parallel performance of domain decomposition method on distr...

引用

international conference on Computer and Information Technology (ICCIT)

作者： A.M.M. Mukaddes Atsushi Uragami Department of Industrial and Production Engineering Shahjalal University of Science and Technology Sylhet Bangladesh Department of Intelligent Machinery and Systems Kyushu University Japan

distributed parallel computing, which uses general-purpose workstations connected by a network as a large parallel computing resource, is one of the most promising trends in parallel computing. Over the last two decades, the growth in the use of such parallel computing environment has ensured the interest on the parallel finite element method. In this work, parallel finite element method using domain decomposition technique has been adapted to the distributed parallel environment of networked workstations and the supercomputer. Using the developed code, several model problems are solved and the parallel performances are analyzed on the network of eight Pentium IV PC cluster and GP7000F workstations. Finally, very large size of problem over 11 million DOFs has been solved using 1024 SR8000 supercomputer.

关键词： distributed computing Parallel processing Workstations Finite element methods Supercomputers Performance analysis Matrix decomposition Concurrent computing Vectors Computer networks

来源：评论

学校读者我要写书评

暂无评论

Toward Libraries for Real-Time Java

Toward Libraries for Real-Time Java

引用

international Symposium on Object-Oriented Real-Time distributed computing

作者： Trevor Harmon Martin Schoeberl Raimund Kirner Raymond Klefstad Electrical Engineering and Computer Science University of California Irvine USA Institute of Computer Engineering University of Technology Vienna Austria

ISBN: (纸本)9780769531328

Reusable libraries are problematic for real-time software in Java. Using Java's standard class library, for example, demands meticulous coding and testing to avoid response time spikes and garbage collection. We propose two design requirements for reusable libraries in real-time systems: worst-case execution time (WCET) bounds and worst- case memory consumption bounds. Furthermore, WCET cannot be known if blocking method calls are used. We have applied these requirements to the design of three Java-based prototypes: a set of collection classes, a networking stack, and trigonometric functions. Our prototypes show that reusable libraries can meet these requirements and thus be viable for real-time systems.

关键词： Java Real time systems Software libraries Prototypes distributed computing Computer science Software prototyping Operating systems Memory management Yarn

来源：评论

学校读者我要写书评

暂无评论

Cyber Physical Systems: Design Challenges

Cyber Physical Systems: Design Challenges

引用

international Symposium on Object-Oriented Real-Time distributed computing

作者： Edward A. Lee Center for Hybrid and Embedded Software Systems EECS University of California Berkeley Berkeley CA USA

ISBN: (纸本)9780769531328

Cyber-Physical Systems (CPS) are integrations of computation and physical processes. Embedded computers and networks monitor and control the physical processes, usually with feedback loops where physical processes affect computations and vice versa. the economic and societal potential of such systems is vastly greater than what has been realized, and major investments are being made worldwide to develop the technology. there are considerable challenges, particularly because the physical components of such systems introduce safety and reliability requirements qualitatively different from those in general- purpose computing. Moreover, physical components are qualitatively different from object-oriented software components. Standard abstractions based on method calls and threads do not work. this paper examines the challenges in designing such systems, and in particular raises the question of whether today's computing and networking technologies provide an adequate foundation for CPS. It concludes that it will not be sufficient to improve design processes, raise the level of abstraction, or verify (formally or otherwise) designs that are built on today's abstractions. To realize the full potential of CPS, we will have to rebuild computing and networking abstractions. these abstractions will have to embrace physical dynamics and computation in a unified way.

关键词： Physics computing Computer networks Embedded computing Computerized monitoring Process control Feedback loop Investments Safety Software quality Yarn

来源：评论

学校读者我要写书评

暂无评论

Dividing agents on the grid for large scale simulation

Dividing agents on the grid for large scale simulation

引用

11th Pacific Rim international conference on Multi-Agents, PRIMA 2008

作者： Ho, Dac Phuong Bui, the Duy Do, Nguyen Luong College of Technology Vietnam National University Hanoi Viet Nam

ISBN: (纸本)3540896732

Multi-agent based simulation is an important methodology that uses models incorporating agents to evaluate research conclusions. When the simulation involves a large number of agent, however, it requires extensively high computational power. In that case, all agents in the simulation model should be distributed in a way so that agents can be run in parallel on multiple computational nodes to gain the required performance speed up. In this paper, we present a framework for large scale multi-agent based simulation on grid. We have modified the desktop grid platform BOINC for multi-agent based simulation. Assuming that the agents interact locally with the environment, we proposed an approach to divide the agents for grid nodes so that we can keep load balancing for the distributed simulation while optimizing the communication between grid nodes and the grid server. We have implemented the food foraging simulation to evaluate the feasibility of the framework. © 2008 Springer Berlin Heidelberg.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Cardiac Medial Modeling and Time-Course Heart Wall thickness Analysis

引用

11th international conference on Medical Image computing and Computer-Assisted Intervention (MICCAI2008)

作者： Sun, Hui Avants, Brian B. Frangi, Alejandro F. Sukno, Federico Gee, James C. Yushkevich, Paul A. Univ Penn Dept Radiol Philadelphia PA 19104 USA Univ Pompeu Fabra Informat & Commun Technologies Dept Barcelona Spain CIBER BBN Networking Ctr Biomed Res Barcelona Spain

ISBN: (纸本)9783540859895

the medial model is powerful shape representation method that models a 3D object by explicitly defining it skeleton (medial axis) and deriving the boundary geometry according to medial geometry. It has been recently extended to model complex shapes with multi-figures, i.e, shapes whose skeletons can not be described by a single sheet in 3D. this paper applied the medial model to a 2-chamber heart data set consisting of 428 cardiac shapes from 90 subjects. the results show that the medial model can capture the heart shape accurately. To demonstrate the usage of the medial model, the changes of the heart wall thickness over time are analyzed. We calculated the mean heart wall thickness map of 90 subjects for different phases of the cardiac cycle, as well as the mean thickness change between phases.

关键词： Heart

来源：评论

学校读者我要写书评

暂无评论

A cooperative architecture for integrated mobile networking based on soft-switch control

A cooperative architecture for integrated mobile networking ...

引用

the 11th IEEE international conference on Communications Systems(第11届电子和电气工程师协会国际通信系统会议)(IEEE ICCS 2008)

作者： Hui Liu Jun Zhang Chi Zhou School of Electronic and Information Engineering Beihang University Beijing China 100083 Dept.of Electrical and Computer Engineering Illinois Institute of technology Chicago ILUSA 60616

this paper proposes an open cooperative architecture for the integration of mobile networks. It is based on the Soft-switch idea which is the control functional entity of Next Generation Network (NGN) and fit for large scale networking. In the architecture static routing combined with dynamic routing is adopted for globally connecting among network soft-switch centers (NSCs) with distributed control mode, using this method, heterogeneous mobile networks (HMN) can be high efficiently and collaboratively interoperated in the architecture. through the use of backup and pool techniques, the bottleneck problem can be solved, and system security enhanced. through dynamic control by NSC in the networking architecture, we can get traffic assignments among HMN based on the quality of service (QoS) and fairness, and can adopt optimal control strategies for each individual network. the algorithms for fair traffic assignment among HMN are addressed and analyzed.

关键词： Next generation networking Routing Optimal control Communication system traffic control Quality of service Large-scale systems Joining processes distributed control Collaboration Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A distributed Spatio-temporal EEG/MEG Inverse Solver

引用

11th international conference on Medical Image computing and Computer-Assisted Intervention (MICCAI2008)

作者： Ou, Wanmei Golland, Polina Haemaelaeinen, Matti MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA MGH Athinoula A Martinos Ctr Biomed Imaging Boston MA USA

ISBN: (纸本)9783540859871

We propose a novel l(1)l(2-)norm inverse solver for estimating the sources of EEG/MEG signals. Based on the standard l(1)-norm inverse solver, the proposed sparse distributed inverse solver integrates the l(1)-norm spatial model with a temporal model of the source signals in order to avoid unstable activation patterns and "spiky" reconstructed signals often produced by the original solvers. the joint spatio-temporal model leads to a cost function with an l(1)l(2)-norm regularizer whose minimization can be reduced to a convex second-order cone programming problem and efficiently solved using the interior-point method. Validation with simulated and real MEG data shows that the proposed solver yields source time course estimates qualitatively similar to those obtained through dipole fitting, but without the need to specify the number of dipole sources in advance. Furthermore, the l(1)l(2)-norm solver achieves fewer false positives and a better representation of the source locations than the conventional l(2) minimum-norm estimates.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content 08

A concurrency control protocol for parallel B-tree structure...

引用

11th international conference on Extending Database Technology, EDBT 2008

作者： Yoshihara, Tomohiro Kobayashi, Dai Yokota, Haruo Department of Computer Science Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan Global Scientific Information and Computing Center Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8550 Japan Systems Development Laboratory Hitachi Ltd. JSPS

ISBN: (纸本)9781595939265

While shared-nothing parallel infrastructures provide fast processing of explosively growing digital content, managing data efficiently across multiple nodes is important. the value-range partitioning method with parallel B-tree structures in a shared-nothing environment is an efficient approach for handling large amounts of data. To handle large amounts of data, it is also important to provide an efficient concurrency control protocol for the parallel B-tree. Many studies have proposed concurrency control protocols for B-trees, which use latch-coupling. None of these studies has considered that latch-coupling contains a performance bottleneck of sending of messages between processing elements (PEs) in distributed environments because latch-coupling is efficient for a B-tree on a single machine. the only protocol without latch-coupling is the B-link algorithm, but it is difficult to use the B-link algorithm directly on an entire parallel B-tree structure because it is necessary to guarantee the consistency of the side pointers. We propose a new concurrency control protocol named LCFB that requires no latch-coupling in optimistic processes. LCFB reduces the amount of communication between PEs during a B-tree traversal. To detect access path errors in the LCFB protocol caused by removal of latch-coupling, we assign boundary values to each index page. Because a page split may cause page deletion in a Fat-Btree, we also propose an effective method for handling page deletions without latch-coupling. We then combine LCFB with the B-link algorithm within each PE to reduce the cost of Structure Modification Operations (SMOs) in a PE, as a solution to the difficulty of consistency management for the side pointers in a parallel B-tree structure. To compare the performance of the proposed protocol with conventional protocols MARK-OPT, INC-OPT, and ARIES/IM, we implemented them on an autonomous disk system with a Fat-Btree structure. Experimental results in various environments

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 213 214 215 216 217 218 219 220 221 222 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：