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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

63 篇 会议
47 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

63 篇 工学
- 35 篇 计算机科学与技术...
- 32 篇 软件工程
- 15 篇 控制科学与工程
- 8 篇 信息与通信工程
- 8 篇 生物工程
- 6 篇 光学工程
- 4 篇 力学（可授工学、理...
- 4 篇 机械工程
- 4 篇 电气工程
- 4 篇 生物医学工程（可授...
- 3 篇 动力工程及工程热...
- 3 篇 化学工程与技术
- 3 篇 石油与天然气工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 核科学与技术
49 篇 理学
- 23 篇 数学
- 16 篇 物理学
- 14 篇 系统科学
- 10 篇 生物学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
13 篇 管理学
- 8 篇 管理科学与工程(可...
- 5 篇 工商管理
- 4 篇 图书情报与档案管...
- 2 篇 公共管理
4 篇 医学
- 2 篇 临床医学
- 2 篇 公共卫生与预防医...
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学
1 篇 经济学
1 篇 农学

主题

10 篇 computer science
5 篇 control systems
4 篇 mathematics
4 篇 testing
4 篇 equations
3 篇 fuzzy logic
3 篇 qubits
3 篇 inverse problems
3 篇 educational inst...
3 篇 convergence
3 篇 diffusion proces...
3 篇 computational mo...
3 篇 optimal control
3 篇 mathematical mod...
3 篇 robustness
3 篇 cost function
2 篇 noise reduction
2 篇 nasa
2 篇 regulators
2 篇 application soft...

机构

4 篇 department of co...
4 篇 institute of app...
4 篇 department of co...
4 篇 department of co...
4 篇 research centre ...
3 篇 department of ma...
3 篇 department of ma...
3 篇 department of el...
2 篇 school of comput...
2 篇 electrical and c...
2 篇 national researc...
2 篇 department of ap...
2 篇 departments of c...
2 篇 department of co...
2 篇 department of el...
2 篇 mathematics depa...
2 篇 department of co...
2 篇 department of ap...
2 篇 school of comput...
2 篇 department of co...

作者

6 篇 srivastava gauta...
5 篇 evangelos a. the...
5 篇 lin jerry chun-w...
4 篇 yangquan chen
4 篇 yan li
4 篇 ma shiqian
3 篇 emo todorov
2 篇 yang yifan
2 篇 reyes edel garci...
2 篇 r. basri
2 篇 lei ying
2 篇 leon javier lama...
2 篇 sekeh salimeh ya...
2 篇 i. shimshoni
2 篇 li jiaxiang
2 篇 isozaki hiroshi
2 篇 diaz rocio gonza...
2 篇 ruan da
2 篇 xiaohan kang
2 篇 da ruan

语言

104 篇 英文
6 篇 其他
1 篇 西班牙文

检索条件"机构=Department of Computer Engineering and Applied Math"

共 110 条记录，以下是101-110 订阅

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

详细简洁

排序：

A study of the sensitivity of automatic image registration algorithms to initial conditions

A study of the sensitivity of automatic image registration a...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： J. Le Moigne J. Morisette A. Cole-Rhodes K. Johnson N.S. Netanyahu R. Eastman H. Stone I. Zavorin P. Jain NASA/GSFC-Code 935 Applied Information Sciences Branch Greenbelt MD USA Electrical & Computer Engineering Department Morgan State University Baltimore MD USA Loyola College Baltimore MD USA UMBC/GEST Center GSFC Greenbelt MD USA Center For Automation Research University of Maryland College Park MD USA Department Math. & Comp.Sc. Bar-llan University Ramat-Gan Israel Laboratory for Terrestrial Physics Code 923 NASA''s Goddard Space Flight Center Greenbelt MD USA NASA Goddard Space Flight Center-Code 586 Greenbelt MD USA Electrical & Comp. Engineering Department Morgan State University Baltimore MD USA

While automatic image registration algorithms are usually being evaluated with regards to their accuracy, it is often useful to relate this accuracy to the "initial conditions", i.e., the distance between the initial navigation geolocation and the correct result. This paper describes a modular framework that was built to describe registration algorithms, and utilize this framework to attempt to classify different registration components and algorithms in terms of their responses to the initial conditions. Performances would be evaluated on synthetic data, multitemporal and multisensor data. All results of the study would be presented at the conference and would be useful for two different purposes: (1) provide automatic quality assessment of the geolocation of remote sensing data by performing interalgorithm consistency studies; and (2) be the foundations for the design of future on-board applications including planetary exploration.

关键词： Image registration Navigation NASA Performance evaluation Educational institutions Quality assessment Remote sensing Testing Laboratories Physics

来源：评论

学校读者我要写书评

暂无评论

On the (In)security of the Fiat-Shamir paradigm

On the (In)security of the Fiat-Shamir paradigm

引用

Annual IEEE Symposium on Foundations of computer Science

作者： S. Goldwasser Y.T. Kalai Department of Computer Science and Electrical Engineering Massachusetts Institute of Technology USA Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

In 1986, Fiat and Shamir proposed a general method for transforming secure 3-round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of the verifier in the identification scheme, with the value of some deterministic hash function evaluated on various quantities in the protocol and on the message to be signed. The Fiat-Shamir methodology for producing digital signature schemes quickly gained popularity as it yields efficient and easy to implement digital signature schemes. The most important question however remained open: are the digital signatures produced by the Fiat-Shamir methodology secure? We answer this question negatively. We show that there exist secure 3-round public-coin identification schemes for which the Fiat-Shamir transformation yields insecure digital signature schemes for any hash function used by the transformation. This is in contrast to the work of Pointcheval and Stern which proved that the Fiat-Shamir methodology always produces digital signatures secure against chosen message attack in the "Random Oracle Model" - when the hash function is modeled by a random oracle. Among other things, we make new usage of Barak's technique for taking advantage of nonblack-box access to a program, this time in the context of digital signatures.

关键词： Digital signatures Protocols computer science Law Legal factors Cryptography Design methodology computer security Forgery Cost function

来源：评论

学校读者我要写书评

暂无评论

Arbitrary source models and Bayesian codebooks in rate-distortion theory

Arbitrary source models and Bayesian codebooks in rate-disto...

引用

IEEE International Symposium on Information Theory

作者： L. Kontoyiannis Junshan Zhang Division of Applied Math & Department of Computer Science Brown University USA Department of Electrical Engineering Arizona State University USA

We give a development of universal lossy data compression based on a lossy version of the Kraft inequality. As an application, we evaluate the performance of universal mixture codebooks.

关键词： Bayesian methods Rate-distortion Distortion measurement Decoding World Wide Web Loss measurement computer science Data compression Application software Probability distribution

来源：评论

学校读者我要写书评

暂无评论

Fractal-wavelet image denoising

Fractal-wavelet image denoising

引用

IEEE International Conference on Image Processing

作者： M. Ghazel G.H. Freeman E.R. Vrscay Elect. & Computer Engineering Department University of Waterloo Waterloo ONT Canada Applied Math Department University of Waterloo Waterloo ONT Canada

We propose a simple yet effective fractal-wavelet scheme for edge-preserving smoothing of noisy images. Over the past decade, there has been significant interest in fractal coding for the purpose of image compression. Fractal-wavelet transforms were introduced in an effort to reduce the blockiness and computational complexity that are inherent in fractal image compression. Applications of fractal-based coding to other aspects of image processing, however, have received little attention. The authors proposed a simple yet effective fractal-based image denoising scheme that is applied in the spatial domain of the image. We extend the application of this fractal denoising scheme to the wavelet domain of the image. We find that when the wavelet transform of the noisy image is simply fractally coded, a significant amount of the noise is suppressed. However, one can go a step further and estimate the fractal code of the wavelet transform of the original noise-free image from that of the wavelet transform of the noisy image. The use of the quadtree partitioning scheme for the purpose of fractal-wavelet coding results in a significantly enhanced and restored representation of the original noisy image. The enhancement is consistent with the human visual system where extra smoothing is performed in flat and low activity regions and a lower degree of smoothing is performed near high frequency components, e.g. edges, of the image. The main advantage of the wavelet-based fractal denoising scheme over the standard fractal denoising scheme is that it is computationally less expensive.

关键词： Fractals Image denoising Image coding Smoothing methods Noise reduction Wavelet transforms Computational complexity Image processing Wavelet domain Image restoration

来源：评论

学校读者我要写书评

暂无评论

Asynchronous resource discovery in peer to peer networks

Asynchronous resource discovery in peer to peer networks

引用

Reliable Distributed Systems

作者： S. Kutten D. Peleg Faculty of Industrial Engineering & Management Technion-Israel Institute of Technology Haifa Israel Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet site). A vertex (peer) can communicate with another vertex directly if and only if it knows a certain routing information to that other vertex. Hence, it is critical for peers to convey this routing information to each other. The problem was formalized by Harchol-Balter et al. (1999). The routing information needed for a vertex to reach another peer is that peer's identifier (e.g., IP address). A logical directed edge represents the fact that the peer at the tail of the edge knows the IP address of the one at its head. A number of algorithms were developed by Harchol-Balter et al. for this problem in the model of a synchronous network over a weakly connected directed graph. The best of these algorithms was randomized. Subsequently, a deterministic algorithm for the problem on synchronous networks with improved complexity was presented by Kutten et al. (2001). The current paper extends this deterministic algorithm to the environment of asynchronous networks, maintaining similar complexities (translated to the asynchronous model). These are lower than the complexities that would be needed to synchronize the system. The main technical difficulty in a directed, weakly connected system is to ensure that vertices take consistent steps, even if their knowledge about each other is not symmetric, and even if there is no timeout mechanism (which does exist in synchronous systems) to assist in that.

关键词： Intelligent networks Routing Web server IP networks Context Tail Peer to peer computing Internet computer industry computer network management

来源：评论

学校读者我要写书评

暂无评论

An approach to a fuzzy color detection method, robust with regard to variable illuminant level conditions

An approach to a fuzzy color detection method, robust with r...

引用

Conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： S. Romani E. Montseny P. Sobrevilla Computer Eng. and Math. Department St Pere i Sant Pau Tarragona Spain Computer Engineering and Industrial Systems Department Technical University of Catalonia Barcelona Spain Applied Mathematics II Department Technical University of Catalonia Barcelona Spain

We propose a method for characterizing a set of training colors, based on sample color pixels captured with a camera. The system tries to detect the training colors on test pixels within images captured under illumination level conditions different from those used in the training process. The training color characterization is based on Smith's perceptual color model, but using only hue and saturation components. Both, training and classification processes make use of fuzzy techniques to assume vagueness involved within training and test data.

关键词： Robustness Lighting Humans Layout computer vision Image color analysis Pixel computer industry mathematics Industrial training

来源：评论

学校读者我要写书评

暂无评论

Shape reconstruction of 3D bilaterally symmetric surfaces

Shape reconstruction of 3D bilaterally symmetric surfaces

引用

International Conference on Image Analysis and Processing

作者： I. Shimshoni Y. Moses M. Lindenbaumlpr Department of Industrial Engineering & Management Technion-Israel Institute of Technology Haifa Israel Department of Applied Math Weizmann Institute of Science Rehovot Israel Department of Computer Science Technion-Israel Institute of Technology Haifa Israel

The paper presents a new approach for shape recovery based on integrating geometric and photometric information. We consider 3D objects which are symmetric with respect to a plane (e.g., faces) and their reconstruction from a single image. Both the viewpoint and the illumination are not necessarily frontal. In principle, no correspondence between symmetric points is required, but knowledge about a few corresponding pairs accelerates the process. The basic idea is that an image taken from a general, non-frontal viewpoint, under non-frontal illumination can be regarded as a pair of images of half of the object, taken from two different viewing positions and two different lighting directions. We show that integrating the photometric and geometric information yields the unknown lighting and viewing parameters, as well as dense correspondence between pairs of symmetric points. As a result, a dense shape recovery of the object is computed. The method has been implemented and tested experimentally on simulated and real data.

关键词： Shape Surface reconstruction Electrical capacitance tomography Image reconstruction Photometry Lighting computer science Programmable logic arrays Read only memory Neutron spin echo

来源：评论

学校读者我要写书评

暂无评论

Image-based robot navigation under the perspective model

Image-based robot navigation under the perspective model

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： R. Basri E. Rivlin I. Shimshoni Department of Applied Math Weizmann Institute of Science Rehovot Israel Department of Computer Science Technion-Israel Institute of Technology Haifa Israel Department of Ind. Engineering and Mgmt. Technion-Israel Institute of Technology Haifa Israel

In a previous paper (1998) we presented a method for image-based navigation by which a robot can navigate to desired positions and orientations in 3D space specified by single images taken from these positions. In this paper we further investigate the method and develop robust algorithms for navigation assuming the perspective projection model. In particular, we develop a tracking algorithm that exploits our knowledge of the motion performed by the robot at every step. This algorithm allows us to maintain correspondences between frames and eliminate false correspondences. We combine this tracking algorithm with an iterative optimization procedure to accurately recover the displacement of the robot from the target. Our method for navigation is attractive since it does not require a 3D model of the environment. We demonstrate the robustness of our method by applying it to a six degree of freedom robot arm.

关键词： Navigation Orbital robotics Robustness Iterative algorithms Target tracking computer science Robot vision systems Cameras Career development Visual servoing

来源：评论

学校读者我要写书评

暂无评论

Generalized output regulation for linear systems

Generalized output regulation for linear systems

引用

American Control Conference (ACC)

作者： A. Saberi A.A. Stoorvogel Zongli Lin School of Electrical Engineering and Computer Science Washington State University Pullman WA USA Department of Mathematics and Computing Science Eindhovan University of Technology Eindhoven Netherlands Department of Applied Math and Statistics State University of New York Stony Brook Stony Brook NY USA

One of the most important problems in linear multivariable control theory is that of controlling a given plant in order to have its output track (or reject) a reference (or disturbance) signal produced by some external generator, called the exosystem. The disturbance or reference contains only the frequency components of the exosystem. This is called the output regulation problem. We generalize the problem framework in several directions. One is to model disturbances and references by an exosystem that is not, unlike the traditional approach, autonomous but is driven. Another direction is to incorporate the derivative information in the problem formulation. Consequently, we formulate two classes of generalized exact and almost output regulation problems. We provide solvability conditions and the solutions to these problems. Finally, and most importantly, we show that if solvability conditions for regulation are not satisfied, one can design a regulator to achieve "best" tracking (or rejection) of reference (or disturbance) signal is any desired induced norm sense.

关键词： Linear systems Differential equations State feedback Output feedback Regulators Stability Closed loop systems mathematics computer science Statistics

来源：评论

学校读者我要写书评

暂无评论

Free bits, PCPs and non-approximability-towards tight results

Free bits, PCPs and non-approximability-towards tight result...

引用

Annual IEEE Symposium on Foundations of computer Science

作者： M. Bellare O. Goldreich M. Sudan Department of Computer Science & Engineering University of California San Diego La Jolla CA USA Computer Science and Applied Math. Department Weizmann Institute of Science Rehovot Israel IBM Research Division IBM Thomas J. Watson Research Center Yorktown Heights NY USA

The first part of this paper presents new proof systems and improved non-approximability results. In particular we present a proof system for NP using logarithmic randomness and two amortized free bits, so that Max clique is hard within N/sup 1/3/ and chromatic number within N/sup 1/5/. We also show hardness of 38/37 for Max-3-SAT, 27/26 for vertex cover, 82/81 for Max-cut, and 94/93 for Max-2-SAT. The second part of this paper presents a "reverse" of the FGLSS connection by showing that an NP-hardness result for the approximation of Max clique to within a factor of N/sup 1/(g+1/) would imply a probabilistic verifier for NP with logarithmic randomness and amortized free-bit complexity g. We also show that "existing techniques" won't yield proof systems of less than two bits in amortized free bit complexity. Finally, we initiate a comprehensive study of PCP and FPCP parameters, proving several triviality results and providing several useful transformations.

关键词： computer science Postal services Drives Cities and towns Error correction codes Polynomials History

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共11页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：