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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

330 篇 会议
113 篇 期刊文献

馆藏范围

443 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

306 篇 工学
- 191 篇 计算机科学与技术...
- 163 篇 软件工程
- 88 篇 信息与通信工程
- 78 篇 电子科学与技术（可...
- 43 篇 控制科学与工程
- 39 篇 电气工程
- 28 篇 机械工程
- 23 篇 光学工程
- 16 篇 仪器科学与技术
- 16 篇 生物工程
- 13 篇 生物医学工程（可授...
- 11 篇 化学工程与技术
- 10 篇 农业工程
- 8 篇 网络空间安全
- 7 篇 力学（可授工学、理...
- 7 篇 材料科学与工程（可...
- 7 篇 动力工程及工程热...
- 5 篇 建筑学
- 5 篇 航空宇航科学与技...
168 篇 理学
- 120 篇 数学
- 54 篇 物理学
- 24 篇 统计学（可授理学、...
- 18 篇 生物学
- 10 篇 化学
- 9 篇 系统科学
78 篇 管理学
- 50 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 9 篇 工商管理
14 篇 农学
- 12 篇 作物学
7 篇 医学
5 篇 法学
- 5 篇 社会学
4 篇 艺术学
3 篇 经济学
2 篇 军事学
1 篇 文学

主题

10 篇 semantics
9 篇 image segmentati...
9 篇 bandwidth
7 篇 antenna radiatio...
7 篇 method of moment...
6 篇 wireless communi...
6 篇 interference
6 篇 optimization
6 篇 feature extracti...
6 篇 slot antennas
6 篇 broadband antenn...
5 篇 object detection
5 篇 convolution
5 篇 clustering algor...
5 篇 training
5 篇 radar cross sect...
4 篇 image fusion
4 篇 microwave antenn...
4 篇 antenna arrays
4 篇 support vector m...

机构

30 篇 key lab. of inte...
24 篇 key lab of intel...
23 篇 key lab of intel...
21 篇 school of comput...
19 篇 key lab. of inte...
18 篇 key lab. of inte...
16 篇 key lab of intel...
16 篇 key lab. of inte...
14 篇 key lab of intel...
14 篇 key lab. of inte...
14 篇 department of ph...
13 篇 key lab. of inte...
12 篇 school of cyber ...
10 篇 peng cheng labor...
10 篇 school of cyber ...
8 篇 key lab. of inte...
8 篇 school of electr...
8 篇 university of ch...
8 篇 key laboratory o...
8 篇 alibaba group

作者

26 篇 luo bin
23 篇 liu qun
18 篇 huang qingming
17 篇 yufa sun
16 篇 sun yufa
15 篇 wu xian-liang
15 篇 tang jin
15 篇 xu qianqian
14 篇 xianliang wu
14 篇 bin luo
13 篇 yang zhiyong
13 篇 cao xiaochun
12 篇 wu xianliang
11 篇 li xiaohui
10 篇 xian-liang wu
10 篇 huang zhi-xiang
9 篇 hui zhi
9 篇 wang zitai
9 篇 gao wen
9 篇 zhuge hai

语言

427 篇 英文
12 篇 中文
4 篇 其他

检索条件"机构=Key Lab. of Intelligent Computing and Signal Processing"

共 443 条记录，以下是311-320 订阅

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

详细简洁

排序：

Irregular community discovery for cloud service improvement

Irregular community discovery for cloud service improvement

引用

作者： Liu, Jin Zhou, Jing Wang, Junfeng Zhang, Feng Liu, Fei State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China Lab. of Complex Systems and Intelligence Science Institute of Automation CAS Beijing 100190 China State Key Lab. for Novel Software Technology Nanjing University Nanjing China School of Computer Science Communication University of China Beijing 100024 China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Beijing 100190 China College of Computer Science Sichuan University Chengdu 610064 China Software School Sun Yat-sen University Guangzhou 510006 China

Utility services provided by cloud computing rely on virtual customer communities forming spontaneously and evolving continuously. Clarifying the explicit boundaries of these communities is thus essential to the quality of utility services in cloud computing. Communities with overlapping features or prominent peripheral vertexes are usually typical irregular communities. Traditional community identification algorithms are limited in discovering irregular topological structures from CR networks, whereas these irregular shapes typically play an important role in finding prominent customers which are ignored in social CRM otherwise. We present a novel method of discovering irregular communities. It firstly finds and merges primitive maximal cliques and the irregular features of overlapping and prominent sparse vertices are further considered. An empirical case and a methodology comparison confirm the feasibility and efficiency of our approach. © 2012 Springer Science+Business Media, LLC.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A flexible stem-based local search algorithm for predicting RNA secondary structures including pseudoknots

A flexible stem-based local search algorithm for predicting ...

引用

7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE

作者： Chen, Xiang He, Si-Min Bu, Dong-Bo Chen, Run-Sheng Gao, Wen Key Lab. of Intelligent Information Processing Chinese Academy of Sciences Beijing 100080 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Insitute of Biophysics Chinese Academy of Sciences Beijing 100101 China Graduate University Chinese Academy of Sciences Beijing 100039 China

ISBN: (纸本)1424415098

We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a sophisticated energy model that is more accurate and supports more types of pseudoknots. By using a "maximal stem" and "stem merging" strategy, the search space for RNA structure prediction is significantly reduced. We have also developed a greedy search algorithm with perturbation on stems. The FlexStem algorithm is applied to a large number of sequences taken from Sprinzl, Pseudobase and other reliable resource. We find that FlexStem outperforms the well-known optimal and heuristic algorithms such as Mfold, PKNOTS, HotKnots and ILM in overall sensitivity and has comparable results to those algorithms in overall specificity. Performance evaluation demonstrate that FlexStem requires significantly less time than the optimal algorithm PKNOTS. In addition, our algorithm has better prediction results on pseudoknot-free sequences compared to competing algorithms. ©2007 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Network-based Approach for Protein Functions Prediction Using Locally Linear Embedding

A Network-based Approach for Protein Functions Prediction Us...

引用

The 4th International Conference on Bioinformatics and Biomedical Engineering(第四届IEEE生物信息与生物医学工程国际会议 iCBBE 2010)

作者： Haifeng Zhao Dengdi Sun Rifeng Wang Bin Luo Key Lab of Intelligent Computing & Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 P.R.China

Inferring protein functions from different data sources is a challenging task in the post-genomic era, as a large number of crude protein structures from structural genomics project are now solved without their biochemical functions characterized. Recently, many different methods have been used to predict protein functions including those based on Protein-Protein Interaction (PPI), structure, sequence relationship, gene expression data, etc. Among these approaches, methods based on protein interaction data are very promising. In this paper, we studied a network-based method using locally linear embedding (LLE). LLE is a robust learning algorithm that manipulates dimensionality reduction, neighborhood-preserving embedding for high-dimensional data. We first embed both annotated and unannotated proteins in a low dimensional Euclidean space;then, we apply semi-supervised learning techniques to classify unannotated proteins into different functional groups. Finally, we made predictions to the unknown functional proteins in yeast. 5-fold cross validation is then applied to the GO terms to compare the performance of different approaches, and the proposed method performs significantly better than the others.

关键词： Bioinformatics Semisupervised learning Genomics Protein sequence Gene expression Learning systems Sun intelligent networks intelligent structures Computer networks

来源：评论

学校读者我要写书评

暂无评论

Weighted ROC curve in cost space: extending AUC to cost-sensitive learning 23

Weighted ROC curve in cost space: extending AUC to cost-sens...

引用

Proceedings of the 37th International Conference on Neural Information processing Systems

作者： Huiyang Shao Qianqian Xu Zhiyong Yang Peisong Wen Peifeng Gao Qingming Huang Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences

In this paper, we aim to tackle flexible cost requirements for long-tail datasets, where we need to construct a (1) cost-sensitive and (2) class-distribution robust learning framework. The misclassification cost and the area under the ROC curve (AUC) are popular metrics for (1) and (2), respectively. However, limited by their formulations, models trained with AUC are not well-suited for cost-sensitive decision problems, and models trained with fixed costs are sensitive to the class distribution shift. To address this issue, we present a new setting where costs are treated like a dataset to deal with arbitrarily unknown cost distributions. Moreover, we propose a novel weighted version of AUC where the cost distribution can be integrated into its calculation through decision thresholds. To formulate this setting, we propose a novel bilevel paradigm to bridge weighted AUC (WAUC) and cost. The inner-level problem approximates the optimal threshold from sampling costs, and the outer-level problem minimizes the WAUC loss over the optimal threshold distribution. To optimize this bilevel paradigm, we employ a stochastic optimization algorithm (SACCL) which enjoys the same convergence rate (O(ε-4)) with the SGD. Finally, experiment results show that our algorithm performs better than existing cost-sensitive learning methods and two-stage AUC decisions approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A High-gain Triple Stopband Ultra-wideband MIMO Antenna

A High-gain Triple Stopband Ultra-wideband MIMO Antenna

引用

International Conference on Microwave and Millimeter Wave Technology Proceedings

作者： Jian Wu Yufa Sun Qing Wang Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China School of Electronic Engineering Anhui Xinhua University Hefei China

ISBN: (纸本)9781665482271

This paper designs a three-stopband ultra-wideband MIMO antenna with high-gain using FR4 as the dielectric substrate. The antenna consists of two horizontally placed semicircle patches with chamfer and slot. By corroding two C-shaped grooves on the semicircular radiation patch and etching two symmetrical C-shaped grooves on both sides of the feeder on the floor, the interference of WiMAX, WLAN and 7.5GHz-X band is blocked. In order to realize the isolation of the dual ports, a groove is made on the defective metal surface and a branch shaped like Chinese character mountain is added. The simulation results show that the working frequency range of the antenna is 2.5-11GHz, and three S11 stopbands higher than −10dB are formed at 3.3-3.8GHz, 5.15-5.825GHz, and 7.1-7.9GHz respectively. Therefore, it has good application prospects in the ultra-wideband field that blocks narrowband communications.

关键词： Microwave antennas Wireless LAN Slot antennas Simulation Dielectric substrates Interference WiMAX

来源：评论

学校读者我要写书评

暂无评论

Inferring Protein Annotation from Topological Structural Analysis on Protein Interaction Network

Inferring Protein Annotation from Topological Structural Ana...

引用

The 4th International Conference on Bioinformatics and Biomedical Engineering(第四届IEEE生物信息与生物医学工程国际会议 iCBBE 2010)

作者： Dengdi Sun Jin Fan Haifeng Zhao Bin Luo Key Lab of Intelligent Computing & Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 P.R.China

As more and more high-throughput protein-protein interactions data are collected, a large fraction of newly discovered proteins have an unknown functional role. A challenge to the scientific community is to assign these newly proteins with a biological function that can be verified by experiment. On the basis of thorough analysis of existing protein function prediction, we take double direction enumeration method combined with the distance constrains to find protein pathway, and propose a new predicting model based on topological structural of protein-protein interaction (PPI) network and protein pathway, which greatly increases the speed of the algorithm. To validate the method, the Yeast Saccharomyces cerevisiae protein-protein interaction network and corresponding protein pathways are analyzed. Comparing with other methods, our results can substantially improve the accuracy and robustness of functional annotation.

关键词： Proteins Fungi Databases Computer networks Biological system modeling Predictive models Organisms signal analysis Sun intelligent networks

来源：评论

学校读者我要写书评

暂无评论

A HSC-based sample selection method for Support Vector Machine

A HSC-based sample selection method for Support Vector Machi...

引用

International Conference on Machine Learning and Cybernetics

作者： He, Qing Li, Ning Shi, Zhong-Zhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Hebei University Baoding 071002 Hebei China Graduate University of Chinese Academy of Sciences Hebei University Baoding 071002 Hebei China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 Hebei China

ISBN: (纸本)9781424465262

Support Vector Machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the samples, the time complexity will also increase. So it is necessary to shrink training sets to reduce the time complexity. A sample selection method for SVM is proposed in this paper. It is inspired from the Hyper surface classification (HSC), which is a universal classification method based on Jordan Curve Theorem, and there is no need for mapping from lower-dimensional space to higher-dimensional space. The experiments show that the algorithm shrinks training sets keeping the accuracy for unseen vectors high. © 2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation rule extraction

Forest-based translation rule extraction

引用

2008 Conference on Empirical Methods in Natural Language processing, EMNLP 2008, Co-located with AMTA 2008 and the International Workshop on Spoken Language Translation

作者： Mi, Haitao Huang, Liang Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Dept. of Computer and Information Science University of Pennsylvania Levine Hall 3330 Walnut St. Philadelphia PA 19104 United States

Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of the bitext. The current dominant practice only uses 1-best trees, which adversely affects the rule set quality due to parsing errors. So we propose a novel approach which extracts rules from a packed forest that compactly encodes exponentially many parses. Experiments show that this method improves translation quality by over 1 BLEU point on a state-of-the-art tree-to-string system, and is 0.5 points better than (and twice as fast as) extracting on 30- best parses. When combined with our previous work on forest-based decoding, it achieves a 2.5 BLEU points improvement over the baseline, and even outperforms the hierarchical system of Hiero by 0.7 points. © 2008 Association for Computational Linguistics.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

From Use Case Model to Service Model An Environment Ontology Based Approach

From Use Case Model to Service Model An Environment Ontology...

引用

The Ninth International Conference on Grid and Cloud computing(第九届网格与云计算国际学术会议 GCC 2010)

作者： Guangjun Cai Bin Zhao Zhi Jin Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Graduate Unive Software Engineering Institute Peking University Beijing China

One fundamental problem in services computing is how to bridge the gap between business requirements and various heterogeneous IT services. This involves eliciting business requirements and building a solution accordingly by reusing availab.e services. While the business requirements are commonly elicited through use cases and scenarios, it is not straightforward to transform the use case model into a service model, and the existing manual approach is cumbersome and error-prone. In this paper, the environment ontology, which is used to model the problem space, is utilized to facilitate the model transformation process. The environment ontology provides a common understanding between business analysts and software engineers. The required software functionalities as well as the availab.e services’ capabilities are described using this ontology. By semi-automatically matching the required capability of each use case to the availab.e capabilities provides by services, a use case is realized by that set of services. At the end of this paper, a fictitious case study was used to illustrate how this approach works.

关键词： services computing requirements engineering use case environment ontology service model

来源：评论

学校读者我要写书评

暂无评论

Benchmarking still-to-video face recognition via partial and local linear discriminant analysis on COX-S2V dataset

Benchmarking still-to-video face recognition via partial and...

引用

11th Asian Conference on Computer Vision, ACCV 2012

作者： Huang, Zhiwu Shan, Shiguang Zhang, Haihong Lao, Shihong Kuerban, Alifu Chen, Xilin Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China OMRON Social Solutions Co. Ltd. Kyoto Japan College of Information Science and Engineering Xinjiang University China

ISBN: (纸本)9783642374432

In this paper, we explore the real-world Still-to-Video (S2V) face recognition scenario, where only very few (single, in many cases) still images per person are enrolled into the gallery while it is usually possible to capture one or multiple video clips as probe. Typical application of S2V is mug-shot based watch list screening. Generally, in this scenario, the still image(s) were collected under controlled environment, thus of high quality and resolution, in frontal view, with normal lighting and neutral expression. On the contrary, the testing video frames are of low resolution and low quality, possibly with blur, and captured under poor lighting, in non-frontal view. We reveal that the S2V face recognition has been heavily overlooked in the past. Therefore, we provide a benchmarking in terms of both a large scale dataset and a new solution to the problem. Specifically, we collect (and release) a new dataset named COX-S2V, which contains 1,000 subjects, with each subject a high quality photo and four video clips captured simulating video surveillance scenario. Together with the database, a clear evaluation protocol is designed for benchmarking. In addition, in addressing this problem, we further propose a novel method named Partial and Local Linear Discriminant Analysis (PaLo-LDA). We then evaluated the method on COX-S2V and compared with several classic methods including LDA, LPP, ScSR. Evaluation results not only show the grand challenges of the COX-S2V, but also validate the effectiveness of the proposed PaLo-LDA method over the competitive methods. © 2013 Springer-Verlag.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共45页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：