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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

195 篇 会议
17 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

140 篇 工学
- 124 篇 计算机科学与技术...
- 68 篇 软件工程
- 20 篇 电气工程
- 9 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 6 篇 光学工程
- 5 篇 机械工程
- 5 篇 控制科学与工程
- 4 篇 生物工程
- 3 篇 电子科学与技术（可...
- 2 篇 交通运输工程
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 化学工程与技术
62 篇 医学
- 58 篇 临床医学
- 5 篇 特种医学
20 篇 理学
- 8 篇 数学
- 6 篇 物理学
- 6 篇 生物学
- 2 篇 化学
- 2 篇 统计学（可授理学、...
- 1 篇 天文学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 系统科学
11 篇 管理学
- 10 篇 管理科学与工程(可...
- 5 篇 工商管理
- 4 篇 图书情报与档案管...
2 篇 法学
- 2 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

31 篇 feature extracti...
25 篇 image color anal...
23 篇 training
21 篇 image segmentati...
16 篇 image processing
15 篇 task analysis
15 篇 visualization
13 篇 computer archite...
13 篇 cameras
11 篇 computer graphic...
9 篇 rendering (compu...
9 篇 databases
9 篇 computer vision
8 篇 digital image pr...
7 篇 deep learning
7 篇 real-time system...
7 篇 image recognitio...
7 篇 image reconstruc...
6 篇 support vector m...
6 篇 lighting

机构

4 篇 department of co...
2 篇 univ tecnol fed ...
2 篇 univ fed minas g...
2 篇 univ sao paulo i...
2 篇 faculty of elect...
2 篇 univ sao paulo i...
2 篇 college of compu...
2 篇 univ estadual ca...
2 篇 college of mathe...
2 篇 inst matematica ...
2 篇 univ fed minas g...
2 篇 instituto de mat...
2 篇 universidade fed...
2 篇 universidade de ...
2 篇 univ sao paulo i...
2 篇 college of compu...
1 篇 computaçáo brasi...
1 篇 laboratory of vi...
1 篇 hunan university...
1 篇 at&t research

作者

5 篇 wu st
3 篇 eler danilo m.
3 篇 alexandre xavier...
3 篇 nakazaki marcel ...
3 篇 menotti david
3 篇 laroca rayson
3 篇 santos davi p.
3 篇 ponti moacir a.
3 篇 david menotti
3 篇 william robson s...
3 篇 paulovich fernan...
3 篇 minghim rosane
3 篇 rayson laroca
2 篇 britto alceu s. ...
2 篇 flores franklin ...
2 篇 moacir antonelli...
2 篇 paulo ivson
2 篇 guillermo camara...
2 篇 meyer fernand
2 篇 schwartz william...

语言

212 篇 英文
1 篇 葡萄牙文
1 篇 中文

检索条件"任意字段=21st Brazilian Symposium on Computer Graphics and Image Processing"

共 214 条记录，以下是171-180 订阅

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

详细简洁

排序：

Authentication in reprogramming of sensor networks for mote class adversaries

Authentication in reprogramming of sensor networks for mote ...

引用

21st International Parallel and Distributed processing symposium, IPDPS 2007

作者： Limin, Wang Kulkarni, Sandeep S. Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI 48824 United States

ISBN: (纸本)1424409101

Reprogramming is an essential service for wireless sensor networks. Authenticating reprogramming process is important as sensors need to verify that the code image is truly from a trusted source. There are two ways to achieve authentication: public key based and symmetric key based. Although previous work has shown that public key authentication is feasible on sensor nodes if used sparingly, it is still quite expensive compared to symmetric key based approach. In this paper, we propose a symmetric key based protocol for authenticating reprogramming process. Our protocol is based on the secret instantiation algorithm from [5, 11], which requires only O(log n) keys to be maintained at each sensor. We integrate this algorithm with the existing reprogramming protocol. Through simulation, we show that it is able to authenticate reprogramming process at very low communication cost, and has very short delay. ©2007 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Decomposing partial order execution graphs to improve message race detection

Decomposing partial order execution graphs to improve messag...

引用

21st International Parallel and Distributed processing symposium, IPDPS 2007

作者： Schaeli, Basile Gerlach, Sebastian Hersch, Roger D. School of Computer and Communication Sciences Switzerland

ISBN: (纸本)1424409101

In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the execution should be the same for all distinct orderings of messages delivery. Finding an ordering that produces a different outcome then reveals a message race. Assuming that the Partial Order Execution Graph (POEG) capturing the causality between events is known for a reference execution, the present paper describes techniques for identifying independent sets of messages and within each set equivalent message orderings. Orderings of messages belonging to different sets may then be reexecuted independently from each other, thereby reducing the number of orderings that must be tested to detect message races. We integrated the presented techniques into the Dynamic Parallel Schedules parallelization framework, and applied our approach on an image processing, a linear algebra, and a neighborhood-dependent parallel computation. In all cases, the number of possible orderings is reduced by several orders of magnitudes. In order to further reduce this number, we describe an algorithm that generates a subset of orderings that are likely to reveal existing message races. © 2007 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Interconnect customization for a coarse-grained reconfigurable fabric

Interconnect customization for a coarse-grained reconfigurab...

引用

21st International Parallel and Distributed processing symposium, IPDPS 2007

作者： Mehta, Gayatri stander, Justin Baz, Mustafa Hunsaker, Brady Jones, Alex K. Electrical and Computer Engineering University of Pittsburgh Industrial Engineering University of Pittsburgh

ISBN: (纸本)1424409101

This paper describes several system-level interconnection strategies for a coarse-grained reconfigurable fabric designed for low-energy hardware acceleration. A small, representative sub-graph for signal and image processing applications is used to predict the success of mapping larger applications onto the fabric device with these different interconnection strategies, which include 32:1, 8:1, 5:1, 4:1, 3553:1 (3:1, 5:1, 5:1, 3:1) and 355:1 (3:1, 5:1, 5:1) cardinalities. Three mapping techniques are presented and used to complete mappings onto several of these fabric instances including a mixed integer linear programming technique, a constraint programming approach, and a greedy heuristic. We present results for area (in number of required rows), power, delay, and energy as well as run times for mapping a set of signal and image processing benchmarks onto each of these interconnects. Our results indicate that the 5:1 interconnect provides the best overall results and does not require any additional hardware resources than the baseline 4:1 technique. When compared with other implementation strategies, the re configurable fabric energy consumption, using 5:1-based interconnect, is within 5-10X of a direct ASIC implementation, is 10X better than an Virtex II Pro FPGA and is 100X better than an Intel XScale processor. © 2007 IEEE.

关键词： Interconnection networks

来源：评论

学校读者我要写书评

暂无评论

A reconfigurable computing engine for wavelet transforms

A reconfigurable computing engine for wavelet transforms

引用

21st International Parallel and Distributed processing symposium, IPDPS 2007

作者： Sun, Kang Pan, Xuezeng Ping, Lingdi College of Computer Science and Technology Zhejiang University Hangzhou 310027 China

ISBN: (纸本)1424409101

In the past a few years, wavelet transforms have become a hot topic of research. Discrete and continuous wavelet transforms have been widely used in signal and multimedia processing. Due to the high performance and flexibility of reconfigurable computing systems, it is very attractive to design a reconfigurable architecture for discrete and continuous wavelet transform of wide range of wavelet filters. In this paper, a unified computation framework for discrete and continuous wavelet transform based on lifting scheme and a reconfigurable architecture that includes reconfigurable lifting step arrays and reconfigurable address generator are proposed. The unified framework is the theory basis of this system. The step array is the computing core of this engine. And the address generator supports several memory scan pattern which is used to generate memory access addresses. In order to validate this architecture, an FPGA prototype is built based on Xilinx Virtexll FPGA to test the reconfiguration of 2-D discrete 5/3 and 9/7 transforms (defined in specification of JPEG2000) and 2-D continuous Haar wavelet transform. Furthermore, a 3-level decomposition for a 512×512 grayscale image is performed and the results show that the decomposition can be finished within 12.16ms when running at 20MHz. It can be concluded that this design is applicable and scalable. © 2007 IEEE.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

image magnification by a compact method with preservation of preferential components

Image magnification by a compact method with preservation of...

引用

21st symposium on Signal processing

作者： Hirabayashi, Akira Yamaguchi Univ Fac Engn Ube Yamaguchi 7558611 Japan

Bicubic interpolation is one of the standard approaches for image magnification since it can be easily computed and does not require a priori knowledge nor a complicated model. In spite of such convenience, the images enlarged by bicubic interpolation are blurry, in particular for large magnification factors. This may be explained by four constraints of bicubic interpolation. Hence, by relaxing or replacing the constraints, we propose a new magnification method, which performs better than bicubic interpolation, but retains its compactness. One of the constraints is about criterion, which we replace by a criterion requiring that all pixel values are reproduced and preferential components in input images are perfectly reconstructed. We show that, by choosing the low frequency components or edge enhancement components in the DCT basis as the preferential components, the proposed method performs better than bicubic interpolation, with the same, or even less amount of computation.

关键词： image enhancement image reconstruction interpolation

来源：评论

学校读者我要写书评

暂无评论

Hardware acceleration of terrain visualization using ef-buffers

引用

21st International symposium on computer and Information Sciences (ISCIS 2006)

作者： Chang, Hyun-Duk Shin, Byeong-Seok Inha Univ Dept Comp Sci & Informat Engn 253 Yonghyeon Dong Inchon 402751 South Korea

ISBN: (纸本)3540472428

Quadtree-based terrain visualization methods have been used in a lot of applications. However, because most procedures are performed on the CPU, the rendering speed is slow. In this paper, we present a quadtree-based terrain visualization method working on the GPU with specially designed data structure, the error-buffer and flag-buffer named ef-buffers. In pre-processing step, error metrics are computed in world space and the error metrics are transferred to the error-buffer. In rendering time, LOD selection and view-frustum culling are processed by evaluating the error metrics. The result is stored into the flag-buffer. To remove cracks or T-junction, the flag-buffer is refined. Then triangulation is performed using the flag-buffer. This method reduces CPU load and performs time consuming jobs such as LOD selection and view-frustum culling on the GPU. We can conclude that our method much faster than CPU-based rendering method without loss of image quality.

关键词： computer hardware

来源：评论

学校读者我要写书评

暂无评论

Neighborhood decomposition of convex structuring elements for mathematical morphology on hexagonal grid

引用

21st International symposium on computer and Information Sciences (ISCIS 2006)

作者： Ohn, Syng-Yup Hankuk Aviat Univ Dept Comp & Informat Engn Seoul South Korea

ISBN: (纸本)3540472428

In this paper, we present a new technique to find the optimal neighborhood decomposition for convex structuring elements used in morphological image processing on hexagonal grid. In neighborhood decomposition, a structuring element is decomposed into a set of neighborhood structuring elements, each of which consists of the combination of the origin pixel and its six neighbor pixels. Generally, neighborhood decomposition reduces the amount of computation required to perform morphological operations such as dilation and erosion. Firstly, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient condition to decompose a convex structuring element into the set of basis convex structuring elements. Secondly, decomposability of a convex structuring element into the set of primal bases is also proved. Furthermore, cost function is used to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. The decomposition condition and the cost function are applied to find the optimal neighborhood decomposition of a convex structuring element, which guarantees the minimal amount of computation for morphological operations. Example decompositions show that the decomposition results in great reduction in the amount of computation for morphological operations.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Low-Cost Hardening of image processing Applications Against Soft Errors

Low-Cost Hardening of Image Processing Applications Against ...

引用

IEEE International symposium on Defect and Fault Tolerance in VLSI Systems

作者： Ilia Polian Bernd Becker Masato Nakasato Satoshi Ohtake Hideo Fujiwara Graduate School of Information Science Nara Institute of Science and Technology Ikoma City Nara Japan Albert-Ludwigs-University Freiburg im Breisgau Germany

ISBN: (纸本)9780769527062;076952706X

image processing systems are increasingly used in safety-critical applications, and their hardening against soft errors becomes an issue. The authors propose a methodology to identify soft errors as uncritical based on their impact on the system's functionality. The authors call a soft error uncritical if its impact is provably limited to image perturbations during a very short period of time (number of cycles) and the system is guaranteed to recover thereafter. Uncritical errors do not require hardening as their effects are unperceivable for the human user of the system. The authors focus on soft errors in the motion estimation subsystem of MPEG-2 and introduce different definitions of uncritical soft errors in that subsystem. A method is proposed to automatically determine uncritical errors and provide experimental results for various parameters. The concept can be adapted to further systems and enhance existing methods

关键词： image processing Costs Radiation hardening Redundancy Circuits Silicon Frequency estimation Consumer electronics Switches computer errors

来源：评论

学校读者我要写书评

暂无评论

Configurable multiprocessors for high-performance MPEG4 video coding

Configurable multiprocessors for high-performance MPEG4 vide...

引用

21st International symposium on Lepton and Photon Interactions at High EnergiesIEEE-computer-Society Annual symposium on VLSI

作者： Chouliaras, VA Jacobs, TR Kumaraswamy, AK Univ Loughborough Loughborough Leics England

ISBN: (纸本)076952365X

We investigate the performance improvement of a multithreaded MPEG-4 video encoder executing on a configurable, extensible, SoC multiprocessor. Architecture-level results indicate a significant reduction in the dynamic instruction count of the order of 83% for 16 processor contexts compared to the original single-thread implementation. We extended an open-source 32-bit RISC CPU to include hardware-based multi-processing primitives and associated support state and implemented a parametric, bus-based SoC multiprocessor as the target platform for the threaded video encoder.

关键词： image coding

来源：评论

学校读者我要写书评

暂无评论

A deformable surface model on the basis of the Theory of a Cosserat Surface

A deformable surface model on the basis of the Theory of a C...

引用

17th brazilian symposium on computer graphics and image processing/2nd Ibero-American symposium on computer graphics

作者： Wu, st de Melo, VF Univ Estadual Campinas Elect & Comp Engn Fac BR-13083970 Campinas SP Brazil

ISBN: (纸本)0769522270

This paper aims at proposing an elastically deformable surface with use of differential geometric structures. On the basis of the Theory of a Cosserat Surface, a computationally processable equation that relates the accumulated elastic energy and the variations in the differential geometry variables (metric and curvature tensors) of the deformable surface is presented On the basis of our analysis, we propose a novel algorithm to compute more precisely, without compromising the interface's simplicity, the potential deformation energy in terms of the derivatives of the surface. With our proposal, we may maintain the finite difference scheme for computing deformations iteratively. Some simulation results are included.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：