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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是3631-3640 订阅

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

详细简洁

排序：

A future location-prediction replacement strategy for mobile computing environments

A future location-prediction replacement strategy for mobile...

引用

IEEE Conference on Wireless Communications and Networking

作者： S. Drakatos N. Pissinou Kia Makki C. Douligeris Telecommunication and Information Technology Institute Department of Electrical and Computer Engineering Florida International University Miami FL USA Department of Informatics University of Piraeus Piraeus Greece

While the traditional data shipping systems use physical information to organize data, a newer data caching technique maintains both associated answers (data items) of previous queries and their meaning (purpose). This form of information description is called semantic description, and it makes it possible to reason about and derive knowledge from the given description. In a distributed heterogeneous environment, such as the mobile environment, the semantic data caching paradigm is an important technique for improving the performance of wireless data dissemination systems. Data caching performance depends heavily on the replacement policy being used for the cache management. However, future location ambiguity, limited client resources and frequent client disconnections make cache management a challenge. This paper proposes a future location-aware cache replacement policy to manage a semantic cache. The proposed replacement policy uses the validity of the data fetched from the server and the neighboring locations to decide which of the cache entries is less likely to be needed in the future, and therefore, a good candidate to be evicted when cache space is needed. The replacement policy's preference for cached items to be evicted is modelled as a general function that declines with distance between the cell the candidate for replacement's cached item is bounded to and the query's bound cell. For better efficiency the overall replacement granularity is dynamically achieved along three levels: ring, cell and data item. Simulation study of the proposed approach shows that it outperforms both the least recently used (LRU) and furthest away replacement (FAR) schemes, where only temporal locality is considered. Moreover, the proposed scheme is easier to implement than the industry standard policies

关键词： Mobile computing Bandwidth Physics computing Telecommunication computing Resource management Information systems Information technology informatics Costs Availability

来源：评论

学校读者我要写书评

暂无评论

On necessary conditions for stability of interconnected iISS systems

On necessary conditions for stability of interconnected iISS...

引用

American Control Conference (ACC)

作者： H. Ito Zhong-Ping Jiang Department of Systems Innovation and Informatics Kyushu Institute of Technology Fukuoka Japan Department of Electrical and Computer Engineering Six Metrotech Center Polytechnic University Brooklyn NY USA

This paper investigates necessary conditions for stability of nonlinear systems made of feedback interconnection of two iISS subsystems. The integral input-to-state stability (iISS) is a dissipative property which includes the input-to-state stability (ISS) as a special case. It is proved that at least one subsystem needs to be ISS for global asymptotic stability of the feedback loop when two subsystems are not completely specified and only their supply rates are available. In contrast, the situation where ODEs describing subsystems are available does not exclude pairs of subsystems which are only iISS. This paper further investigates necessary conditions for global asymptotic stability, and proves that the nonlinear small-gain condition is necessary in the case of unspecified iISS subsystems described with supply rates. When one of the two subsystems is given as a specific ODE, the nonlinear small-gain condition is no longer necessary, while the linear small-gain condition is necessary in the case of linear systems. For nonlinear systems, the necessity recovers only if the supply rate fits the known subsystem tightly in the shape as well as the magnitude

关键词： Nonlinear systems Interconnected systems Asymptotic stability Indium tin oxide Feedback loop Robust control Linear systems Shape Control theory Nonlinear control systems

来源：评论

学校读者我要写书评

暂无评论

Expression Compensation for Face Recognition Using a Polar Geodesic Representation

Expression Compensation for Face Recognition Using a Polar G...

引用

International Symposium on 3D Data Processing Visualization and Transmission

作者： Iordanis Mpiperis Sotiris Malassiotis Michael G. Strintzis Centre for Research and Technology Hellas Informatics and Telematics Institute Thessaloniki Greece Information Processing Laboratory Electrical and Computer Engineering Department Aristotle University of Thessaloniki Thessaloniki Greece

This paper addresses the problem of face recognition in the presence of facial deformations caused by expressions. An isometric mapping between surfaces is assumed, which allows preservation of geodesic distance between facial points. Subject to this assumption, we propose a novel technique which integrates 2D and 3D information to establish a new deformation invariant representation of the face. The 3D surface is used to define a polar geodesic coordinate space which is independent of the intrinsic geometry of the face. The corresponding color image is embedded in this space and serves as the recognition data. A preceding stage of hierarchical diffeomorphic grid-based image warping before the recognition process combined with a lip segmentation technique are also employed to increase the overall performance of the algorithm.

关键词： Face recognition Image recognition Geophysics computing Color Humans Face detection Multidimensional systems Geometry Image segmentation Biometrics

来源：评论

学校读者我要写书评

暂无评论

Introducing CPU Time as a Scarce Resource in P2P Systems to Achieve Fair Use in a Distributed DNS

Introducing CPU Time as a Scarce Resource in P2P Systems to ...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Thomas Bocek David Hausheer Reinhard Riedl Burkhard Stiller Communication Systems Group Department of Informatics IFI University of Zurich Switzerland Information Systems Group Department of Informatics IFI University of Zurich Switzerland Computer Engineering and Networks Laboratory TIK Swiss Federal Institute of Technology Switzerland

Peer-to-peer (P2P) systems are flexible, robust, and self-organizing resource sharing infrastructures which are typically designed in a fully decentralized manner. However, a key problem of such systems are peers overusing a resource. This paper presents a fully decentralized scheme to achieve fair use in P2P systems, which does not require a priori information about a peer. The approach developed is based on a scarce resource trading scheme (SRTCPU), which utilizes CPU time as a form of payment. SRTCPU provides an incentive to offer CPU time in return of consuming a scarce resource. A distributed DNS has been implemented as an example application that uses SRTCPU.

关键词： Peer to peer computing Resource management Central Processing Unit Robustness informatics Grid computing Large-scale systems Information systems computer networks Distributed computing

来源：评论

学校读者我要写书评

暂无评论

The influence of MIMO terminal user's hand on channel capacity

The influence of MIMO terminal user's hand on channel capaci...

引用

European Conference on Antennas and Propagation, EuCAP

作者： T. Zervos A. Alexandridis K. Peppas F. Lazarakis K. Dangakis C. Soras B. Lindmark Department of Electrical & Computer Engineering University of Patras Patras Greece Institute of Informatics & Telecommunications National Centre for Scientific Research Athens Greece Department of Signals Sensors and Systems Royal Institute of Technology Stockholm Sweden

In this paper the impact of user's hand holding a multiple-input-multiple-output (MIMO) terminal on the system performance is investigated. A 4times4 MIMO system is considered with a personal digital assistant (PDA) terminal equipped with a compact array of 4 patch elements. The radiation patterns of the antenna elements are simulated in the presence of the other elements and in the presence of a user's hand. The obtained patterns are used to evaluate the covariance matrix of the receive antenna which is incorporated in a correlation-based MIMO channel model. MIMO channel capacity is calculated to demonstrate the capacity degradation caused by the user's hand.

关键词： MIMO Channel capacity Personal digital assistants Antenna radiation patterns Mobile antennas System performance Impedance Biological tissues Humans Frequency

来源：评论

学校读者我要写书评

暂无评论

Discount Anonymous On Demand Routing for Mobile Ad hoc Networks

Discount Anonymous On Demand Routing for Mobile Ad hoc Netwo...

引用

International Conference on Security and Privacy for Emerging Areas in Communications Networks (SecureComm)

作者： Liu Yang Markus Jakobsson Susanne Wetzel Software Engineering College Sichuan University Chengdu China School of Informatics Indiana University Bloomington Bloomington IN USA Department of Computer Science Stevens Institute of Technology Hoboken NJ USA

Recent years have seen a large number of proposals for anonymity mechanisms operating on the application layer. Given that anonymity is no stronger than its weakest link, such proposals are only meaningful if one can offer anonymity guarantees on the communication layer as well. ANODR - or anonymous on demand routing - is one of the leading proposals to deal with this issue. In this paper, we propose a novel technique to address the same problem, but at a lower cost. Our proposal, which we dub discount-ANODR, is built around the same set of techniques as ANODR is. Our proposal has the benefit of achieving substantially lower computation and communication complexities at the cost of a slight reduction of privacy guarantees. In particular, discount-ANODR achieves source anonymity and routing privacy. A route is "blindly generated" by the intermediaries on the path between an anonymous source and an identified destination. Route requests in discount-ANODR bear strong similarities to route requests in existing source routing protocols, with the limitation that intermediaries only know the destination of the request and the identity of the previous intermediary - but not whether the latter was the originator of the request. The response to a route request protects the compiled route by means of iterated symmetric encryption, drawing on how messages are prepared before being submitted to a typical synchronous mix network (or onion router). The communication of data subsequently uses such "route onions" to channel the packet to the intended destination. We do not use any key exchange, nor do we utilize public key operations at any time; consequently, we do not need to rely on any PKI, CRL or related constructions

关键词： Mobile ad hoc networks Proposals Costs Privacy Mobile communication Complexity theory Routing protocols Protection Cryptography Public key

来源：评论

学校读者我要写书评

暂无评论

Chunking Japanese Compound Functional Expressions by Machine Learning

Chunking Japanese Compound Functional Expressions by Machine...

引用

2006 Workshop on Multi-Word-Expressions in a Multilingual Context, MWE 2006

作者： Tsuchiya, Masatoshi Shime, Takao Takagi, Toshihiro Utsuro, Takehito Uchimoto, Kiyotaka Matsuyoshi, Suguru Sato, Satoshi Nakagawa, Seiichi Computer Center Toyohashi University of Technology Tenpaku-cho Toyohashi441-8580 Japan Department of Information and Computer Sciences Toyohashi University of Technology Tenpaku-cho Toyohashi441-8580 Japan Graduate School of Informatics Kyoto University Sakyo-ku Kyoto606-8501 Japan Graduate School of Systems and Information Engineering University of Tsukuba 1-1-1 Tennodai Tsukuba305-8573 Japan National Institute of Information and Communications Technology 3-5 Hikaridai Seika-cho Soraku-gun Kyoto619-0289 Japan Graduate School of Engineering Nagoya University Furo-cho Chikusa-ku Nagoya464-8603 Japan

The Japanese language has various types of compound functional expressions, which are very important for recognizing the syntactic structures of Japanese sentences and for understanding their semantic contents. In this paper, we formalize the task of identifying Japanese compound functional expressions in a text as a chunking problem. We apply a machine learning technique to this task, where we employ that of Support Vector Machines (SVMs). We show that the proposed method significantly outperforms existing Japanese text processing tools. © EACL 2006 - 11th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Workshop on Multi-Word-Expressions in a Multilingual Context, MWE 2006. All rights reserved.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Graph orientation algorithms to minimize the maximum outdegree 06

Graph orientation algorithms to minimize the maximum outdegr...

引用

Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51

作者： Yuichi Asahiro Eiji Miyano Hirotaka Ono Kouhei Zenmyo Department of Social Information Systems Kyushu Sangyo University Fukuoka Japan Department of Systems Innovation and Informatics Kyushu Institute of Technology Fukuoka Japan Department of Computer Science and Communication Engineering Kyushu University Fukuoka Japan

ISBN: (纸本)9781920682330

We study the problem of orienting the edges of a weighted graph such that the maximum weighted out-degree of vertices is minimized. This problem, which has applications in the guard arrangement for example, can be shown to be NP-hard generally. In this paper we first give optimal orientation algorithms which run in polynomial time for the following special cases: (i) the input is an unweighted graph, or more generally, a graph with identically weighted edges, and (ii) the input graph is a tree. Then, by using those algorithms as sub-procedures, we provide a simple, combinatorial, min{wmax/wmin, (2-ε)}-approximation algorithm for the general case, where wmax and wmin are the maximum and the minimum weights of edges, respectively, and ε is some small positive real number that depends on the input.

关键词： approximation algorithms graph orientation min-max optimization NP-hardness

来源：评论

学校读者我要写书评

暂无评论

Evaluation of a Network Extraction Topology Algorithm for Reducing Search Space of a GA-based Routing Approach

Evaluation of a Network Extraction Topology Algorithm for Re...

引用

International Conference on Distributed Computing Systems Workshop

作者： M. Ikeda L. Barolli G. De Marco A. Durresi A. Koyama M. Durresi Graduate School of Engineering Fukuoka Institute of Technology (FIT) Higashi-ku Japan Department of Information and Communication Engineering Fukuoka Institute of Technology (FIT) Higashi-ku Japan Department of Computer Science Louisiana State University Baton Rouge Louisiana USA Department of Informatics Yamagata University Yonezawa Japan

In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for admission control of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. The proposed routing algorithm is a combination of source and distributed routing. However, in the previous research, we only considered the time delay for the routing. Also, QoS and congestion control parameters were considered just as indicators of QoS satisfication and congestion. In this work, we extend our previous work by proposing and implementing new algorithms based on fuzzy logic and genetic algorithm which use for admission control and routing many QoS parameters. Also, we evaluate by simulations the performance of the network extraction topology algorithm which reduces the search space of the proposed GA-based routing approach. Thus, the GA can find a feasible route very fast.

关键词： Network topology Routing Quality of service Space technology Admission control Fuzzy logic Broadband communication Multimedia communication Video on demand Scalability

来源：评论

学校读者我要写书评

暂无评论

Generalised Weighted Relevance Aggregation Operators for Hierarchical Fuzzy Signatures

Generalised Weighted Relevance Aggregation Operators for Hie...

引用

International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce

作者： B. S. U. Mendis T. D. Gedeon J. Botzheim L. T. Koczy Department of Computer Science Australian National University Canberra Australia College of Engineering and Computer Science Australian National University Canberra Australia Department of Telec. & Media Informatics Budapest University of Technology and Economics Budapest Hungary Institute of Information Tech and Elec. Engineering Széchenyi István University Gyor Hungary

Hierarchical Fuzzy Signatures are generalizations of the Vector Valued Fuzzy Set concept introduced in the 1970s. A crucial question in the Fuzzy Signature context is what kinds of aggregations are applicable for combining data with partly different substructures. Our earlier work introduced the Weighted Relevance Aggregation method to enhance the accuracy of the final results of calculations based on Hierarchical Fuzzy Signature Structures. In this paper, we further generalise the weights and the aggregation into a new operator called Weighted Relevance Aggregation Operator (WraO). WraO enhances the adaptability of the fuzzy signature model to different applications and simplifies the learning of fuzzy signature models from data. We also show the methodology of learning these aggregation operators from data.

关键词： Fuzzy sets computer science Computational intelligence Educational institutions informatics Humans Problem-solving Skeleton Medical diagnostic imaging Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共407页 << < 360 361 362 363 364 365 366 367 368 369 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：