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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
223 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

635 篇 工学
- 535 篇 计算机科学与技术...
- 446 篇 软件工程
- 123 篇 信息与通信工程
- 90 篇 控制科学与工程
- 44 篇 电子科学与技术（可...
- 43 篇 电气工程
- 41 篇 生物工程
- 36 篇 机械工程
- 28 篇 动力工程及工程热...
- 26 篇 光学工程
- 23 篇 化学工程与技术
- 22 篇 建筑学
- 21 篇 材料科学与工程（可...
- 19 篇 安全科学与工程
- 18 篇 仪器科学与技术
- 18 篇 土木工程
- 18 篇 交通运输工程
- 16 篇 生物医学工程（可授...
- 10 篇 航空宇航科学与技...
357 篇 理学
- 259 篇 数学
- 59 篇 物理学
- 56 篇 统计学（可授理学、...
- 52 篇 系统科学
- 43 篇 生物学
- 27 篇 化学
214 篇 管理学
- 120 篇 管理科学与工程(可...
- 110 篇 图书情报与档案管...
- 57 篇 工商管理
25 篇 法学
- 19 篇 社会学
16 篇 经济学
- 16 篇 应用经济学
8 篇 医学
6 篇 教育学
6 篇 农学
4 篇 艺术学
1 篇 文学
1 篇 军事学

主题

22 篇 semantics
13 篇 computational mo...
13 篇 web services
12 篇 data mining
10 篇 computer science
10 篇 optimization
10 篇 forecasting
9 篇 clustering algor...
8 篇 conferences
8 篇 computer archite...
8 篇 neural networks
8 篇 analytical model...
7 篇 ordinary differe...
7 篇 software quality
7 篇 feature extracti...
7 篇 software
7 篇 cloud computing
7 篇 measurement
7 篇 privacy
7 篇 training

机构

87 篇 state key lab. f...
56 篇 state key lab. o...
28 篇 state key lab. o...
28 篇 university of ch...
26 篇 state key lab. o...
22 篇 state key lab. o...
22 篇 computer school ...
14 篇 tianjin key lab....
14 篇 state key lab. f...
13 篇 department of co...
13 篇 school of comput...
12 篇 beijing key lab....
12 篇 state key lab. o...
11 篇 key laboratory o...
10 篇 department of co...
10 篇 state key labora...
10 篇 school of comput...
10 篇 hunan provincial...
10 篇 school of comput...
10 篇 nanjing universi...

作者

22 篇 zhan naijun
19 篇 xue bai
15 篇 liu jin
12 篇 guosheng kang
11 篇 du junping
11 篇 chen ling
10 篇 liu wei
10 篇 wang hongan
10 篇 liu jianxun
9 篇 kang guosheng
9 篇 zhan bohua
8 篇 he keqing
8 篇 bai xue
8 篇 wu enhua
8 篇 sanglu lu
8 篇 he yanxiang
8 篇 dai guozhong
8 篇 jianxun liu
7 篇 zhang degan
7 篇 zhang xiaolong

语言

792 篇 英文
31 篇 中文
11 篇 其他

检索条件"机构=Key Lab. of System Software and State Key Lab. of Computer Science"

共 834 条记录，以下是431-440 订阅

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

详细简洁

排序：

Mining high utility itemsets without candidate generation 12

Mining high utility itemsets without candidate generation

引用

21st ACM International Conference on Information and Knowledge Management, CIKM 2012

作者： Liu, Mengchi Qu, Junfeng State Key Lab. of Software Engineering School of Computer Wuhan University Wuhan 430072 China School of Computer Science Carleton University Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9781450311564

High utility itemsets refer to the sets of items with high utility like profit in a database, and efficient mining of high utility itemsets plays a crucial role in many real-life applications and is an important research issue in data mining area. To identify high utility itemsets, most existing algorithms first generate candidate itemsets by overestimating their utilities, and subsequently compute the exact utilities of these candidates. These algorithms incur the problem that a very large number of candidates are generated, but most of the candidates are found out to be not high utility after their exact utilities are computed. In this paper, we propose an algorithm, called HUI-Miner (High Utility Itemset Miner), for high utility itemset mining. HUI-Miner uses a novel structure, called utility-list, to store both the utility information about an itemset and the heuristic information for pruning the search space of HUI-Miner. By avoiding the costly generation and utility computation of numerous candidate itemsets, HUI-Miner can efficiently mine high utility itemsets from the utility-lists constructed from a mined database. We compared HUI-Miner with the state-of-the-art algorithms on various databases, and experimental results show that HUI-Miner outperforms these algorithms in terms of both running time and memory consumption. © 2012 ACM.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Selection methods research based on stochastic ranking for constrained optimization

Selection methods research based on stochastic ranking for c...

引用

2012 International Conference on computer science and Electronics Engineering, ICCSEE 2012

作者： Jiang, Ling Zhao, Wei Li, Bo Qin, Yiwen Zhao, Xinchao School of Science Beijing University of Posts and Telecommunications Beijing 100876 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9780769546476

This paper describes some general constrained optimization problem-solving methods at first, and then different ideas of combining particle swarm optimization with stochastic ranking are proposed. Accordingly, three algorithms (SR1, SRe1, SRhs) are constructed together with disturbance idea and their pros and cons are analyzed. Finally, some typical benchmarks are used to confirm their performance and achieve better results. © 2012 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Stock market volatility prediction: A service-oriented multi-kernel learning approach

Stock market volatility prediction: A service-oriented multi...

引用

2012 IEEE 9th International Conference on Services Computing, SCC 2012

作者： Wang, Feng Liu, Ling Dou, Chenxiao State Key Lab. of Software Engineering Wuhan University Wuhan China College of Computing Georgia Institute of Technology Atlanta GA United States School of Computer Science Wuhan University Wuhan China

ISBN: (纸本)9780769547534

Stock market is an important and active part of nowadays financial markets. Stock time series volatility analysis is regarded as one of the most challenging time series forecasting due to the hard-to-predict volatility observed in worldwide stock markets. In this paper we argue that the stock market state is dynamic and invisible but it will be influenced by some visible stock market information. Existing research on financial time series analysis and stock market volatility prediction can be classified into two categories: in depth study of one market factor on the stock market volatility prediction or prediction by combining historical price fluctuations with either trading volume or news. In this paper we present a service-oriented multi-kernel based learning framework (MKL) for stock volatility analysis. Our MKL service framework promotes a two-tier learning architecture. In the top tier, we develop a suite of data preparation and data transformation techniques to provide a source-specific modeling, which transforms and normalizes a source specific input dataset into the MKL ready data representation. Then we apply data alignment techniques to prepare the datasets from multiple information sources based on the classification model we choose for cross-source correlation analysis. In the next tier, we develop model integration methods to perform three analytic tasks: (i) building one sub-kernel per source, (ii) learning and tuning the weights for sub-kernels through weight adjustment methods and (iii) performing multi-kernel based cross-correlation analysis of market volatility. To validate the effectiveness of our service oriented MKL approach, we performed experiments on HKEx 2001 stock market datasets with three important market information sources: historical prices, trading volumes and stock related news articles. Our experiments show that 1) multi-kernel learning method has a higher degree of accuracy and a lower degree of false prediction, compared to exist

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Test effectiveness index: Integrating product metrics with process metrics

Test effectiveness index: Integrating product metrics with p...

引用

2012 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent systems, CYBER 2012

作者： Zhang, Yan Zhao, Xuying Zhang, Xiaokun Zhang, Tian Department of Computer Science and Technology Beijing Electronic Science and Technology Institute Beijing 100070 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9781467314213

Defect measurement is an important method in the improvement of software quality. Recent approaches of defect measurement are inappropriate to small software organizations by reason of their intricacy. This paper gives a simple approach of defect measurement, which integrates the power of product metrics with process metrics, i.e., it can not only detect the defect-prone modules, but also find the problems in the software process. This approach uses the results of successive two rounds of testing to create the test effectiveness index constructively. A case study is conducted and the results indicate that the defectprone modules can be identified and problems of testing process can be discovered by test effectiveness index. © 2012 IEEE.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

Independent domination on tree convex bipartite graphs

Independent domination on tree convex bipartite graphs

引用

6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012

作者： Song, Yu Liu, Tian Xu, Ke Key Laboratory of High Confidence Software Technologies School of Electronic Engineering and Computer Science Peking University Beijing 100871 China National Lab. of Software Development Environment Beihang University Beijing 100191 China

ISBN: (纸本)9783642296994

An independent dominating set in a graph is a subset of vertices, such that every vertex outside this subset has a neighbor in this subset (dominating), and the induced subgraph of this subset contains no edge (independent). It was known that finding the minimum independent dominating set (Independent Domination) is -complete on bipartite graphs, but tractable on convex bipartite graphs. A bipartite graph is called tree convex, if there is a tree defined on one part of the vertices, such that for every vertex in another part, the neighborhood of this vertex is a connected subtree. A convex bipartite graph is just a tree convex one where the tree is a path. We find that the sum of larger-than-two degrees of the tree is a key quantity to classify the computational complexity of independent domination on tree convex bipartite graphs. That is, when the sum is bounded by a constant, the problem is tractable, but when the sum is unbounded, and even when the maximum degree of the tree is bounded, the problem is -complete. © 2012 Springer-Verlag.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Model driven configuration of fault tolerance solutions for component-based software system 12

Model driven configuration of fault tolerance solutions for ...

引用

15th International Conference on Model Driven Engineering Languages and systems, MODELS 2012

作者： Wu, Yihan Huang, Gang Song, Hui Zhang, Ying Key Lab. of High Confidence Software Technologies Ministry of Education China School of Electronic Engineering and Computer Science Peking University China Lero: the Irish Software Engineering Research Center Trinity College Dublin Ireland

ISBN: (纸本)9783642336652

Fault tolerance is very important for complex component-based software systems, but its configuration is complicated and challenging. In this paper, we propose a model driven approach to semi-automatic configuration of fault tolerance solutions. At design time, a set of reusable fault tolerance solutions are modeled as architecture styles, with the key properties verified by model checking. At runtime, the runtime software architecture of the target system is automatically constructed by the code generated from the given architectural meta-model. Then, the impact of each component on the system reliability is automatically analyzed to recommend which components should be considered in the fault tolerance configuration. Finally, after which components are guaranteed by what fault tolerance solution is decided by the system administration, the architecture model is automatically changed by merging with the selected fault tolerance styles and finally, these changes are automatically propagated to the target system. This approach is evaluated on Java enterprise systems. © 2012 Springer-Verlag.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Fully secure unidirectional identity-based proxy re-encryption

Fully secure unidirectional identity-based proxy re-encrypti...

引用

14th International Conference on Information Security and Cryptology, ICISC 2011

作者： Luo, Song Shen, Qingni Chen, Zhong College of Computer Science and Engineering Chongqing University of Technology Chongqing China School of Software and Microelectronics MoE Key Lab. of Network and Software Assurance Peking University Beijing China Institute of Software School of Electronics Engineering and Computer Science Peking University China Ministry of Education China

ISBN: (纸本)9783642319112

Proxy re-encryption (PRE) allows the proxy to translate a ciphertext encrypted under Alice's public key into another ciphertext that can be decrypted by Bob's secret key. Identity-based proxy re-encryption (IB-PRE) is the development of identity-based encryption and proxy re-encryption, where ciphertexts are transformed from one identity to another. In this paper, we propose two novel unidirectional identity-based proxy re-encryption schemes, which are both non-interactive and proved secure in the standard model. The first scheme is a single-hop IB-PRE scheme and has master secret security, allows the encryptor to decide whether the ciphertext can be re-encrypted. The second scheme is a multi-hop IB-PRE scheme which allows the ciphertext re-encrypted multiple times but without the size of ciphertext growing linearly as previous multi-hop IB-PRE schemes. © 2012 Springer-Verlag.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Memetic three-dimensional gabor feature extraction for hyperspectral imagery classification

Memetic three-dimensional gabor feature extraction for hyper...

引用

3rd International Conference on Swarm Intelligence, ICSI 2012

作者： Zhu, Zexuan Shen, Linlin Sun, Yiwen He, Shan Ji, Zhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen 518060 China Shenzhen Key Lab. of Biomedical Engineering School of Medicine Shenzhen University 518060 China School of Computer Science University of Birmingham Edgbaston Birmingham B15 2TT United Kingdom

ISBN: (纸本)9783642309755

This paper proposes a three-dimensional Gabor feature extraction for pixel-based hyperspectral imagery classification using a memetic algorithm. The proposed algorithm named MGFE combines 3-D Gabor wavelet feature generation and feature selection together to capture the signal variances of hyperspectral imagery, thereby extracting the discriminative 3-D Gabor features for accurate classification. MGFE is characterized with a novel fitness evaluation function based on independent feature relevance and a pruning local search for eliminating redundant features. The experimental results on two real-world hyperspectral imagery datasets show that MGFE succeeds in obtaining significantly improved classification accuracy with parsimonious feature selection. © 2012 Springer-Verlag.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Identifying CpG islands in genome using conditional random fields

Identifying CpG islands in genome using conditional random f...

引用

8th International Conference on Intelligent Computing Technology, ICIC 2012

作者： Liu, Wei Chen, Hanwu Chen, Ling Department of Computer Science and Engineering Southeast University Nanjing 210096 China Department of Computer Science Yangzhou University Yangzhou 225127 China National Key Lab. of Novel Software Tech. Nanjing University Nanjing 210093 China

ISBN: (纸本)9783642315879

This paper presents a novel method for CpG islands location identification based on conditional random fields (CRF) model. The method transforms CpG islands location identification into the problem of sequential data lab.ling. Based on the nature of CpG islands location, we design the methods of model constructing, training and decoding in CRF accordingly. Experimental results on benchmark data sets show that our algorithm is more practicable and efficient than the traditional methods. © 2012 Springer-Verlag.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Two new local search strategies for minimum vertex cover 26

Two new local search strategies for minimum vertex cover

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Cai, Shaowei Su, Kaile Sattar, Abdul Key Laboratory of High Confidence Software Technologies Peking University Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD Australia ATOMIC Project Queensland Research Lab. NICTA Australia

ISBN: (纸本)9781577355687

In this paper, we propose two new strategies to design efficient local search algorithms for the minimum vertex cover (MVC) problem. There are two main drawbacks in state-of-the-art MVC local search algorithms: First, they select a pair of vertices to be exchanged simultaneously, which is time consuming;Second, although they use edge weighting techniques, they do not have a strategy to decrease the weights. To address these drawbacks, we propose two new strategies: two stage exchange and edge weighting with forgetting. The two stage exchange strategy selects two vertices to be exchanged separately and performs the exchange in two stages. The strategy of edge weighting with forgetting not only increases weights of uncovered edges, but also decreases some weights for each edge periodically. We utilize these two strategies to design a new algorithm dubbed NuMVC. The experimental results show that NuMVC significantly outperforms existing state-of-the-art heuristic algorithms on most of the hard DIMACS instances and all instances in the hard random BHOSLIB benchmark. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：