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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

2,700 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,895 篇 工学
- 1,456 篇 计算机科学与技术...
- 1,168 篇 软件工程
- 313 篇 信息与通信工程
- 273 篇 控制科学与工程
- 154 篇 生物工程
- 134 篇 机械工程
- 130 篇 电气工程
- 124 篇 电子科学与技术（可...
- 92 篇 光学工程
- 88 篇 生物医学工程（可授...
- 71 篇 仪器科学与技术
- 66 篇 动力工程及工程热...
- 59 篇 化学工程与技术
- 41 篇 建筑学
- 39 篇 安全科学与工程
- 39 篇 网络空间安全
878 篇 理学
- 541 篇 数学
- 183 篇 物理学
- 172 篇 生物学
- 147 篇 统计学（可授理学、...
- 137 篇 系统科学
- 70 篇 化学
540 篇 管理学
- 335 篇 管理科学与工程(可...
- 219 篇 图书情报与档案管...
- 111 篇 工商管理
75 篇 医学
- 65 篇 临床医学
- 56 篇 基础医学(可授医学...
- 40 篇 药学(可授医学、理...
62 篇 法学
- 42 篇 社会学
37 篇 经济学
- 37 篇 应用经济学
17 篇 农学
16 篇 教育学
10 篇 文学
8 篇 艺术学
6 篇 军事学

主题

132 篇 computer science
101 篇 laboratories
60 篇 semantics
56 篇 wireless sensor ...
50 篇 software enginee...
46 篇 application soft...
43 篇 software testing
42 篇 software
40 篇 optimization
40 篇 algorithm design...
40 篇 feature extracti...
39 篇 testing
38 篇 computational mo...
37 篇 data mining
33 篇 educational inst...
33 篇 monitoring
33 篇 protocols
33 篇 web services
32 篇 deep learning
32 篇 cloud computing

机构

493 篇 state key labora...
189 篇 department of co...
150 篇 department of co...
117 篇 national key lab...
109 篇 state key labora...
85 篇 state key labora...
66 篇 department of co...
63 篇 shanghai key lab...
61 篇 school of softwa...
60 篇 state key labora...
52 篇 state key labora...
50 篇 university of ch...
45 篇 national key lab...
37 篇 tsinghua nationa...
36 篇 school of artifi...
31 篇 state key labora...
31 篇 department of co...
30 篇 college of compu...
30 篇 beijing key labo...
29 篇 department of co...

作者

34 篇 yu huiqun
34 篇 junping du
34 篇 li wu-jun
33 篇 guihai chen
33 篇 dou wanchun
31 篇 fan guisheng
31 篇 zhang lijun
30 篇 shen furao
30 篇 yingmin jia
29 篇 zhao jian
29 篇 ying mingsheng
25 篇 yang tianbao
24 篇 xu baowen
23 篇 xiang-yang li
23 篇 sanglu lu
22 篇 xu xiaolong
22 篇 zhang xuyun
22 篇 chen liqiong
21 篇 qi lianyong
21 篇 lu sanglu

语言

2,402 篇 英文
231 篇 其他
67 篇 中文
2 篇 德文

检索条件"机构=State Key Laboratory for Novell Software Technology Department of Computer Science and Technology"

共 2700 条记录，以下是1951-1960 订阅

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

详细简洁

排序：

Automatic generation of canonical views for CAD models

Automatic generation of canonical views for CAD models

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Hu, Kai-Mo Wang, Bin Yuan, Bin Yong, Jun-Hai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

Selecting the best views for 3D objects is useful for many applications. However, with the existing methods applied in CAD models, the results neither exhibit the 3D structures of the models fairly nor conform to human's browsing habits. In this paper, we present a robust method to generate the canonical views of CAD models, and the above problem is solved by considering the geometry and visual salient features simultaneously. We first demonstrate that for a CAD model, the three coordinate axes can be approximately determined by the scaled normals of its faces, such that the pose can be robustly normalized. A graph-based algorithm is also designed to accelerate the searching process. Then, a convex hull based method is applied to infer the upright orientation. Finally, four isometric views are selected as candidates, and the one whose depth image owns the most visual features is selected. Experiments on the Engineering Shape Benchmark (ESB) show that the views generated by our method are pleasant, informative and representative. We also apply our method in the calculation of model rectilinearity, and the results demonstrate its high performance. © 2011 IEEE.

关键词： computer aided design

来源：评论

学校读者我要写书评

暂无评论

Multi-resolution mesh fitting by B-spline surfaces for reverse engineering

Multi-resolution mesh fitting by B-spline surfaces for rever...

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Zhang, Sen Li, Zhigang Zhang, Hui Yong, Junhai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

This paper presents a new multi-resolution mesh fitting algorithm, extending the adaptive patch-based fitting scheme where each underlying quadrilateral is recursively subdivided into four sub-patches. In this paper, the G1 continuity constraints, which mainly consist of perpendicular constraints and twist compatibility constraints, are deduced for B-spline patches. In order to construct a unique B-spline patch for each quadrilateral, the mesh vertices are applied in a least-square approximation, and the energy functions associated with a patch are minimized. In contrast to the original algorithm, this paper fits the mesh into B-spline patches instead of Bézier patches with G1 continuity. The B-spline patches make the algorithm have more free control points to be used for optimizing the shape of the quadrilateral patches to achieve higher flexible patch control and less recursive times. © 2011 IEEE.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

An optimal color mapping strategy based on energy minimization for time-varying data

An optimal color mapping strategy based on energy minimizati...

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Peng, Yi Dong, Jie Chen, Li Chu, Haiyang Yong, Junhai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

Color mapping plays a critical role in visualization of time-varying data and also sets a challenge for researchers due to the consistency of mapping and great changes in time-varying data. In order to solve this problem and generate feature-prominent animation, we present a two phase optimization technique using bilateral filtering and global energy functions. In the first phase, for each time step, we use a weighted mapping function which combines linear mapping and feature histogram. In the second phase, an optimization function taking global color mapping and minimum color difference into consideration is designed. So users can clearly distinguish between data in variable time steps and easily understand the corresponding relationships between different structures. The experiments' results show that our method can achieve high quality visualization for both static and time-varying data. © 2011 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Implicit surface reconstruction based on adaptive clustering

Implicit surface reconstruction based on adaptive clustering

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Zheng, Chao Zhang, Hui School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

ISBN: (纸本)9780769544977

This paper presents an efficient method to reconstruct an implicit surface from a point cloud based on adaptive clustering. First, a novel approach, based on a hierarchical clustering tree with variation and normal constraints, is proposed for normal estimation of the point cloud. It simplifies the point cloud and reduces the amount of direction propagation paths in normal orientation. Second, an implicit surface is computed from the clustering tree by a feature preserving method, using adaptive plane fitting that considers the local feature and sharp areas of the point cloud. Finally, the results demonstrate the efficiency of our method for open, closed and unorganized models, and show that the resulting surfaces preserve the sharp features. © 2011 IEEE.

关键词： Surface reconstruction

来源：评论

学校读者我要写书评

暂无评论

Color-mood-aware clothing re-texturing

Color-mood-aware clothing re-texturing

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Shen, Jianbing Sun, Hanqiu Mao, Xiaoyang Guo, Yanwen Jin, Xiaogang Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing 100081 China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong University of Yamanashi Japan National Key Lab. for Novel Software Technology Nanjing University China State Key Lab. of CAD and CG Zhejiang University Hangzhou 310027 China

ISBN: (纸本)9780769544977

In this paper, we present a novel color-mood-aware technique to re-texture clothing in a photograph. An efficient classification algorithm is developed to classify clothing textures using color mood scheme. To re-texture the clothing, our approach first computes the gradient maps for the cloth region to be replaced and then calculates the texture distortion coordinates on the projected cloth region according to the gradient maps. After the user selects a target clothing texture from the classified clothing texture database, the lighting and shading effects on the original photograph is transferred using the HSV color space. Experimental results show that the proposed approach successfully re-textures the clothes in photographs while preserving the geometry and lighting features. © 2011 IEEE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Memory Leak Detection Based on Memory state Transition Graph

Memory Leak Detection Based on Memory State Transition Graph

引用

Asia-Pacific Conference on software Engineering

作者： Zhenbo Xu Jian Zhang Zhongxing Xu Department of Computer Science and Technology University of Science and Technology of China China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China

Memory leak is a common type of defect that is hard to detect manually. Existing memory leak detection tools suffer from lack of precise interprocedural alias and path conditions. To address this problem, we present a static interprocedural analysis algorithm, which captures memory actions and path conditions precisely, to detect memory leak in C programs. Our algorithm uses path-sensitive symbolic execution to track the memory actions in different program paths guarded by path conditions. A novel analysis model called Memory state Transition Graph (MSTG) is proposed to describe the tracking process and its results. An MSTG is generated from a procedure. Nodes in an MSTG contain states of memory objects which record the function behaviors precisely. Edges in anMSTG are annotated with path conditions collected by symbolic execution. The path conditions are checked for satisfiability to reduce the number of false alarms and the path explosion. In order to do interprocedural analysis, our algorithm generates a summary for each procedure from the MSTG and applies the summary at the procedure's call sites. Our implemented tool has found several memory leak bugs in some open source programs and detected more bugs than other tools in some programs from the SPEC2000 benchmarks. In some cases, our tool produces many false positives, but most of them are caused by the same code patterns which are easy to check.

关键词： computer bugs Algorithm design and analysis Analytical models Leak detection Detectors Resource management Explosions

来源：评论

学校读者我要写书评

暂无评论

An utility-based job scheduling algorithm for cloud computing considering reliability factor

An utility-based job scheduling algorithm for cloud computin...

引用

2011 International Conference on Cloud and Service Computing, CSC 2011

作者： Yang, Bo Xu, Xiaofei Tan, Feng Park, Dong Ho State Key Laboratory of Software Engineering Wuhan University Wuhan China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Department of Industrial Engineering University of Electronic Science and Technology of China Chengdu 611731 China Department of Information and Statistics Hallym University Chuncheon 200-702 Korea Republic of

ISBN: (纸本)9781457716362

Cloud computing' service-oriented characteristics advance a new way of service provisioning called utility based computing. However, toward the practical application of commercialized Cloud, we encounter two challenges: i) there is no well-defined job scheduling algorithm for the Cloud that considers the system state in the future, particularly under overloading circumstances;ii) the existing job scheduling algorithms under utility computing paradigm do not take hardware/software failure and recovery in the Cloud into account. In an attempt to address these challenges, we introduce the failure and recovery scenario in the Cloud computing entities and propose a Reinforcement Learning (RL) based algorithm to make job scheduling fault-tolerable while maximizing utilities attained in the long term. We carry out experimental comparison with Resource-constrained Utility Accrual algorithm (RUA), Utility Accrual Packet scheduling algorithm (UPA) and LBESA to demonstrate the feasibility of our proposed approach. © 2011 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Multiobjective optizition shuffled frog-leaping biclustering

Multiobjective optizition shuffled frog-leaping biclustering

引用

2011 IEEE International Conference onBioinformatics and Biomedicine Workshops, BIBMW 2011

作者： Liu, Junwan Hu, Xiaohua Li, Zhoujun Chen, Yiming School of Computer and Information Engineering Central South University of Forestry and Technology Changsha China College of Information Science and Technology Drexel University Philadelphia PA United States State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781457716133

Biclustering of DNA microarray data that can mine significant patterns to help in understanding gene regulation and interactions. This is a classical multi-objective optimization problem (MOP). Recently, many researchers have developed stochastic search methods that mimic the efficient behavior of species such as ants, bees, birds and frogs, as a means to seek faster and more robust solutions to complex optimization problems. The particle swarm optimization(PSO) is a heuristics-based optimization approach simulating the movements of a bird flock finding food. The shuffled frog leaping algorithm (SFLA) is a population-based cooperative search metaphor combining the benefits of the local search of PSO and the global shuffled of information of the complex evolution technique. This paper introduces SFL algorithm to solve biclustering of microarray data, and proposes a novel multi-objective shuffled frog leaping biclustering(MOSFLB) algorithm to mine coherent patterns from microarray data. Experimental results on two real datasets show that our approach can effectively find significant biclusters of high quality. © 2011 IEEE.

关键词： Birds

来源：评论

学校读者我要写书评

暂无评论

Improved stochastic progressive photon mapping with Metropolis sampling

Improved stochastic progressive photon mapping with Metropol...

引用

Eurographics Symposium on Rendering 2011

作者： Chen, Jiating Wang, Bin Yong, Jun-Hai School of Software Tsinghua University Beijing China Department of Computer Science and Technology Tsinghua University Beijing China Key Laboratory for Information System Security Ministry of Education of China Beijing China Tsinghua National Laboratory for Information Science and Technology Beijing China

This paper presents an improvement to the stochastic progressive photon mapping (SPPM), a method for robustly simulating complex global illumination with distributed ray tracing effects. Normally, similar to photon mapping and other particle tracing algorithms, SPPM would become inefficient when the photons are poorly distributed. An inordinate amount of photons are required to reduce the error caused by noise and bias to acceptable levels. In order to optimize the distribution of photons, we propose an extension of SPPM with a Metropolis-Hastings algorithm, effectively exploiting local coherence among the light paths that contribute to the rendered image. A well-designed scalar contribution function is introduced as our Metropolis sampling strategy, targeting at specific parts of image areas with large error to improve the efficiency of the radiance estimator. Experimental results demonstrate that the new Metropolis sampling based approach maintains the robustness of the standard SPPM method, while significantly improving the rendering efficiency for a wide range of scenes with complex lighting. © 2011 The Author(s).

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable data aggregation scheme in wireless sensor networks

SelectCast: Scalable data aggregation scheme in wireless sen...

引用

IEEE INFOCOM 2011

作者： Wang, Cheng Tang, Shaojie Li, Xiang-Yang Jiang, Changjun Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States TNLIST School of Software Tsinghua University China

ISBN: (纸本)9781424499212

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable. © 2011 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共270页 << < 192 193 194 195 196 197 198 199 200 201 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：