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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Extending QoS support from Layer 3 to Layer 2

Extending QoS support from Layer 3 to Layer 2

引用

International Conference on Telecommunications (ICT)

作者： C. Bouras V. Kapoulas V. Papapanagiotou L. Poulopoulos D. Primpas K. Stamos Computer Engineering and Informatics Department University of Patras Greece Research Academic Computer Technology Institute Greece Res. Acad. Comput. Technol. Inst. Rion

This paper presents some of the results obtained by the application of Ethernet layer 2 quality of service in IP networks. IP networks traditionally provide quality of service in Layer 3. However, since there is an enormous existing Layer 2 infrastructure, todaypsilas networks could benefit from the deployment of Layer 2 quality of service and the cooperation between layer 2 quality of service and layer 3 quality of service. In this paper, experiments are suggested and conducted and a scheme is suggested for efficient cooperation between Layer 2 and Layer 3 QoS provisioning.

关键词： Quality of service Jitter Ethernet networks IP networks Bandwidth Throughput Loss measurement

来源：评论

学校读者我要写书评

暂无评论

Performance validation of microarray analysis methods

Performance validation of microarray analysis methods

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： M. Zervakis M. E. Blazadonakis A. Banti D. Kafetzopoulos V. Danilatou M. Tsiknakis Department of Electronic and Computer Engineering Technical University of Crete Greece Institute of Molecular Biology and Biotechnology Foundation for Research and Technology Hellas FORTH USA Institute of Computer Science Biomedical Informatics Laboratory Foundation for Research and Technology Hellas FORTH USA

Following the rapid development of gene selection methods, several comparison studies have been reported for ranking methods on various datasets. In order to reduce bias in performance measures, most studies use an evaluation scheme based on cross-validation. In this paper we focus on the methodology of evaluation itself and address methodological problems using three representative algorithms on two public datasets. More specifically, the paper discusses the need of an independent test-set to reduce bias associated with cross-validation, the use of case specific considerations for generalization, as well as other measures that reflect stability and consistency of the result. Such measures reflect the influence of the actual dataset distribution on the performance of gene selection methods.

关键词： Performance analysis Filters Cancer Biomedical measurements Genomics Bioinformatics Stability Humans System testing Decision support systems

来源：评论

学校读者我要写书评

暂无评论

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Graph classes and the complexity of the graph orientation mi...

引用

Theory of Computing 2008 - 14th Computing: The Australasian Theory Symposium, CATS 2008

作者： Asahiro, Yuichi Miyano, Eiji Ono, Hirotaka Department of Social Information Systems Kyushu Sangyo University 2-3-1 Matsukadai Higashi-ku Fukuoka 813-8503 Japan Department of Systems Innovation and Informatics Kyushu Institute of Technology 680-4 Kawazu Iizuka Fukuoka 820-8502 Japan Department of Computer Science and Communication Engineering Kyushu University 744 Motooka Nishi-ku Fukuoka 819-0395 Japan Dept of Computer Sci and Eng University of Washington Seattle WA 98195-2350 United States

ISBN: (纸本)9781920682583

Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree in the resulted directed graph. The problem is called MMO, and is a restricted variant of the well-known minimum makespan problem. As previous studies, it is shown that MMO is in P for trees, weak NP-hard for planar bipartite graphs, and strong NP-hard for general graphs. There are still gaps between those graph classes. The objective of this paper is to show tight thresholds of complexity: We show that MMO is (i) in P for cactuses, (ii) weakly NP-hard for outerplanar graphs, and also (iii) strongly NP-hard for P4-bipartite graphs. The latter two are minimal superclasses of the former. Also, we show the NP-hardness for the other related graph classes, diamond-free, house-free, series-parallel, bipartite and planar. © 2008, Australian computer Society, Inc.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

A Robust Descriptor based on Weber's Law

A Robust Descriptor based on Weber's Law

引用

26th IEEE Conference on computer Vision and Pattern Recognition (CVPR 2008), vol.8

作者： Jie Chen Shiguang Shan Guoying Zhao Xilin Chen Wen Gao Matti Pietikainen School of Computer Science and Technology Harbin Institute of Technology Harbin China Machine Vision Group Department of Electrical and Information Engineering University of Oulu Finland Languages Informatics Systems and Software Engineering Department Faculty of Computer Science Chinese Academy and Sciences Beijing China

Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, Weber Local Descriptor (WLD). It is based on the fact that human perception of a pattern depends on not only the change of a stimulus (such as sound, lighting, et al.) but also the original intensity of the stimulus. Specifically, WLD consists of two components: its differential excitation and orientation. A differential excitation is a function of the ratio between two terms: One is the relative intensity differences of its neighbors against a current pixel;the other is the intensity of the current pixel. An orientation is the gradient orientation of the current pixel. For a given image, we use the differential excitation and the orientation components to construct a concatenated WLD histogram feature. Experimental results on Brodatz textures show that WLD impressively outperforms the other classical descriptors (e.g., Gabor). Especially, experimental results on face detection show a promising performance. Although we train only one classifier based on WLD features, the classifier obtains a comparable performance to state-of-the-art methods on MIT+CMU frontal face test set, AR face dataset and CMU profile test set.

关键词： Robustness Face detection Humans Content addressable storage Testing Psychology Laboratories Machine intelligence Information processing computers

来源：评论

学校读者我要写书评

暂无评论

System-wide peripheral biomarker discovery using information theory

引用

13th Pacific Symposium on Biocomputing, PSB 2008

作者： Alterovitz, Gil Xiang, Michael Liu, Jonathan Chang, Amelia Ramoni, Marco F. Division of Health Sciences and Technology Harvard University Massachusetts Institute of Technology Cambridge MA United States Childrens Hospital Informatics Program Boston MA 02115 United States Department of Electrical Engineering and Computer Science Cambridge MA 02139 United States Harvard Partners Center for Genetics and Genomics Harvard Medical School Boston 02115 United States Department of Biology Massachusetts Institute of Technology Cambridge MA 02139 United States

ISBN: (纸本)9812776087

The identification of reliable peripheral biomarkers for clinical diagnosis, patient prognosis, and biological functional studies would allow for access to biological information currently available only through invasive methods. Traditional approaches have so far considered aspects of tissues and biofluid markers independently. Here we introduce an information theoretic framework for biomarker discovery, integrating biofluid and tissue information. This allows us to identify tissue information in peripheral biofluids. We treat tissue-biofluid interactions as an information channel through functional space using 26 proteomes from 45 different sources to determine quantitatively the correspondence of each biofluid for specific tissues via relative entropy calculation of proteomes mapped onto phenotype, function, and drug space. Next, we identify candidate biofluids and biomarkers responsible for functional information transfer (p

关键词： Tissue

来源：评论

学校读者我要写书评

暂无评论

Small-Gain Conditions and Lyapunov Functions Applicable Equally to iISS and ISS Systems without Uniformity Assumption

Small-Gain Conditions and Lyapunov Functions Applicable Equa...

引用

2008 American Control Conference (ACC), vol.6

作者： Hiroshi 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 addresses the problem of verifying stability of the interconnection of integral input-to-state stable (iISS) systems. This paper strengthens a Lyapunov approach to the problem to the point where the necessity of a small-gain condition holds without technical assumptions such as uniformity and analyticity required by previous work. This paper unifies the treatment of iISS and input-to-state stable (ISS) systems, which has not been achieved by any previous technique of constructing Lyapunov functions. It is shown that iISS systems and ISS systems can share a common form of Lyapunov functions to characterize stability of their interconnection with respect to external signals. Global asymptotic stability is also discussed.

关键词： Lyapunov method Asymptotic stability Control systems Indium tin oxide Merging Signal analysis H infinity control Stability criteria Interconnected systems

来源：评论

学校读者我要写书评

暂无评论

Mining Top-K Closed Itemsets Using Best-First Search

Mining Top-K Closed Itemsets Using Best-First Search

引用

International Conference on computer and Information technology (CIT)

作者： Panida Songram Veera Boonjing Software Systems Engineering Laboratory Department of Mathematics and Computer Science Faculty of Science King Mongkut''s Institute of Technology Ladkrabang Bangkok Thailand Department of Computer Science Faculty of Informatics Mahasarakham University Maha sarakham Thailand

In this paper, we proposed an efficient algorithm, TOPK_CLOSED, for mining top-k closed itemsets. This algorithm mines top-k closed itemsets using best-first search. The closed itemsets with the highest supports are firstly found from this algorithm. Consequently, the method quickly finds top-k closed itemsets, which leads to an efficient pruning unnecessary itemsets and stop mining rapidly. In addition, this algorithm can generate closed itemsets without keeping candidates in main memory.

关键词： Itemsets Generators Data mining Pediatrics Complexity theory Algorithm design and analysis Databases

来源：评论

学校读者我要写书评

暂无评论

Supporting end-to-end resource virtualization for web 2.0 applications using service oriented architecture

Supporting end-to-end resource virtualization for web 2.0 ap...

引用

2008 IEEE Globecom Workshops, GLOBECOM 2008

作者： Papagianni, C. Karagiannis, G. Tselikas, N.D. Sfakianakis, E. Chochliouros, I.P. Kabilafkas, D. Cinkler, T. Westberg, L. SjÖdin, P. Hidell, M. De Groot, S. Heemstra Kontos, T. Katsigiannis, C. Pappas, C. Antonakopoulou, A. Venieris, I.S. School of Electrical and Computer Engineering National Technical University of Athens Greece CTIT and Department of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Netherlands Department of Telecommunications Science and Technology University of Peloponnese Greece Research Programs Section Labs and New Technologies Division ellenic Telecommunications Organization S.A. Switching and Services Laboratory Labs and New Technologies Division Hellenic Telecommunications Organization S.A. Greece Department of Telecommunications and Media Informatics Budapest University of Technology and Economics Hungary Ericsson Research Stockholm Sweden School of Information and Communication Technology Royal Institute of Technology Stockholm Sweden Twente Institute for Wireless and Mobile Communication Enschede Netherlands Siemens IT Solutions and Services Athens Greece

ISBN: (纸本)9781424430628

In recent years, technologies have been introduced offering a large amount of computing and networking resources. New applications such as Google AdSense and BitTorrent can profit from the use of these resources. An efficient way of discovering and reserving these resources is by using the Service Oriented Architecture (SOA) concept. SOA can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. This paper presents an architecture that can be used to support end-to-end resource virtualization for Web 2.0 applications and in particular for peer-to-peer applications by using the Service Oriented Architecture concept. © 2008 IEEE.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

Trust Management Framework for Efficient Service Provisioning in Dynamic Distributed Computing Environments

Trust Management Framework for Efficient Service Provisionin...

引用

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

作者： Malamati Louta Angelos Michalas Department of Information and Communication Technologies Engineering University of Western Macedonia Koza-gun Greece Department of Informatics and Computer Technology Technological Educational Institute of Western Macedonia Kastoria Greece

In dynamic distributed computing environments, system entities may be classified into two main categories that are, in principle, in conflict. These are the Service Resource Requestors (SRRs) wishing to use services and/or exploit resources offered by the other system entities and the Service Resource Providers (SRPs) that offer the services/resources requested. Seeking for the maximisation of their welfare, while achieving their own goals and aims, entities may misbehave (intentionally or unintentionally), thus, leading to a significant deterioration of system's performance. In this study, a reputation mechanism is proposed which helps estimating SRPs trustworthiness and predicting their future behaviour, taking into account their past performance in consistently satisfying SRRs' expectations. The reputation mechanism is distributed, considers both first-hand information (acquired from the SRR's direct past experiences with the SRPs) and second-hand information (disseminated from other SRRs' past experiences with the SRPs), while it exhibits a robust behaviour against inaccurate reputation ratings.

关键词： Environmental management Distributed computing Educational technology System performance Collaboration Intelligent sensors Web and internet services Conference management Authentication Authorization

来源：评论

学校读者我要写书评

暂无评论

Expression-Compensated 3D Face Recognition with Geodesically Aligned Bilinear Models

Expression-Compensated 3D Face Recognition with Geodesically...

引用

IEEE International Conference on Biometrics: Theory, Applications, and Systems (BTAS)

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

In this paper, we present a technique for addressing 3-dimensional face recognition in presence of facial expressions using a bilinear model. The bilinear model allows decoupling the impact of identity and expression on face appearance and encoding their contribution in separate control parameters. This is achieved by first representing faces as parametric surface models described by a fixed length parameter vector. A generic face model is fitted to each face based on a novel technique that relies on geodesic distances to find implicitly corresponding facial landmarks between the model and the face in hand. Model parameters are then used for bilinear decomposition. The experimental results on the publicly available BU-3DFE face database demonstrate the effectiveness of our technique.

关键词： Face recognition Deformable models Face detection Databases Iterative closest point algorithm Surface fitting Encoding Wavelet coefficients Nose Skin

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共397页 << < 333 334 335 336 337 338 339 340 341 342 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：