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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,237 篇 会议
193 篇 期刊文献
36 册 图书

馆藏范围

1,466 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

932 篇 工学
- 781 篇 计算机科学与技术...
- 675 篇 软件工程
- 211 篇 信息与通信工程
- 105 篇 控制科学与工程
- 99 篇 生物工程
- 60 篇 生物医学工程（可授...
- 59 篇 电气工程
- 46 篇 电子科学与技术（可...
- 39 篇 安全科学与工程
- 37 篇 光学工程
- 32 篇 机械工程
- 28 篇 交通运输工程
- 27 篇 动力工程及工程热...
- 27 篇 建筑学
- 24 篇 土木工程
384 篇 理学
- 230 篇 数学
- 107 篇 生物学
- 71 篇 统计学（可授理学、...
- 55 篇 物理学
- 47 篇 系统科学
288 篇 管理学
- 166 篇 管理科学与工程(可...
- 142 篇 图书情报与档案管...
- 96 篇 工商管理
55 篇 医学
- 53 篇 临床医学
- 51 篇 基础医学(可授医学...
- 34 篇 药学(可授医学、理...
- 23 篇 公共卫生与预防医...
54 篇 法学
- 37 篇 社会学
33 篇 教育学
- 33 篇 教育学
32 篇 经济学
- 32 篇 应用经济学
18 篇 农学
2 篇 文学
2 篇 军事学
1 篇 艺术学

主题

51 篇 software
49 篇 software enginee...
36 篇 feature extracti...
34 篇 machine learning
33 篇 computer science
31 篇 accuracy
30 篇 computational mo...
28 篇 deep learning
28 篇 semantics
26 篇 real-time system...
25 篇 artificial intel...
25 篇 training
20 篇 wireless sensor ...
20 篇 data models
19 篇 scalability
19 篇 support vector m...
19 篇 data mining
18 篇 internet of thin...
18 篇 computer archite...
18 篇 quality of servi...

机构

19 篇 faculty of compu...
19 篇 gik institute of...
19 篇 university of eu...
19 篇 dept. of technol...
17 篇 dept. of compute...
16 篇 dept. of compute...
14 篇 dept. of softwar...
13 篇 dept. of compute...
12 篇 dept. of compute...
12 篇 dept. of compute...
11 篇 bcmaterials basq...
11 篇 state key labora...
11 篇 bcmaterials basq...
10 篇 college of compu...
10 篇 dept. of compute...
8 篇 daffodil interna...
8 篇 faculty of elect...
8 篇 school of softwa...
8 篇 dept. of compute...
7 篇 state key labora...

作者

19 篇 ku wei-shinn
19 篇 ali raja hashim
19 篇 raja hashim ali
16 篇 usama arshad
16 篇 arshad usama
15 篇 baldwin timothy
14 篇 zain ul abideen
12 篇 shiri nematollaa...
11 篇 buyya rajkumar
10 篇 ali zeeshan ijaz
8 篇 qusay h. mahmoud
8 篇 baik doo-kwon
8 篇 cho seong-je
8 篇 nisar ali
8 篇 shafiur rahman
8 篇 ali nisar
8 篇 ijaz ali zeeshan
7 篇 siddique abu bak...
7 篇 ul abideen zain
7 篇 abideen zain ul

语言

1,319 篇 英文
135 篇 其他
5 篇 中文
4 篇 朝鲜文
3 篇 日文

检索条件"机构=Dept. of Computer Science& Software Engineering"

共 1466 条记录，以下是1101-1110 订阅

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

详细简洁

排序：

Towards the development of an autonomic network management architecture

Towards the development of an autonomic network management a...

引用

2009 4th International Conference on Communications and Networking in China, CHINACOM 2009

作者： Strassner, John Hong, James Won-Ki Telecommunications Systems and Software Group Waterford Institute of Technology Carriganore County Waterford Ireland Dept. of Computer Science and Engineering Pohang University of Science and Technology Pohang Korea Republic of

ISBN: (纸本)9781424443376

The current Internet did not define any inherent management constructs and mechanisms;such concepts were added after networking standards and architectures were constructed. This also influenced network management for other types of networks. This paper is the first in a series that explores concepts for a new autonomic approach to network management that can be used for current and next generation networks as well as for the Future Internet.

关键词： Next generation networks

来源：评论

学校读者我要写书评

暂无评论

Integrating visual and semantic contexts for topic network generation and word sense disambiguation 09

Integrating visual and semantic contexts for topic network g...

引用

ACM International Conference on Image and Video Retrieval, CIVR 2009

作者： Fan, Jianping Luo, Hangzai Shen, Yi Yang, Chunlei Dept. of Computer Science UNC-Charlotte Charlotte NC 28223 United States Software Engineering Institute East China Normal University Shanghai 200062 China

ISBN: (纸本)9781605584805

To support more effective searches in large-scale weakly-tagged image collections, we have developed a novel algorithm to integrate both the visual similarity contexts between the images and the semantic similarity contexts between their tags for topic network generation and word sense disambiguation. First, a topic network is generated to characterize both the semantic similarity contexts and the visual similarity contexts between the image topics more sufficiently. By organizing large numbers of image topics according to their cross-modal inter-topic similarity contexts, our topic network can make the semantics behind the tag space more explicit, so that users can gain deep insights rapidly and formulate their queries more precisely. Second, our word sense disambiguation algorithm can integrate the topic network to exploit both the visual similarity contexts between the images and the semantic similarity contexts between their tags for addressing the issues of polysemes and synonyms more effectively, thus it can significantly improve the precision and recall rates for image retrieval. Our experiments on large-scale Flickr and LabelMe image collections have provided very positive results. Copyright 2009 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Facial caricature generation using a quadratic deformation model

Facial caricature generation using a quadratic deformation m...

引用

International Conference on Advances in computer Entertainment Technology, ACE 2009

作者： Obaid, M. Lond, D. Mukundan, R. Billinghurst, M. HITLab. New Zealand University of Canterbury Christchurch New Zealand Computer Science and Software Engineering Dept. University of Canterbury New Zealand Dept. of Mathematics and Statistics University of Canterbury New Zealand

ISBN: (纸本)9781605588643

In this paper we propose a novel approach for generating expressive caricatures from an input image. The novelty of this work comes from combining an Active Appearance Model facial feature extraction system with a quadratic deformation model representation of facial expressions. The extracted features are deformed using the quadratic deformation parameters, resulting in an expressive caricature. The facial feature extraction requires an offline training process which uses natural expression annotated images from 30 model subjects, selected randomly from the Cohn-Kanade Database. The results show that from an input facial image, expressive caricatures are generated for the main six face expressions (smile, sad, fear, surprise, disgust, and anger). The proposed approach yields to promising expressive caricatures, and could lead to future research directions in the field of non-photorealistic rendering. In addition, the proposed approach can be employed in entertaining standalone applications or caricature animations. © ACM 2009.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised learning using label mean 09

Semi-Supervised learning using label mean

引用

26th Annual International Conference on Machine Learning, ICML'09

作者： Yu-Feng, Li Kwok, James T. Zhi-Hua, Zhou National Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Dept. Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Hong Kong Hong Kong

ISBN: (纸本)9781605585161

Semi-Supervised Support Vector Machines(S3VMs) typically directly estimate the label assignments for the unlabeled instances. This is often inefficient even with recent advances in the efficient training of the (supervised) SVM. In this paper, we show that S3VMs, with knowledge of the means of the class labels of the unlabeled data, is closely related to the supervised SVM with known labels on all he unlabeled data. This motivates us to first estimate the label means of the unlabeled data. Two versions of the meanS3VM, which work by maximizing the margin between the label means, are proposed. The first one is based on multiple kernel learning, while the second one is based on alternating optimization. Experiments show that both of the proposed algorithms achieve highly competitive and sometimes even the best performance as compared to the state-of-the-art semi-supervised learners. Moreover, they are more efficient than existing *** 2009.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised learning using label mean

Semi-supervised learning using label mean

引用

26th International Conference On Machine Learning, ICML 2009

作者： Li, Yu-Feng Kwok, James T. Zhou, Zhi-Hua National Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Dept. Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Hong Kong Hong Kong

ISBN: (纸本)9781605585161

Semi-Supervised Support Vector Machines (S3VMs) typically directly estimate the label assignments for the unlabeled instances. This is often inefficient even with recent advances in the efficient training of the (supervised) SVM. In this paper, we show that S3VMs, with knowledge of the means of the class labels of the unlabeled data, is closely related to the supervised SVM with known labels on all the unlabeled data. This motivates us to first estimate the label means of the unlabeled data. Two versions of the mean S3VM, which work by maximizing the margin between the label means, are proposed. The first one is based on multiple kernel learning, while the second one is based on alternating optimization. Experiments show that both of the proposed algorithms achieve highly competitive and sometimes even the best performance as compared to the state-of-the-art semi-supervised learners. Moreover, they are more efficient than existing S3VMs.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Face image modeling by multilinear subspace analysis with missing values 09

Face image modeling by multilinear subspace analysis with mi...

引用

17th ACM International Conference on Multimedia, MM'09, with Co-located Workshops and Symposiums

作者： Geng, Xin Smith-Miles, Kate Zhou, Zhi-Hua Wang, Liang School of Mathematical Sciences Monash University VIC 3800 Australia School of Computer Science and Engineering Southeast University Nanjing 210096 China National Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China Dept. of Computer Science and Software Eng. University of Melbourne VIC 3010 Australia

ISBN: (纸本)9781605586083

The main difficulty in face image modeling is to decompose those semantic factors contributing to the formation of the face images, such as identity, illumination and pose. One promising way is to organize the face images in a higher-order tensor with each mode corresponding to one contributory factor. Then, a technique called Multilinear Subspace Analysis (MSA) is applied to decompose the tensor into the mode-n product of several mode matrices, each of which represents one semantic factor. In practice, however, it is usually difficult to obtain such a complete training tensor since it requires a large amount of face images with all possible combinations of the states of the contributory factors. To solve the problem, this paper proposes a method named M2SA, which can work on the training tensor with massive missing values. Thus M2SA can be used to model face images even when there are only a small number of face images with limited variations which will cause missing values in the training tensor). Experiments on face recognition show that M2SA can work reasonably well with up to 70% missing values in the training tensor. Copyright 2009 ACM.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

LITSEEK: Public health Literature Search by metadata enhancement with External Knowledge bases

LITSEEK: Public health Literature Search by metadata enhance...

引用

3rd ACM International Workshop on Data and Text Mining in Bioinformatics, DTMBIO'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009

作者： Prabhu, Priyanka Sharad Navathe, Shamkant B. Tyler, Stephen Dasigi, Venu Narkhede, Neha Palanisamy, Balaji College of Computing Georgia Institute of Technology Atlanta GA 30332-0280 United States Dept. of Computer Science and Software Engineering Southern Polytechnic State University Marietta GA 30060-2855 United States

ISBN: (纸本)9781605588032

Biomedical literature is an important source of information in any researcher's investigation of genes, risk factors, diseases and drugs. Often the information searched by public health researchers is distributed across multiple disparate sources that may include publications from PubMed, genomic, proteomic and pathway databases, gene expression and clinical resources and biomedical ontologies. The unstructured nature of this information makes it difficult to find relevant parts from it manually and comprehensive knowledge is further difficult to synthesize automatically. In this paper we report on LITSEEK (LITerature Search by metadata Enhancement with External Knowledgebases), a system we have developed for the benefit of researchers at the Centers for Disease Control (CDC) to enable them to search the HuGE (Human Genome for Epidemiology) database of PubMed articles, from a pharmacogenomic perspective. Besides analyzing text using TFIDF ranking and indexing of the important terms, the proposed system incorporates an automatic consultation with PharmGKB - a human-curated knowledge base about drugs, related diseases and genes, as well as with the Gene Ontology, a human-curated, well accepted ontology. We highlight the main components of our approach and illustrate how the search is enhanced by incorporating additional concepts in terms of genes/drugs/diseases (called metadata for ease of reference) from PharmGKB. Various measurements are reported with respect to the addition of these metadata terms. Preliminary results in terms of precision based on expert user feedback from CDC are encouraging. Further evaluation of the search procedure by actual researchers is under way. Copyright 2009 ACM.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Asymmetric group key agreement

Asymmetric group key agreement

引用

28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2009

作者： Qianhong, Wu Yi, Mu Susilo, Willy Bo, Qin Domingo-Ferrer, Josep Universitat Rovira i Virgili Dept. of Comp. Eng. and Maths UNESCO Department of Data Privacy Tarragona Catalonia Spain Key Lab. of Aerospace Information Security and Trusted Computing School of Computer Wuhan University China Centre for Computer and Information Security Research School of Computer Science and Software Engineering University of Wollongong Australia Dept. of Maths School of Science Xi'an University of Technology China

ISBN: (纸本)3642010008

A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish a confiDential channel among group members, we revisit the group key agreement definition and distinguish the conventional (symmetric) group key agreement from asymmetric group key agreement (ASGKA) protocols. Instead of a common secret key, only a shared encryption key is negotiated in an ASGKA protocol. This encryption key is accessible to attackers and corresponds to different decryption keys, each of which is only computable by one group member. We propose a generic construction of one-round ASGKAs based on a new primitive referred to as aggregatable signaturebased broadcast (ASBB), in which the public key can be simultaneously used to verify signatures and encrypt messages while any signature can be used to decrypt ciphertexts under this public key. Using bilinear pairings, we realize an efficient ASBB scheme equippe d with useful properties. Following the generic construction, we instantiate a one-round ASGKA protocol tightly reduced to the decision Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. © International Association for Cryptologic Research 2009.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Reasoning Intra-Dependency in Commitments for Robust Scheduling 09

Reasoning Intra-Dependency in Commitments for Robust Schedul...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Mingzhong Wang Kotagiri Ramamohanarao Jinjun Chen Dept. of Computer Science and Software Engineering The University of Melbourne Faculty of ICT Swinburne University of Technology

ISBN: (纸本)9781615673346

Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considering the active role of agents in them. Therefore, in this paper we propose to augment agents with the ability of reasoning about and manipulating their commitments to maximize the system utility. We adopt a bottom-up approach by first investigating the intra-dependency between each commitment's preconditions and result which leads to a novel classification of commitments as well as a formalism to express various types of complex commitment. Within this framework, we provide a set of inference rules to benefit an agent by means of commitment refactoring which enables composition and/or decomposition of its commitments to optimize runtime performance. We also discuss the pros and cons of an agent scheduling and executing its commitments in parallel. We propose a reasoning strategy and an algorithm to minimize possible loss when the commitment is broken and maximize the overall system robustness and performance. Experiments show that concurrent schedules based on the features of commitments can boost the system performance significantly.

关键词： Design Reliability Performance Commitment machines Commitment refactoring Agent interaction Robustness Scheduling

来源：评论

学校读者我要写书评

暂无评论

A New Method to Generate Attack Graphs

A New Method to Generate Attack Graphs

引用

2009 Third IEEE International Conference on Secure Integration and Reliability Improvement SSIRI 2009(第三届IEEE安全软件集成及可信性改进国际会议)

作者： Anming Xie Guodong Chen Yonggang Wang Zhong Chen Jianbin Hu Institute of Software School of Electronics Engineering and Computer Science Peking University Be Dept. Of Electronic Engineering The First Aeronautical College of Air Force China Institute of Software School of Electronics Engineering and Computer Science Peking University Be Institute of Software School of Electronics Engineering and Computer Science Peking University Be Institute of Software School of Electronics Engineering and Computer Science Peking University Be

ISBN: (纸本)9780769537580

To address the scalability problem in attack graphs generation, we propose a novel method to generate attack graphs automatically. Our approach constructs a two-tier attack graph framework, which includes a host access graph and some sub-attack graphs. A subattack graph describes concrete attack scenarios from one source host to one target host, while the host access graph describes the attacker's privilege transition among hosts. Our sub-attack graphs and host access graph have remarkable smaller scales and can help network administrators to find the key hosts in attack sequences. Analysis shows that the upper bound computational cost of our model is O(N3), which could also be competed in real time. The following experiment validates our approach.

关键词： network security attack graphs host access graph sub-attack graph

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共147页 << < 107 108 109 110 111 112 113 114 115 116 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：