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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,965 篇 会议
1,891 篇 期刊文献
110 册 图书

馆藏范围

3,966 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,130 篇 工学
- 1,318 篇 计算机科学与技术...
- 1,067 篇 软件工程
- 501 篇 信息与通信工程
- 282 篇 生物医学工程（可授...
- 272 篇 生物工程
- 257 篇 控制科学与工程
- 228 篇 电气工程
- 219 篇 光学工程
- 218 篇 电子科学与技术（可...
- 160 篇 核科学与技术
- 141 篇 机械工程
- 141 篇 仪器科学与技术
- 89 篇 化学工程与技术
- 80 篇 动力工程及工程热...
- 69 篇 材料科学与工程（可...
1,667 篇 理学
- 845 篇 物理学
- 576 篇 数学
- 333 篇 生物学
- 194 篇 统计学（可授理学、...
- 127 篇 系统科学
- 100 篇 化学
524 篇 管理学
- 321 篇 管理科学与工程(可...
- 222 篇 图书情报与档案管...
- 172 篇 工商管理
284 篇 医学
- 240 篇 临床医学
- 219 篇 基础医学(可授医学...
- 148 篇 药学(可授医学、理...
- 93 篇 公共卫生与预防医...
84 篇 法学
- 70 篇 社会学
68 篇 经济学
- 68 篇 应用经济学
49 篇 教育学
44 篇 农学
11 篇 文学
6 篇 艺术学
3 篇 军事学

主题

142 篇 informatics
95 篇 artificial intel...
90 篇 hadron colliders
74 篇 computer network...
72 篇 machine learning
63 篇 higgs bosons
59 篇 wireless sensor ...
55 篇 deep learning
55 篇 quality of servi...
55 篇 computational mo...
54 篇 computer archite...
50 篇 protocols
47 篇 proton-proton in...
45 篇 bandwidth
45 篇 costs
45 篇 mobile communica...
44 篇 electronic mail
41 篇 routing
40 篇 image segmentati...
40 篇 resource managem...

机构

412 篇 department for p...
404 篇 faculty of scien...
402 篇 kirchhoff-instit...
398 篇 department of ph...
386 篇 department of ph...
386 篇 institute of phy...
385 篇 department of ph...
370 篇 institute of phy...
369 篇 fakultät für phy...
345 篇 instituto de fís...
308 篇 department of ph...
287 篇 dipartimento di ...
284 篇 graduate school ...
284 篇 department of ph...
281 篇 nikhef national ...
280 篇 department of ph...
272 篇 department of ph...
270 篇 universidade fed...
265 篇 ictp trieste
259 篇 yerevan physics ...

作者

336 篇 c. alexa
334 篇 j. m. izen
332 篇 g. bella
331 篇 d. calvet
331 篇 c. amelung
329 篇 j. strandberg
326 篇 g. spigo
325 篇 f. siegert
318 篇 r. ströhmer
318 篇 m. rijssenbeek
318 篇 s. jin
318 篇 g. gaudio
317 篇 s. mohapatra
310 篇 s. guindon
307 篇 a. kaczmarska
303 篇 j. schaarschmidt
299 篇 y. tayalati
293 篇 a. d. pilkington
290 篇 l. chevalier
283 篇 m. klein

语言

3,760 篇 英文
172 篇 其他
33 篇 中文
5 篇 日文
1 篇 德文

检索条件"机构=Computer Technology Institute CTI and Department of Computer Engineering and Informatics"

共 3966 条记录，以下是3421-3430 订阅

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

详细简洁

排序：

Burstification effect on the TCP synchronization and congestion window mechanism

Burstification effect on the TCP synchronization and congest...

引用

International Conference on Broadband Networks (BroadNets)

作者： Kyriakos G. Vlachos Computer Engineering and Informatics Department & Research Academic Computer Technology Institute University of Patras Rio Greece

ISBN: (纸本)9781424414321

In this paper, we study the burstification effect on the TCP synchronization and TCP congestion window mechanism. It is shown that short assembly times are optimal for flows with similar characteristics, while large assembly time provide a higher notion of fairness. In addition, this paper analyzes the synchronization of multiple TCP flows when aggregated together over the same optical bursts. It is shown that there is a strong TCP synchronization effect upon burst losses, in the sense that flows’ windows increase/decrease simultaneously, resulting to a significant variation of outgoing traffic. These deficiencies may be dealt with employing a multi-queue burst assembly scheme with different timers and taking into account the TCP dynamics.

关键词： Assembly Delay Transport protocols Throughput Performance analysis informatics Image motion analysis Optical sensors Optical losses Traffic control

来源：评论

学校读者我要写书评

暂无评论

Multiple-Input and Shared Buffer Architectures for Asynchronous Optical Burst Switching Networks

Multiple-Input and Shared Buffer Architectures for Asynchron...

引用

IEEE International Conference on Communications (ICC)

作者： K. Yiannopoulos E. Varvarigos K. Vlachos Computer Engineering and Informatics Department and Research Academic Computer Technology Institute University of Patras Rio Greece

In this paper, we present the architectural design of optical burst-buffers that can truly emulate input queuing and accommodate asynchronous burst operation. The architectural design uses wavelength converters and fixed feed-forward delay lines that are combined to form either a multiple-input buffer or a shared buffer. Both schemes are modular, allowing the logarithmic expansion of buffer size with the number of switching elements (wavelength converters).

关键词： Optical buffering Optical burst switching Optical wavelength conversion Delay lines Buffer storage Optical design Optical feedback Optical fiber networks Propagation delay Feedforward systems

来源：评论

学校读者我要写书评

暂无评论

A Power Control Scheme for Efficient Radio Bearer Selection in MBMS

A Power Control Scheme for Efficient Radio Bearer Selection ...

引用

IEEE International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM)

作者： Antonios Alexiou Christos Bouras Evangelos Rekkas Research Academic Computer Technology Institute Greece and Computer Engineering and Informatics Department University of Patras Greece

This paper proposes a power control scheme for the efficient radio bearer selection in the Multimedia Broadcast/Multicast Service (MBMS) framework of Universal Mobile Telecommunications System (UMTS). The choice of the most efficient transport channel in terms ofpower consumption is a key point for the MBMS since a wrong transport channel selection for the transmission of the MBMS data could result to a significant decrease in the total capacity of the system. Diferent UMTS transport channels are examined and an algorithm that defines the switching point between dedicated and common radio bearers is proposed The proposed MBMSpower control scheme selects the transport channel that reduces the Node B's transmission power in every cell of the network with multicast users.

关键词： Power control 3G mobile communication Energy consumption Broadcasting Power engineering computing Multimedia communication Broadcast technology Multicast algorithms Videoconference Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

A Framework for Providing Hard Delay Guarantees in Grid Computing

A Framework for Providing Hard Delay Guarantees in Grid Comp...

引用

IEEE International Conference on e-Science and Grid Computing

作者： Panagiotis Kokkinos Emmanouel A. Varvarigos Nikolaos D. Doulamis Department of Computer Engineering and Informatics University of Patras and Research Academic Computer Technology Institute Patras Greece

Future grid networks should be able to provide quality of service (QoS) guarantees to their users. In this work we propose a framework for grid networks that provides deterministic delay guarantees to its guaranteed service (GS) users and best effort service to its best effort (BE) users. The proposed framework is theoretically and experimentally analyzed. We also define four types of computational resources based on the type of users (GS, BE) these resources serve and the priority they give them. We implement the proposed QoS framework for grids and verify that it not only satisfies the delay guarantees given to GS users, but also improves performance in terms of deadlines missed and resource use. In our simulations, data from a real grid network are used, validating in this way the appropriateness and usefulness of the proposed framework.

关键词： Delay Grid computing Quality of service computer networks Resource management Computational modeling Processor scheduling informatics Optical fiber networks computer vision

来源：评论

学校读者我要写书评

暂无评论

Delay Components of Job Processing in a Grid: Statistical Analysis and Modeling

Delay Components of Job Processing in a Grid: Statistical An...

引用

International Conference on Networking and Services (ICNS)

作者： K. Christodoulopoulos V. Gkamas E. A. Varvarigos Computer Engineering and Informatics Department and Research Academic Computer Technology Institute University of Patras Patras Greece

ISBN: (纸本)9781424431526

The existence of good probabilistic models for the job arrival process and the delay components introduced at the different stages of job processing in a grid environment is important for the improved understanding of the computing concept envisioned by the Grid. In this study, we present a thorough analysis of the job arrival process in the EGEE infrastructure and the time durations a job spends at different states in the EGEE environment. We define four delay components of the total job delay and model each component separately. We observe that the job inter-arrival times at the grid level can be adequately modeled by a rounded exponential distribution, while the total job delay (from the time it is generated until the time it completes execution) is dominated by the computing element's queuing and worker node's execution times.

关键词： Statistical analysis Grid computing Delay effects Exponential distribution Traffic control informatics Mesh generation Distributed computing Information retrieval Data analysis

来源：评论

学校读者我要写书评

暂无评论

An Object Driven Partitioning Approach for Distributed Virtual Environments

An Object Driven Partitioning Approach for Distributed Virtu...

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Christos Bouras Eri Giannaka Thrasyvoulos Tsiatsos Computer Engineering and Informatics Department University of Patras Greece Research Academic Computer Technology Institute Patras Greece Department of Informatics Aristotle University of Thessaloniki Thessaloniki Greece

Distributed virtual environments tend to become a de facto solution for large-scale networked virtual environments. One of the key issues and problems that need to be handled in the design of a scalable and effective distributed virtual environment system is the partitioning problem, which refers to the efficient assignment of the system's workload to the available resources of the system. This paper presents an object driven partitioning approach based on the partitioning algorithm of Lui & Chan, who proposed a three step technique for balancing the workload among the servers of the Distributed Virtual Environment.

关键词： Virtual environment Partitioning algorithms Costs Avatars Distributed computing computer networks Concurrent computing informatics Large-scale systems Application software

来源：评论

学校读者我要写书评

暂无评论

Improved Genetic Algorithms and List Scheduling Techniques for Independent Task Scheduling in Distributed Systems

Improved Genetic Algorithms and List Scheduling Techniques f...

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Thanasis Loukopoulos Petros Lampsas Panos Sigalas Department of Computer and Communications Engineering University of Thessaly Volos Greece Department of Informatics and Computer Technology Technological Educational Institute of Lamia Lamia Greece

Given a set of tasks with certain characteristics, e.g., data size, estimated execution time and a set of processing nodes with their own parameters, the goal of task scheduling is to allocate tasks at nodes so that the total makespan is minimized. The problem has been studied under various assumptions concerning task and node parameters with the resulting problem statements usually being NP-complete. List scheduling (LS) heuristics such as MaxMin and MinMin together with genetic algorithms (GAs) were applied in the past to find solutions. In this paper we investigate new heuristics for both the LS and the GA paradigm with the specific aim of improving the performance of the standard algorithms when task computations involve large data transfers. Experimental results under various environment assumptions illustrate the merits of the new algorithms.

关键词： Genetic algorithms Processor scheduling Distributed computing Concurrent computing Educational technology Clustering algorithms Application software informatics Grid computing Testing

来源：评论

学校读者我要写书评

暂无评论

Implementing Replica Placements: Feasibility and Cost Minimization

Implementing Replica Placements: Feasibility and Cost Minimi...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Thanasis Loukopoulos Nikos Tziritas Petros Lampsas Spyros Lalis Department of Computer and Communications Engineering University of Thessally Volos Greece Department of Informatics and Computer Technology Technological Educational Institute of Lamia Lamia Greece

Given two replication schemes X old and X new , the replica transfer scheduling problem (RTSP) aims at reaching X new , starting from X old , with minimal implementation cost. In this paper we generalize the problem description to include special cases, where deadlocks can occur while in the process of implementing X new . We address this impediment by introducing artificial (dummy) transfers. We then prove that RTSP-decision is NP-complete and propose two kinds of heuristics. The first attempts to replace dummy transfers with valid ones, while the second minimizes the implementation cost. Experimental evaluation of the algorithms illustrates the merits of our approach.

关键词： Network servers Motion pictures Educational technology System recovery Cost function Processor scheduling Impedance Availability Web server Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

k-Attractors: A Clustering Algorithm for Software Measurement Data Analysis

k-Attractors: A Clustering Algorithm for Software Measuremen...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Yiannis Kanellopoulos Panos Antonellis Christos Tjortjis Christos Makris Department of Computer Engineering and Informatics University of Patras Greece School f Computer Science University of Manchester Institute of Science and Technology UK

Clustering is particularly useful in problems where there is little prior information about the data under analysis. This is usually the case when attempting to evaluate a software system's maintainability, as many dimensions must be taken into account in order to reach a conclusion. On the other hand partitional clustering algorithms suffer from being sensitive to noise and to the initial partitioning. In this paper we propose a novel partitional clustering algorithm, k-Attractors. It employs the maximal frequent itemset discovery and partitioning in order to define the number of desired clusters and the initial cluster attractors. Then it utilizes a similarity measure which is adapted to the way initial attractors are determined. We apply the k-Attractors algorithm to two custom industrial systems and we compare it with WEKA 's implementation of K-Means. We present preliminary results that show our approach is better in terms of clustering accuracy and speed.

关键词： Clustering algorithms Software algorithms Software measurement Data analysis Partitioning algorithms Software systems Software maintenance Maintenance engineering Iterative algorithms Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Trust in global computing systems as a limit property emerging from short range random interactions

Trust in global computing systems as a limit property emergi...

引用

International Conference on Availability, Reliability and Security, ARES

作者： V. Liagkou E. Makri P. Spirakis Y.C. Stamatiou Department of Computer Engineering and Informatics University of Patras Greece Research Academic Computer Technology Institute Greece Department of Mathematics University of Aegean Greece Department of Computer Engineering and Informatics University of Patras Patras Greece Mathematics Department University of Ioannina (UoI) Greece

ISBN: (纸本)9780769527758;0769527752

Today we are experiencing a major reconsideration of the computing paradigm, as witnessed by the abundance and increasing frequency of use of terms such as ambient intelligence, ubiquitous computing, disappearing computer, grid computer, global computing and mobile ad-hoc networks. Systems that can be described with such terms are of a dynamic, with no clear physical boundary, nature and it seems that it is impossible (or, at least, difficult) to define sharply a number of important properties holding with certainty as well as holding throughout the whole lifetime of the system. One such system property, which is important for the viability of a system, is trust. Our departure point is the assumption that it seems very difficult to define static system properties related to trust and expect that they hold eternally in the rapidly changing systems falling under the new computing paradigm. One should, rather, attempt to define trust in terms of properties that hold with some limiting probability as the system grows and try to establish conditions that ensure that "good" properties hold almost certainly. Based on this viewpoint, in this paper we provide a new framework for defining trust through formally definable properties that hold, almost certainly, in the limit in randomly growing combinatorial structures that model "shapeless" computing systems (e.g., ad-hoc networks), drawing on results that establish the threshold behavior of predicates written in the first and second order logic

关键词： computer networks Grid computing Pervasive computing informatics Mathematics Ad hoc networks Logic Mechanical factors Protocols Management information systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共397页 << < 339 340 341 342 343 344 345 346 347 348 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：