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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

4,066 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,214 篇 工学
- 1,327 篇 计算机科学与技术...
- 1,081 篇 软件工程
- 510 篇 信息与通信工程
- 282 篇 生物医学工程（可授...
- 274 篇 生物工程
- 259 篇 控制科学与工程
- 244 篇 电气工程
- 243 篇 电子科学与技术（可...
- 232 篇 光学工程
- 188 篇 仪器科学与技术
- 162 篇 核科学与技术
- 147 篇 机械工程
- 101 篇 化学工程与技术
- 83 篇 动力工程及工程热...
- 69 篇 材料科学与工程（可...
1,764 篇 理学
- 900 篇 物理学
- 592 篇 数学
- 335 篇 生物学
- 203 篇 统计学（可授理学、...
- 133 篇 化学
- 132 篇 系统科学
- 92 篇 地球物理学
536 篇 管理学
- 328 篇 管理科学与工程(可...
- 225 篇 图书情报与档案管...
- 175 篇 工商管理
284 篇 医学
- 241 篇 临床医学
- 219 篇 基础医学(可授医学...
- 148 篇 药学(可授医学、理...
- 94 篇 公共卫生与预防医...
88 篇 法学
- 73 篇 社会学
68 篇 经济学
48 篇 教育学
44 篇 农学
12 篇 文学
6 篇 艺术学
3 篇 军事学

主题

141 篇 informatics
95 篇 artificial intel...
90 篇 hadron colliders
71 篇 machine learning
71 篇 computer network...
63 篇 higgs bosons
58 篇 wireless sensor ...
55 篇 quality of servi...
55 篇 computational mo...
54 篇 deep learning
52 篇 computer archite...
48 篇 protocols
47 篇 proton-proton in...
45 篇 bandwidth
44 篇 mobile communica...
43 篇 costs
42 篇 electronic mail
41 篇 routing
40 篇 image segmentati...
40 篇 resource managem...

机构

412 篇 department for p...
404 篇 faculty of scien...
398 篇 department of ph...
398 篇 kirchhoff-instit...
386 篇 department of ph...
385 篇 department of ph...
380 篇 institute of phy...
366 篇 fakultät für phy...
366 篇 institute of phy...
336 篇 instituto de fís...
306 篇 department of ph...
281 篇 department of ph...
280 篇 department of ph...
280 篇 graduate school ...
278 篇 dipartimento di ...
278 篇 nikhef national ...
270 篇 universidade fed...
267 篇 department of ph...
265 篇 ictp trieste
258 篇 yerevan physics ...

作者

334 篇 c. alexa
332 篇 j. m. izen
330 篇 g. bella
329 篇 d. calvet
329 篇 c. amelung
327 篇 j. strandberg
324 篇 g. spigo
323 篇 f. siegert
316 篇 r. ströhmer
316 篇 m. rijssenbeek
316 篇 s. jin
316 篇 g. gaudio
316 篇 s. mohapatra
307 篇 s. guindon
305 篇 a. kaczmarska
298 篇 j. schaarschmidt
297 篇 y. tayalati
289 篇 a. d. pilkington
286 篇 l. chevalier
281 篇 m. klein

语言

3,821 篇 英文
210 篇 其他
35 篇 中文
4 篇 日文
1 篇 德文

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

共 4066 条记录，以下是3341-3350 订阅

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

详细简洁

排序：

Efficient route planning in flight networks

Efficient route planning in flight networks

引用

9th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2009

作者： Delling, Daniel Pajor, Thomas Wagner, Dorothea Zaroliagis, Christos P.O. Box 6980 76128 Karlsruhe Germany R.A. Computer Technology Institute Patras University Campus N. Kazantzaki Str. 26504 Patras Greece Department of Computer Engineering and Informatics University of Patras 26500 Patras Greece

ISBN: (纸本)9783939897118

We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while modeling airport procedures in a realistic way. With these graphs, we are able to efficiently compute a set of best connections with multiple criteria over a full day. It even turns out that due to the very limited graph sizes it is feasible to precompute full distance tables between all airports. As a result, best connections can be retrieved in a few microseconds on real world data.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

Image-based automatic object localisation in iSpace environment

Image-based automatic object localisation in iSpace environm...

引用

10th International Symposium of Hungarian Researchers on Computational Intelligence and informatics, CINTI 2009

作者： Zanaty, Péter Korondi, Péter Sziebig, Gábor Jeni, László A. Department of Scientific Computing Narvik University College Electrical Engineering and Space technology Hungary Department of Mechatronics Budapest University of Technology and Economics Optics and Applied Informatics Hungary Computer and Automation Research Institute Japan Department of Industrial Engineering Narvik University College Norway Institute of Industrial Science University of Tokyo Japan

Localization is a fundamental task in mobile robotics and in indoor environments we can use various sensors to solve this problem. In the Intelligent Space environment we can use laser range finders or ultrasonic positioning systems to localize and track mobile robots. Nevertheless, our final goal is to substitute these sensors and accomplish this task using just cameras. In this paper, we show the feasibility of determining the robot's location based on the images received from a single camera. In our experimental room we used a surveillance camera, which can be controlled to pan/tilt in order to change the point of view. The camera had been mounted on the ceiling and six preset positions were selected to cover the whole area. The object recognition is based on colour space filtering and contour detection. Finally, the contours of the detected objects are transformed from the image space to the world coordinate system and the polygons are reduced to simpler ones. The system is able to detect not only the position of the objects, but their orientations.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Personalized News Search in WWW: Adapting on user's behavior

Personalized News Search in WWW: Adapting on user's behavior

引用

International Conference on Internet and Web Applications and Services (ICIW)

作者： Christos Bouras Vassilis Poulopoulos Panagiotis Silintziris Research Academic Computer Technology Institute Rio-Patras Greece Computer Engineering and Informatics Department Rio-Patras Greece

Personalized Web Search becomes nowadays a promising option in the field of Information Retrieval and search engines design by improving both output quality and user experience. In this paper, we present and evaluate the subsystem, which conducts the Advanced and Personalized search of PeRSSonal, a web-based mechanism for the retrieval, processing and presentation of articles and RSS feeds collected from major news portals of the Internet. The proposed technique uses information explicitly provided by the user in his profile as well as information that the mechanism can learn from the user's behavior during his search and browsing sessions in the system. As this behavior dynamically evolves, the same happens to the user's interests under the prism of the search engine. By adopting this user-centric approach, we manage to present the user with better-refined and more focused results, incorporating his personal preferences to the output. The algorithm operates not in a stand-alone manner but it co-operates and binds with the rest of modules of PeRSSonal in order to accomplish maximum integration with the system. Furthermore, we introduce an enhancement in the search function, based on cached results from past search sessions of each user individually.

关键词： Article search engine Personalized search PeRSSonal

来源：评论

学校读者我要写书评

暂无评论

An open and integrated management platform for wireless sensor networks

An open and integrated management platform for wireless sens...

引用

International Symposium on Autonomous Decentralized Systems (ISADAS)

作者： M. Kalochristianakis V. Gkamas G. Mylonas S. Nikoletseas E. Varvarigos J. Rolim Research Academic Computer Technology Institute Department of Computer Engineering and Informatics University of Patras Rio Greece Department of Computer Science University of Geneva Switzerland

We present the conceptual basis and the initial planning for an open source management architecture for wireless sensor networks (WSN). Although there is an abundance of open source tools serving the administrative needs of WSN deployments, there is a lack of tools or platforms for high level integrated WSN management. This is because of a variety of factors, including the lack of open source management tools, the immaturity of tools that offer manageability for WSNs, the limited high level management capabilities of sensor devices and architectures, and the lack of standardization. The current work is, to our knowledge, the first effort to conceptualize, formalize and design a remote, integrated management platform for the support of WSN research laboratories. The platform is based on the integration and extension of two innovative platforms: jWebDust, a WSN operation and management platform, and OpenRSM, an open source integrated remote systems and network management platform. The proposed system architecture can support several levels of integration (infrastructure management, functionality integration, firmware management), corresponding to different use-cases and application settings.

关键词： Wireless sensor networks computer architecture Remote monitoring computer network management Biomedical monitoring computerized monitoring computer networks Innovation management Microprogramming Application software

来源：评论

学校读者我要写书评

暂无评论

Capturing User Session Orientation Based on Semantic Analysis and Concept Taxonomy

Capturing User Session Orientation Based on Semantic Analysi...

引用

Balkan Conference in informatics (BCI)

作者： John Garofalakis Theodoula Giannakoudi Danai Vergeti Computer Engineering & Informatics Department University of Patras Patras Greece Research Academic Computer Technology Institute Patras Greece

In this work, we propose a Web personalization methodology by detecting the user navigation's orientation. To this goal, we track user's hits and define whether a user specializes or generalizes his navigation through semantics analysis of the pages in his session window. An algorithm of capturing user session orientation based on a concept taxonomy is proposed. Finally, a method is presented which proposes useful recommendation to the user to improve his Web search. The experimental outcomes satisfied the prospective results. We believe that our technique could become a useful tool for navigation refinement. Furthermore, this work bridges search engine query refinement and browsing reformulation techniques.

关键词： Taxonomy Search engines Navigation Web search Web pages informatics Semantic Web Information retrieval Ontologies Bridges

来源：评论

学校读者我要写书评

暂无评论

Cross layer optimization of static lightpath demands in transparent WDM optical networks

Cross layer optimization of static lightpath demands in tran...

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

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

We consider the offline version of the impairment-aware routing and wavelength assignment (IA-RWA) problem in transparent all-optical networks as a cross layer optimization problem. In optical networks and in the absence of regenerators, optical signal quality degrades due to physical layer impairments. We initially present an algorithm for solving the RWA problem based on an LP relaxation formulation that has acceptable integrality performance. To account for signal degradation due to physical layer impairments we extend our RWA formulation and constrain the interference among lightpaths using noise variance related parameters. The objective of the resulting optimization problem is not only to serve the connection requests by minimizing the number of utilized wavelengths, but also to select lightpaths that have acceptable physical layer performance.

关键词： Cross layer design Wavelength division multiplexing WDM networks Optical fiber networks Physical layer Repeaters Degradation Wavelength routing Wavelength assignment All-optical networks

来源：评论

学校读者我要写书评

暂无评论

Simulcast transmission for video applications: Performance evaluation with an integrated simulation environment

Simulcast transmission for video applications: Performance e...

引用

International Symposium on Performance Evaluation of computer & Telecommunication Systems SPECTS

作者： Christos Bouras Georgios Kioumourtzis Apostolos Gkamas Computer Engineering and Informatics Department University of Patras Rion Greece Research Academic Computer Technology Institute Rion Greece

This paper presents the performance evaluation of a multi-rate multicast protocol named adaptive smooth simulcast protocol (ASSP) for simulcast video transmission. ASSP implements a single rate TCP-friendly protocol as the underlying congestion control mechanism for each simulcast stream. ASSP is built on top of the RTP/RTCP protocol and exploits the RTCP sender and receiver reports for the dissemination of feedback information. The key attributes of ASSP are: a) TCP-friendly behavior, b) adaptive per-stream transmission rates, c) adaptive scalability to large sets of receivers and finally d) smooth transmission rates that are suitable for multimedia applications. We evaluate the performance of ASSP under an integrated simulation environment, which extends ns-2 and Evalvid-ra into the multicast domain with the use of RTP/RTCP protocols. Simulations conducted under this environment combine the measurements of network metrics along with objective evaluation criteria on the perceived video quality by the end user.

关键词： Streaming media Multicast protocols Computational modeling Proposals Transport protocols computer simulation Scalability Bandwidth Application software informatics

来源：评论

学校读者我要写书评

暂无评论

Load Balancing in a Cluster-Based P2P System

Load Balancing in a Cluster-Based P2P System

引用

Balkan Conference in informatics (BCI)

作者： John Garofalakis Theofanis-Aristofanis Michail Department of Computer Engineering & Informatics University of Patras Patras Greece Research Academic Computer Technology Institute Rio-Patras Greece

In this paper we study load balancing in a cluster based p2p system. The cluster based architecture is chosen after the study of various real systems. We then define the notion of load for that system and describe coefficients that measure the different parameters of load. We use these coefficients to define load factors that can be used to measure each node's load. These factors are also used in two algorithms that balance the load fairly among all peers in a cluster. We improve the algorithms' balancing performance using replication of popular objects. A set of metrics is used to evaluate the cost of each algorithm and the effect on system's performance. Our simulation results show that it is possible to improve the fairness on load distribution without replication but with a small reduce on system's throughput. And under the cost of replicating a small amount of objects we improve fairness without reducing system's throughput.

关键词： Load management Peer to peer computing Costs System performance Clustering algorithms Throughput Quality of service informatics computer architecture Measurement

来源：评论

学校读者我要写书评

暂无评论

On the Approximability of Dodgson and Young Elections 09

On the Approximability of Dodgson and Young Elections

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Ioannis Caragiannis Jason A. Coveyy Michal Feldmanz Christopher M. Homanx Christos Kaklamanis Nikos Karanikolask Ariel D. Procaccia Jeffrey S. Rosenscheinyy Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics University of Patras Department of Computer Science Rochester Institute of Technology School of Business Administration and Center forthe Study of Rationality The Hebrew University of Jerusalem Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics University of Patras Microsoft Israel R&D Center School of Computer Science and Engineering The He-brew University of Jerusalem

The voting rules proposed by Dodgson and Young are both designed to find the alternative closest to being a Condorcet winner, according to two different notions of proximity; the score of a given alternative is known to be hard to compute under either rule. In this paper, we put forward two algorithms for approximating the Dodgson score: an LP-based randomized rounding algorithm and a deterministic greedy algorithm, both of which yield an O(logm) approximation ratio, where m is the number of alternatives; we observe that this result is asymptotically optimal, and further prove that our greedy algorithm is optimal up to a factor of 2, unless problems in NP have quasi-polynomial time algorithms. Although the greedy algorithm is computationally superior, we argue that the randomized rounding algorithm has an advantage from a social choice point of view. Further, we demonstrate that computing any reasonable approximation of the ranking produced by Dodgson's rule is NP-hard. This result provides a complexity-theoretic explanation of sharp discrepancies that have been observed in the Social Choice Theory literature when comparing Dodgson elections with simpler voting rules. Finally, we show that the problem of calculating the Young score is NP-hard to approximate by any factor. This leads to an inapproximability result for the Young ranking.

关键词： greedy algorithm Nondeterministic polynomial-time hard Youth rounding Rule Vote algorithms

来源：评论

学校读者我要写书评

暂无评论

A Multicost Approach to Online Impairment-Aware RWA

A Multicost Approach to Online Impairment-Aware RWA

引用

IEEE International Conference on Communications (ICC)

作者： K. Christodoulopoulos K. Manousakis E. A. Varvarigos M. Angelou I. Tomkos Computer Engineering and Informatics Department and Research Academic Computer Technology Institute University of Patras Patras Greece Athens Information Technology Center Athens Greece

We design and implement a multicost impairment- aware routing and wavelength assignment algorithm for online traffic. In transparent optical networks the quality of a transmission degrades due to physical layer impairments. To serve a connection, the proposed algorithm finds a path and a free wavelength (a lightpath) that has acceptable signal quality performance by estimating a quality of transmission measure, called the Q factor. We take into account channel utilization in the network, which changes as new connections are established or released, in order to calculate the noise variances that correspond to physical impairments on the links. These, along with the time invariant eye impairment penalties of all candidate network paths, form the inputs to the algorithm. The multicost algorithm finds a set of so called non-dominated Q paths from the given source to the given destination. Various objective functions are then evaluated in order to choose the optimal lightpath to serve the connection. The proposed algorithm combines the strength of multicost optimization with low execution time, making it appropriate for serving online connections.

关键词： Algorithm design and analysis Wavelength routing Wavelength assignment Telecommunication traffic Optical fiber networks Degradation Physical layer Q measurement Wavelength measurement Q factor

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共407页 << < 331 332 333 334 335 336 337 338 339 340 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：