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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Video diver: Generic video indexing with diverse features

Video diver: Generic video indexing with diverse features

引用

International Multimedia Conference, MM'07 - 9th ACM SIG Multimedia International Workshop on Multimedia Information Retrieval, MIR'07

作者： Wang, Dong Liu, Xiaobing Luo, Linjie Li, Jianmin Zhang, Bo State Key Lab. of Intelligent Tech. and System Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9781595937780

Semantic video indexing is critical for practical video retrieval systems and a generic and scalab.e indexing framework is a must for indexing a large semantic lexicon with over 1000 concepts present. This paper fully explores the idea of incorporating many kinds of diverse features into a single framework, combining them altogether to obtain larger degree of invariance which is absent in any of the component features, and thus achieves genericness and scalab.lity. We scale down the formidable computational expense with a clever design of the classification and fusion schemes. To be specific, ~20 kinds of diverse features are extracted to capture limited yet complementary variance in color, texture and edge with spatial constraints implicitly integrated, and over 100 classifiers are built subsequently and fused to produce a generic detector. The extensive experiments on a total of 310 hours of TRECVID news videos show that the proposed framework yields significantly improved performance over that of the best single feature across a variety of concepts. Moreover, a benchmark comparison demonstrates that this approach is state-of-the-art. Meanwhile, the proposed approach generalizes well over previously unseen programs and stations and scales well to a lexicon of over 300 concepts in the LSCOM [18] ontology. Copyright 2007 ACM.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Video search in concept subspace: A text-like paradigm 07

Video search in concept subspace: A text-like paradigm

引用

6th ACM International Conference on Image and Video Retrieval, CIVR 2007

作者： Li, Xirong Wang, Dong Li, Jianmin Zhang, Bo State Key Lab. of Intelligent Tech. and System Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)1595937331

Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic indices in video search, given a specific query. In this paper, we tackle this problem and propose a video search framework which operates like searching text documents. Noteworthy for its adoption of the well-founded text search principles, this framework first selects a few related concepts for a given query, by employing a tf-idf like scheme, called c-tf-idf, to measure the informativeness of the concepts to this query. These selected concepts form a concept subspace. Then search can be conducted in this concept subspace, either by a Vector Model or a Language Model. Further, two algorithms, i.e., Linear Summation and Random Walk through Concept-Link, are explored to combine the concept search results and other baseline search results in a reranking scheme. This framework is both effective and efficient. Using a lexicon of 311 concepts from the LSCOM concept ontology, experiments conducted on the TRECVID 2006 search data set show that: when used solely, search within the concept subspace achieves the state-of-the-art concept search result;when used to rerank the baseline results, it can improve over the top 20 automatic search runs in TRECVID 2006 on average by approx. 20%, on the most significant one by approx. 50%, all within 180 milliseconds on a normal PC. Copyright 2007 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

The importance of query-concept-mapping for automatic video retrieval

The importance of query-concept-mapping for automatic video ...

引用

15th ACM International Conference on Multimedia, MM'07

作者： Wang, Dong Li, Xirong Li, Jianmin Zhang, Bo State Key Lab. of Intelligent Tech. and System Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9781595937025

A new video retrieval paradigm of query-by-concept emerges recently. However, it remains unclear how to exploit the detected concepts in retrieval given a multimedia query. In this paper, we point out that it is important to map the query to a few relevant concepts instead of search with all concepts. In addition, we show that solving this problem through both text and image inputs are effective for search, and it is possible to determine the number of related concepts by a language modeling approach. Experimental evidence is obtained on the automatic search task of TRECVID 2006 using a large lexicon of 311 learned semantic concept detectors. Copyright 2007 ACM.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Towards location-aware topology in both unstructured and structured P2P systems

Towards location-aware topology in both unstructured and str...

引用

36th International Conference on Parallel Processing in Xi'an, ICPP

作者： Qiu, Tongqing Chen, Guihai Ye, Mao Chan, Edward Zhao, Ben Y. State Key Lab. of Novel Software Nanjing University Department of Computer Science City University of Hong Kong Department of Computer Science UC Santa Barbara

ISBN: (纸本)076952933X

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a location-aware topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is more efficient, especially in a heterogeneous environment where nodes have different processing capabilities. © 2007 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Deforming surface simplification based on feature preservation

Deforming surface simplification based on feature preservati...

引用

6th International Conference of Entertainment Computing, ICEC 2007

作者： Shixue, Zhang Enhua, Wu Dept. of Computer and Information Science University of Macau Macao China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences China

ISBN: (纸本)3540748725

In computer graphics, methods for mesh simplification are common. However, most of them focus on static meshes, only few works have been proposed for simplifying deforming surfaces. In this paper, we propose a new method for the multiresolution representation of time-varying meshes based on deformation area and feature preservation. Our method uses the famous QEM (quadric error metric) as our basic metric. The idea is to modify the edge collapse cost by adding the deformation and sharp feature weight to the aggregated quadrics errors when computing the unified edge contraction sequence, then adjust this sequence slightly for each frame to get a minimum geometry distortion. Our approach is fast, easy to implement, and as a result good quality dynamic approximations with well-preserved fine details can be generated at any given frame. © ERIP International Federation for Information Processing 2007.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

A steep thermodynamical selection rule for evolutionary algorithms

A steep thermodynamical selection rule for evolutionary algo...

引用

7th International Conference on Computational science, ICCS 2007

作者： Ying, Weiqin Li, Yuanxiang Peng, Shujuan Wang, Weiwu State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China School of Computer Science Wuhan University Wuhan 430079 China

ISBN: (纸本)9783540725893

The genetic algorithm (GA) often suffers from the premature convergence because of the loss of population diversity at an early stage of searching. This paper proposes a steep thermodynamical evolutionary algorithm (STEA), which utilizes a steep thermodynamical selection (STS) rule. STEA simulates the competitive mechanism between energy and entropy in annealing to systematically resolve the conflicts between selective pressure and population diversity in GA. This paper also proves that the rule STS has the approximate steepest descent ability of the free energy. Experimental results show that STEA is both far more efficient and much stabler than the thermodynamical genetic algorithm (TDGA). © Springer-Verlag Berlin Heidelberg 2007.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamics process of long-running allocation/collection in linear storage space

Dynamics process of long-running allocation/collection in li...

引用

2nd International Conference on Networking, Architecture, and Storage, NAS 2007

作者： Qiang, Cao Guo, Tian-Jie Xie, Chang-Sheng Key Lab. of Data Storage System Computer School of Sci. and Tech. Huazhong University of Science and Technology

ISBN: (纸本)0769529275

Storage system could provide storage space and relevant access operations including allocating storage resources to new object and reclaiming storage space occupied by released objects. Allocation and collection operations are frequent, basic and specially impact on data distribution in storage space. Contrarily, data distribution also heavily effect on performance of access operations including of allocation and collection. However, it is absent to study how above two basic operates effect on data distribution in long time running. In this paper, dynamics process of continuously allocating and collecting in linear storage space are analyzed and described. We firstly build an abstract theory model of storage system. Furthermore, the dynamics of allocating/collecting is discussed. We obtain relevant descriptive equation and prove the discrete degree of system to converge around a fixed value in both continuous and inconsecutive allocation cases. In the end, our simulation experiment also could validate academic analysis. © 2007 IEEE.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Pseudo trust: Zero-knowledge based authentication in anonymous peer-to-peer protocols

Pseudo trust: Zero-knowledge based authentication in anonymo...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Lu, Li Han, Jinsong Hu, Lei Huai, Jinpeng Liu, Yunhao Ni, Lionel M. State Key Lab. of Information Security Graduate School Chinese Academy of Sciences Beijing China Dept. of Computer Science and Engineering Hong Kong University of Science and Technology Kowloon Hong Kong School of Computer Science Beihang University Beijing China State Key Lab. of Software Developing Environment Beihang University Beijing China

ISBN: (纸本)1424409101

Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence, there exists an inherent tradeoff between trust and anonymity. To the best of our knowledge, there is currently no P2P protocol that provides complete mutual anonymity as well as authentication and trust management. We propose a zero-knowledge authentication scheme called Pseudo Trust (PT), where each peer, instead of using its real identity, generates an unforgeable and verifiable pseudonym using a one-way hash function. A novel authentication scheme based on Zero-Knowledge Proof is designed so peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identity-based trust management schemes become applicable in mutual anonymous P2P systems. We analyze the levels of security and anonymity in PT, and evaluate its performance using trace-driven simulations and a prototype implementation. The strengths of Pseudo Trust include the lack of need for a centralized trusted party or CA, high scalab.lity and security, low traffic and cryptography processing overheads, and man-in-middle attack resistance. We aim for the Pseudo Trust design to be included in the P2P trust and anonymity context. © 2007 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Geo-WDBMS: An improved DBMS with the function of watermarking geographical data

引用

12th International Conference on Database systems for Advanced Applications, DASFAA 2007

作者： Min, Huang Xiang, Zhou Jiaheng, Cao Zhiyong, Peng Computer School Wuhan University Wuhan 430072 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China

ISBN: (纸本)9783540717027

This paper focuses on the issue of geographical data's copyrights protection. A Geo-WDBMS has been built by embedding the watermarking functions into the inner code of the open source DBMS PostgreSQL. And its core watermarking mechanism is to insert and detect mark bits in the coordinates of the vertices in geographical objects using the methods of classifying and twice majority-voting. Further more, error correcting mechanism is used to enhance the resilience of the system and blind watermark is realized. Experiments on watermarking digital maps showed that the marked maps are inconspicuous and robust to various attacks. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Replication strategy in unstructured peer-to-peer systems

Replication strategy in unstructured peer-to-peer systems

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Guofu, Feng Yuquan, Jiang Guihai, Chen Qing, Gu Sanglu, Lu Daoxu, Chen Nanjing Audit University School of Information Science Nanjing 210029 China State Key Lab. Novel Software Technology Nanjing 210093 China

ISBN: (纸本)1424409101

The unstructured Peer-to-Peer (P2P) systems usually use a "blind search " method to find the requested data object by propagating a query to a number of peers randomly. In order to increase the success rate of blind search, replication techniques are widely used in these systems. Most P2P systems replicate the most frequently accessed data objects to improve system performance. However, existing replication strategies cannot answer the question that how many replicas of an object should be kept in the P2P system. If an object is replicated excessively, it inevitably will affect the average efficiency of a replica, which will decrease the whole search performance. This paper addresses the issue of finding the proper number of replicas for an object according to its query rate. In this paper, we firstly investigate the precise relation among success rate, the allocation of replicas and query rate. Then we propose an approach of the allocation of copies to optimize the success rate. As a benchmark, our result offers a new understanding of replication. © 2007 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：