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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,112 篇 工学
- 1,300 篇 计算机科学与技术...
- 1,056 篇 软件工程
- 498 篇 信息与通信工程
- 283 篇 生物医学工程（可授...
- 272 篇 生物工程
- 251 篇 控制科学与工程
- 227 篇 电气工程
- 223 篇 光学工程
- 213 篇 电子科学与技术（可...
- 168 篇 核科学与技术
- 142 篇 仪器科学与技术
- 138 篇 机械工程
- 88 篇 化学工程与技术
- 80 篇 动力工程及工程热...
- 64 篇 材料科学与工程（可...
1,654 篇 理学
- 843 篇 物理学
- 570 篇 数学
- 328 篇 生物学
- 192 篇 统计学（可授理学、...
- 128 篇 系统科学
- 100 篇 化学
524 篇 管理学
- 319 篇 管理科学与工程(可...
- 221 篇 图书情报与档案管...
- 170 篇 工商管理
287 篇 医学
- 243 篇 临床医学
- 222 篇 基础医学(可授医学...
- 148 篇 药学(可授医学、理...
- 98 篇 公共卫生与预防医...
82 篇 法学
- 68 篇 社会学
68 篇 经济学
- 68 篇 应用经济学
50 篇 教育学
44 篇 农学
11 篇 文学
6 篇 艺术学
3 篇 军事学

主题

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

机构

412 篇 department for p...
407 篇 faculty of scien...
404 篇 kirchhoff-instit...
395 篇 department of ph...
389 篇 department of ph...
385 篇 institute of phy...
382 篇 department of ph...
372 篇 institute of phy...
367 篇 fakultät für phy...
349 篇 instituto de fís...
306 篇 department of ph...
291 篇 dipartimento di ...
287 篇 graduate school ...
287 篇 nikhef national ...
287 篇 department of ph...
282 篇 department of ph...
269 篇 universidade fed...
267 篇 department of ph...
262 篇 yerevan physics ...
262 篇 ictp trieste

作者

337 篇 c. alexa
335 篇 j. m. izen
333 篇 g. bella
332 篇 d. calvet
332 篇 c. amelung
330 篇 j. strandberg
327 篇 g. spigo
326 篇 f. siegert
320 篇 r. ströhmer
320 篇 m. rijssenbeek
320 篇 s. jin
320 篇 g. gaudio
319 篇 s. mohapatra
312 篇 s. guindon
308 篇 a. kaczmarska
305 篇 j. schaarschmidt
300 篇 y. tayalati
296 篇 a. d. pilkington
293 篇 l. chevalier
285 篇 m. klein

语言

3,796 篇 英文
108 篇 其他
33 篇 中文
5 篇 日文

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

共 3938 条记录，以下是3731-3740 订阅

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

详细简洁

排序：

2-D Spatial indexing scheme in optimal time

引用

East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications, ADBIS-DASFAA 2000

作者： Kitsios, Nectarios Makris, Christos Sioutas, Spyros Tsakalidis, Athanassios Tsaknakis, Jhon Vassiliadis, Bill Department of Computer Engineering and Informatics: Graphics Multimedia and GIS Laboratory University of Patras Patras26500 Greece Computer Technology Institute: Research Unit 5 P.O. Box 1122 Patras26110 Greece

ISBN: (纸本)3540679774

We consider the 2-dimensional space with integer coordinates in the range [1, N] × [1, N]. We present the MPST (Modified Priority Search Tree) index structure which reports the k points that lie inside the quadrant query range (, b] × (, c] in optimal O(k) time. Our Index Scheme is simple, fast and it can be used in various geometric or spatial applications such as: (1) 2 D dominance reporting on a grid (2) 2D maximal elements on a grid. Then, based on structures of Gabow et al. [6] and Beam and Fich [31] we describe an index scheme, which handles in an efficient way window queries in spatial database applications. In the general case in which the plane has real coordinates the above time results are slowed down by adding a logarithmic factor due to the normalization technique. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Locating information with uncertainty in fully interconnected networks 14th

引用

14th International Conference on Distributed Computing, DISC 2000

作者： Kirousis, Lefteris M. Kranakis, Evangelos Krizanc, Danny Stamatiou, Yannis C. University of Patras Department of Computer Engineering and Informatics RioPatras26500 Greece Carleton University School of Computer Science OttawaONK1S 5B6 Canada Wesleyan University Department of Mathematics MiddletownCT06459 United States University of Patras Department of Computer Engineering and Informatics Rio Patras Greece and Computer Technology Institute Kolokotroni 3 GR-262 21 Patras26500 Greece

ISBN: (纸本)3540411437

We consider the problem of searching for a piece of information in a fully interconnected computer network (or clique) by exploiting advice about its location from the network nodes. Each node contains a database that "knows" what kind of documents or information are stored in other nodes (e.g. a node could be a Web server that answers queries about documents stored on the Web). The databases in each node, when queried, provide a pointer that leads to the node that contains the information. However, this information is up-to-date (or correct) with some bounded probability. While, in principle, one may always locate the information by simply visiting the network nodes in some prescribed ordering, this requires a time complexity in the order of the number of nodes of the network. In this paper, we provide algorithms for locating an information node in the complete communication network, that take advantage of advice given from network nodes. The nodes may either give correct advice, by pointing directly to the information node, or give wrong advice by pointing elsewhere. We show that, on the average, if the probability p that a node provides correct advice is asymptotically larger than 1/ra, where n is the number of the computer nodes, then the average time complexity for locating the information node is, asymptotically, 1/p or 2/p depending on the available memory. The probability p may, in general. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Internet protocols for synchronous distance learning

Internet protocols for synchronous distance learning

引用

International Workshop on Database and Expert Systems Applications

作者： C. Bouras A. Gkamas T. Tsiatsos Computer Technology Institute Greece Computer Engineering and Informatics Department University of Patras Greece

The use of multimedia in telematics and new services has been greatly improved by the introduction of new systems and techniques. These new systems and techniques have made possible the implementation of many telematic applications such as tele-teaching, and collaborative or tele-medicine applications. We present design, protocol and implementation issues of an Internet based synchronous distant learning application. We describe in detail the design and implementation of each application's module and propose protocols which control communication among the application's components. The application is network-based, following the client-server model. The application runs over the Internet and more specifically over the Web. Users of the application access its services through Web pages.

关键词： Internet Protocols computer aided instruction Application software informatics Electronic mail Multimedia systems Telematics Teleconferencing Collaborative work

来源：评论

学校读者我要写书评

暂无评论

Greedy dynamic hot-potato routing on arrays

Greedy dynamic hot-potato routing on arrays

引用

International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

作者： I. Caragiannis C. Kaklamanis I. Vergados Computer Technology Institute and Department of Computer Engineering and Informatics University of Patras Rio Greece

ISBN: (纸本)0769509363

We consider the problem of routing packets in two-dimensional torus-connected processor arrays. Motivated by theoretical work on dynamic routing, we address the dynamic case where packets are continuously injected into the network. We describe three greedy hot-potato routing algorithms and present simulation experiments on tori of several sizes using four well-known greedy (also known as work-conserving) protocols (namely FIFO, LIFO, FTG, and NTG) for the implementation of injection buffers. Our results demonstrate that there exists a greedy hot-potato routing algorithm that is stable for all greedy injection queueing protocols for injection rates very close to 100% of the network capacity. Furthermore, according to the algorithms we studied, we can claim that the one-pass property is not appropriate for the dynamic case, since the system cannot achieve stability at high injection rates.

关键词： Buffer storage informatics Routing protocols Stability Heuristic algorithms Vents

来源：评论

学校读者我要写书评

暂无评论

Efficient on-line communication in cellular networks 00

Efficient on-line communication in cellular networks

引用

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures

作者： Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Computer Technology Institute and Department of Computer Engineering and Informatics University of Patras 26500 Rio Greece

ISBN: (纸本)9781581131857

In this paper we consider communication issues arising in mobile networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the same geographical region can communicate simultaneously with other users of the network using distinct frequencies. The spectrum of available frequencies is limited; thus, efficient solutions to the frequency allocation and the call control problem are essential. In the frequency allocation problem, given users that wish to communicate, the objective is to minimize the required spectrum of frequencies so that communication can be established without signal interference. The objective of the call control problem is, given a spectrum of available frequencies and users that wish to communicate, to maximize the number of users served. We consider cellular, planar, and arbitrary network *** particular, we study the on-line version of both problems using competitive analysis. For frequency allocation in cellular networks, we improve the best known competitive ratio upper bound of 3 achieved by the folklore Fixed Allocation algorithm, by presenting an almost tight competitive analysis for the greedy algorithm; we prove that its competitive ratio is between 2.429 and 2.5. For the call control problem, we present the first randomized algorithm that beats the deterministic lower bound of 3 achieving a competitive ratio of 2.934 in cellular networks. Our analysis has interesting extensions to arbitrary networks. Also, using Yao's Minimax Principle, we prove two lower bounds of 1.857 and 2.086 on the competitive ratio of randomized call control algorithms for cellular and arbitrary planar networks, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A dynamic distributed video on demand service

A dynamic distributed video on demand service

引用

International Conference on Distributed Computing Systems

作者： C. Bouras V. Kapoulas A. Konidaris A. Sevasti Computer Engineering and Informatics Department University of Patras Rion Greece Computer Technology Institute Patras Greece

The use of Internet services has become part of everyday life. The need for more advanced applications is increasing and solutions have to be provided in order to meet it. Multimedia information is becoming more popular. The connection bandwidth is not yet ready to cope with rising expectations for applications such as video on demand (VoD). We propose a way to implement such a service over a limited bandwidth/best effort Internet based network. Our proposal consists of the implementation of algorithms and the introduction of quality of service features on a network such as the Internet that inherently does not support such features. We propose two techniques for the implementation of an Internet based video on demand service. The first deals with the distribution of video titles on several video servers and is called the Disk Manipulation Algorithm (DMA). The second gives a dynamic nature to the service, imposes a virtual routing procedure to the system and is called the Virtual Routing Algorithm (VRA).

关键词： Video on demand Web and internet services Bandwidth Electrical capacitance tomography High-speed networks Ethernet networks Cable TV Asynchronous transfer mode IP networks Routing

来源：评论

学校读者我要写书评

暂无评论

Test response compaction by an accumulator behaving as a multiple input non-linear feedback shift register

Test response compaction by an accumulator behaving as a mul...

引用

IEEE International Test Conference

作者： D. Bakalis D. Nikolos X. Kavousianos Department of Computer Engineering and Informatics University of Patras Rio Greece Computer Technology Institute Patras Greece

In this paper we show that an accumulator can be modified to behave as a Non-Linear Feedback Shift Register suitable for test response compaction. The hardware required for this modification is less than that required to modify a register to a Multiple Input Linear Feedback Shift Register, MISR. We show with experiments on ISCAS'85, ISCAS'89 benchmark circuits and various types of multipliers that the post-compaction fault coverage obtained by the proposed scheme is higher than that of the already known accumulator based compaction schemes and in most cases identical to that achieved using a MISR.

关键词： Compaction Feedback Circuit testing Adders Circuit faults Built-in self-test Hardware Shift registers informatics Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Low power BIST for Wallace tree-based multipliers

Low power BIST for Wallace tree-based multipliers

引用

IEEE International Symposium on Quality Electronic Design

作者： D. Bakalis E. Kalligeros D. Nikolos H.T. Vergos G. Alexiou Computer Technology Institute Patras Greece Department of Computer Engineering and Informatics University of Patras Rio Greece

The low power as a feature of a BIST scheme is a significant target due to quality as well as cost related issues. In this paper we examine the testability of multipliers based on Booth encoding and Wallace tree summation of the partial products and we present a methodology for deriving a low power Built In Self Test (BIST) scheme for them. We propose several design rules for designing the Wallace tree in order to be fully testable under the cell fault model. The proposed low power BIST scheme for the derived multipliers is achieved by: (a) introducing suitable Test Pattern Generators (TPG); (b) properly assigning the TPG outputs to the multiplier inputs; and (c) significantly reducing the test set length with respect to earlier schemes; Our results indicate that the total power dissipated during test can be reduced from 64.8% to 72.8%, while the average power per test vector can be reduced from 19.6% to 27.4% and the peak power dissipation can be reduced from 16.8% to 36.0%, depending on the implementation of the basic cells and the size of the multiplier. The test application time is also significantly reduced, while the introduced BIST scheme implementation area is small.

关键词： Built-in self-test Circuit testing Automatic testing Costs Power engineering computing Tellurium Power dissipation Switching circuits Power engineering and energy informatics

来源：评论

学校读者我要写书评

暂无评论

An information system for the effective management of ambulances

An information system for the effective management of ambula...

引用

Annual IEEE Symposium on computer-Based Medical Systems

作者： G. Derekenaris J. Garofalakis C. Makris J. Prentzas S. Sioutas A. Tsakalidis School of Engineering Department of Computer Engineering and Informatics University of Patras Rio Greece Computer Technology Institute Patras Greece

Describes a system offering a solution to the problem of ambulance management and emergency incident handling in the prefecture of Attica in Greece. It is based on a geographic information system (GIS) coupled with GPS (Global Positioning System) and GSM (Global System for Mobile Communication) technologies. The system's operation is expected to minimize the ambulances' response time. Consequently, there will be a drastic improvement in the way emergency incidents are being handled. This fact will thus significantly affect the quality of health services offered to citizens.

关键词： Management information systems Global Positioning System Geographic Information Systems GSM Satellite broadcasting Disaster management Hospitals Routing Military satellites Communications technology

来源：评论

学校读者我要写书评

暂无评论

A class of easily path delay fault testable circuits

A class of easily path delay fault testable circuits

引用

Southwest Symposium on Mixed-Signal Design, SSMSD 2000

作者： Haniotakis, T. Kalligeros, E. Nikolos, D. Sidiropulos, G. Tsiatouhas, Y. Vergos, H.T. Department of Computer Engineering and Informatics University of Patras 26 500 Greece Computer Technology Institute 3 Kolokotroni Str Patras262 21 Greece ISD S.A 22 K. Varnali Str Maroussi Athens152 33 Greece

ISBN: (纸本)0780359755

The number of physical paths in a carry save or modified Booth multiplier, as well as in a non-restoring cellular array divider is prohibitively large for testing all paths for delay faults. Besides, neither all paths are robustly testable nor a basis consisting of SPP-HFRT paths exists. In this paper we present sufficient modifications of the above mentioned circuits so that a basis consisting of SPP-HFRT paths exists. The cardinality of the derived basis is very small. Also, hardware and delay overheads due to the modifications are respectively small and negligible. © 2000 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 370 371 372 373 374 375 376 377 378 379 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：