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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

150 篇 会议
110 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

116 篇 工学
- 77 篇 计算机科学与技术...
- 58 篇 软件工程
- 16 篇 信息与通信工程
- 13 篇 控制科学与工程
- 9 篇 机械工程
- 9 篇 光学工程
- 9 篇 生物工程
- 8 篇 电气工程
- 6 篇 力学（可授工学、理...
- 6 篇 动力工程及工程热...
- 6 篇 化学工程与技术
- 5 篇 仪器科学与技术
- 5 篇 生物医学工程（可授...
- 4 篇 材料科学与工程（可...
- 4 篇 航空宇航科学与技...
- 4 篇 核科学与技术
- 3 篇 电子科学与技术（可...
108 篇 理学
- 79 篇 数学
- 24 篇 统计学（可授理学、...
- 23 篇 物理学
- 13 篇 系统科学
- 11 篇 生物学
- 6 篇 化学
24 篇 管理学
- 13 篇 管理科学与工程(可...
- 10 篇 工商管理
- 8 篇 图书情报与档案管...
5 篇 教育学
- 5 篇 教育学
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 3 篇 社会学
4 篇 医学

主题

48 篇 computer science
9 篇 shape
8 篇 cameras
8 篇 mathematics
8 篇 layout
7 篇 application soft...
7 篇 computational mo...
7 篇 polynomials
6 篇 video sequences
5 篇 object detection
5 篇 equations
5 篇 mathematical mod...
4 篇 lighting
4 篇 data mining
4 篇 algorithm design...
4 篇 artificial intel...
4 篇 testing
4 篇 boundary conditi...
4 篇 image reconstruc...
4 篇 cryptography

机构

21 篇 department of co...
6 篇 department of co...
5 篇 research centre ...
5 篇 department of ap...
4 篇 department of co...
4 篇 department of co...
4 篇 department of co...
4 篇 department of ap...
3 篇 department of ap...
3 篇 department of ma...
3 篇 laboratoire de m...
3 篇 department of ma...
3 篇 dept. of applied...
3 篇 department of ap...
3 篇 department of ap...
3 篇 department of ma...
3 篇 department of el...
2 篇 school of comput...
2 篇 applied math pro...
2 篇 dept. of applied...

作者

8 篇 naor moni
8 篇 m. irani
6 篇 krishnaswamy smi...
6 篇 srivastava gauta...
5 篇 irit dinur
5 篇 evangelos a. the...
5 篇 lin jerry chun-w...
5 篇 u. feige
5 篇 l. zelnik-manor
4 篇 r. basri
3 篇 tong alexander
3 篇 emo todorov
3 篇 feige u
3 篇 wolf guy
3 篇 uriel feige
3 篇 ptak marek
3 篇 huguet guillaume
3 篇 nešetřil jarosla...
3 篇 boscheri walter
3 篇 dinur irit

语言

256 篇 英文
6 篇 其他

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

共 262 条记录，以下是201-210 订阅

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

详细简洁

排序：

A chat room assignment for teaching network security

A chat room assignment for teaching network security

引用

32nd SIGCSE Technical Symposium on computer science Education

作者： Mitchener, W. Garrett Vahdat, Amin Applied and Computational Math Princeton University Princeton NJ United States Department of Computer Science Duke University Durham NC United States

This paper describes a chat room application suitable for teaching basic network programming and security protocols. A client/server design illustrates the structure of current scalable network services while a multicast version demonstrates the need for efficient simultaneous distribution of network content to multiple receivers (e.g., as required by video broadcasts). The system also includes implementations of two security protocols, one similar to Kerberos and another based on public key encryption.

关键词： Engineering education

来源：评论

学校读者我要写书评

暂无评论

Revocation and tracing schemes for stateless receivers?

引用

21st Annual International Cryptology Conference, CRYPTO 2001

作者： Naor, Dalit Naor, Moni Lotspiech, Jeff IBM Almaden Research Center 650 Harry Road San-JoseCA95120 United States Department of Computer Science and Applied Math Weizmann Institute Rehovot Israel

ISBN: (纸本)3540424563

We deal with the problem of a center sending a messageto a group of users such that some subset of the users is consideredrevoked and should not be able to obtain the content of the *** concentrate on the stateless receiver case, where the users do not(necessarily) update their state from session to session. We present aframework called the Subset-Cover framework, which abstracts a varietyof revocation schemes including some previously known ones. We pro-vide suficient conditions that guarantees the security of a revocationalgorithm in this *** describe two explicit Subset-Cover revocation algorithms;these algo-rithms are very flexible and work for any number of revoked users. Theschemes require storage at the receiver of logN and 12log2 N keys respec-tively (N is the total number of users), and in order to revoke r users therequired message lengths are of r logN and 2r keys respectively. We alsoprovide a general traitor tracing mechanism that can be integrated withany Subset-Cover revocation scheme that satisés a "bifurcation prop-erty". This mechanism does not need an a priori bound on the numberof traitors and does not expand the message length by much comparedto the revocation of the same set of *** main improvements of these methods over previously suggestedmethods, when adopted to the stateless scenario, are: (1) reducingthe message length to O(r) regardless of the coalition size whilemaintaining a single decryption at the user's end (2) provide aseamless integration between the revocation and tracing so that the trac-ing mechanisms does not require any change to the revocation algorithm. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Signal receivers

来源：评论

学校读者我要写书评

暂无评论

Event-based analysis of video

Event-based analysis of video

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： L. Zelnik-Manor M. Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)0769512720

Dynamic events can be regarded as long-term temporal objects, which are characterized by spatio-temporal features at multiple temporal scales. Based on this, we design a simple statistical distance measure between video sequences (possibly of different lengths) based on their behavioral content. This measure is non-parametric and can thus handle a wide range of dynamic events. We use this measure for isolating and clustering events within long continuous video sequences. This is done without prior knowledge of the types of events, their models, or their temporal extent. An outcome of such a clustering process is a temporal segmentation of long video sequences into event-consistent sub-sequences, and their grouping into event-consistent clusters. Our event representation and associated distance measure can also be used for event-based indexing into long video sequences, even when only one short example-clip is available. However, when multiple example-clips of the same event are available (either as a result of the clustering process, or given manually), these can be used to refine the event representation, the associated distance measure, and accordingly the quality of the detection and clustering process.

关键词： Video sequences Motion pictures Length measurement Dynamic range Indexing Information analysis Parametric statistics Stochastic processes computer science Event detection

来源：评论

学校读者我要写书评

暂无评论

Alignment of non-overlapping sequences

Alignment of non-overlapping sequences

引用

International Conference on computer Vision (ICCV)

作者： Y. Caspi M. Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)0769511430

This paper shows how two image sequences that have no spatial overlap between their fields of view can be aligned both in time and in space. Such alignment is possible when the two cameras are attached closely together and are moved jointly in space. The common motion induces "similar" changes over time within the two sequences. This correlated temporal behavior is used to recover the spatial and temporal transformations between the two sequences. The requirement of "coherent appearance" in standard image alignment techniques is therefore replaced by "coherent temporal behavior", which is often easier to satisfy. This approach to alignment can be used not only for aligning nan-overlapping sequences, but also for handling other cases that are inherently difficult for standard image alignment techniques. We demonstrate applications of this approach to three real-world problems: (i) alignment of non-overlapping sequences for generating wide-screen movies, (ii) alignment of images (sequences) obtained at significantly different zooms, for surveillance applications, and (iii) multi-sensor image alignment for multi-sensor fusion.

关键词： Cameras Image sequences Layout Robot vision systems computer science Motion pictures Surveillance Hardware

来源：评论

学校读者我要写书评

暂无评论

Secure multiparty computation of approximations

引用

28th International Colloquium on Automata, Languages and Programming, ICALP 2001

作者： Feigenbaum, Joan Ishai, Yuval Malkin, Tal Nissim, Kobbi Strauss, Martin J. Wright, Rebecca N. Yale University Computer Science Department New HavenCT06520-8285 United States DIMACS Center PiscatawayNJ United States AT & T Labs—Research 180 Park Avenue Florham ParkNJ07932 United States Weizmann Institute Dept. of Computer Science and Applied Math Rehovot Israel

ISBN: (纸本)3540422870

Approximation algorithms can sometimes provide effcient solutions when no efficient exact computation is known. In particular, approximations are often useful in a distributed setting where the inputs are held by different parties and are extremely large. Furthermore, for some applications, the parties want to cooperate to compute a function of their inputs without revealing more information than necessary. If f is an approximation to f, secure multiparty computation of f allows the parties to compute f without revealing unnecessary information. However, secure computation of f may not be as private as secure computation of f, because the output of f may itself reveal more information than the output of f. In this paper, we present definitions of secure multiparty approximate computations that retain the privacy of a secure computation of f. We present an efficient, sublinear-communication, private approximate computation for the Hamming distance and an efficient private approximation of the permanent. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

The immune system and other cognitive systems

引用

Complexity 2001年第5期6卷 14-21页

作者： Hershberg, Uri Efroni, Sol Interdisciplinary Center for Neuronal Computation Hebrew University Jerusalem Israel Computer Science and Applied Math Department Immunology Department Weizmann Institute of Science Rehovot Israel

来源：评论

学校读者我要写书评

暂无评论

A note on proximity spaces and connection based mereology 01

A note on proximity spaces and connection based mereology

引用

Formal Ontology in Information Systems: Collected Papers from the Second International Conference

作者： Vakarelov, Dimiter Düntsch, Ivo Bennett, Brandon Laboratory for Applied Logic Fac. of Math. and Computer Science Sofia University blvd James Bouchier 5 1126 Sofia Bulgaria Faculty of Informatics University of Ulster Newtownabbey BT 370QB United Kingdom School of Computing University of Leeds Leeds LS2 9JT United Kingdom Department of Computer Science Brock University St. Catherines Ont. L2S 3AI Canada

ISBN: (纸本)1581133774

Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann has demonstrated the fruitfulness of the methods of continuous lattices to obtain a topological representation theorem for his formalisation of Whiteheadian ontological theory of space;similar results have been obtained by Roeper. In this note, we prove a topological representation theorem for a connection based class of systems, using methods and tools from the theory of proximity spaces. The key novelty is a new proximity semantics for connection relations.

关键词： Information science

来源：评论

学校读者我要写书评

暂无评论

A step towards sequence-to-sequence alignment

A step towards sequence-to-sequence alignment

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Y. Caspi M. Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

The paper presents an approach for establishing correspondences in time and in space between two different video sequences of the same dynamic scene, recorded by stationary uncalibrated video cameras. The method simultaneously estimates both spatial alignment as well as temporal synchronization (temporal alignment) between the two sequences, using all available spatio-temporal information. Temporal variations between image frames (such as moving objects or changes in scene illumination) are powerful cues for alignment, which cannot be exploited by standard image-to-image alignment techniques. We show that by folding spatial and temporal cues into a single alignment framework, situations which are inherently ambiguous for traditional image-to-image alignment methods, are often uniquely resolved by sequence-to-sequence alignment. We also present a "direct" method for sequence-to-sequence alignment. The algorithm simultaneously estimates spatial and temporal alignment parameters directly from measurable sequence quantities, without requiring prior estimation of point correspondences, frame correspondences, or moving object detection. Results are shown on real image sequences taken by multiple video cameras.

关键词： Layout Cameras Video sequences Electrical capacitance tomography Lighting Spatial resolution Pixel computer science Space stations Image resolution

来源：评论

学校读者我要写书评

暂无评论

The estimate for the cost of a search tree constructed on an arbitrary set of binary words

The estimate for the cost of a search tree constructed on an...

引用

IEEE International Symposium on Information Theory

作者： A. Fedotov B. Ryabko Department of Information Technologies Institute of Computational Technologies SB RAS Novosibirsk Russia Department of Applied math and Cybernetics Siberian State University of Computer Science Novosibirsk Russia

Simple algorithm constructing search trees for the given set of binary words is presented. It is shown that the average cost of result of this algorithm, and, hence, the average cost of the optimum search tree is near... 详细信息

关键词： Cost function Binary search trees computer science Information technology Electronic mail Application software Biology NP-hard problem Cybernetics Art

来源：评论

学校读者我要写书评

暂无评论

Multi-view subspace constraints on homographies

Multi-view subspace constraints on homographies

引用

International Conference on computer Vision (ICCV)

作者： L. Zelnik-Manor M. Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

The motion of a planar surface between two camera views induces a homography. The homography depends on the camera intrinsic and extrinsic parameters, as well as on the 3D plane parameters. While camera parameters vary across different views, the plane geometry remains the same. Based on this fact, the paper derives linear subspace constraints on the relative motion of multiple (/spl ges/2) planes across multiple views. The paper has three main contributions. It shows that the collection of all relative homographies of a pair of planes (homologies) across multiple views, spans a 4-dimensional linear subspace. It shows how this constraint can be extended to the case of multiple planes across multiple views. It suggests two potential application areas which can benefit from these constraints: the accuracy of homography estimation can be improved by enforcing the multi-view subspace constraints; and violations of these multi-view constraints can be used as a cue for moving object detection. All the results derived in this paper are true for uncalibrated cameras.

关键词： Subspace constraints Cameras Layout Geometry Object detection Transmission line matrix methods computer science Calibration Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：