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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,295 篇 工学
- 1,184 篇 计算机科学与技术...
- 861 篇 软件工程
- 225 篇 信息与通信工程
- 169 篇 控制科学与工程
- 128 篇 电气工程
- 77 篇 电子科学与技术（可...
- 73 篇 生物医学工程（可授...
- 72 篇 生物工程
- 40 篇 建筑学
- 36 篇 动力工程及工程热...
- 35 篇 机械工程
- 34 篇 光学工程
- 29 篇 仪器科学与技术
- 29 篇 化学工程与技术
- 27 篇 力学（可授工学、理...
- 27 篇 土木工程
498 篇 理学
- 377 篇 数学
- 100 篇 物理学
- 77 篇 统计学（可授理学、...
- 75 篇 生物学
- 26 篇 化学
- 23 篇 系统科学
276 篇 管理学
- 168 篇 图书情报与档案管...
- 123 篇 管理科学与工程(可...
- 88 篇 工商管理
66 篇 教育学
- 64 篇 教育学
63 篇 医学
- 61 篇 临床医学
- 34 篇 基础医学(可授医学...
- 24 篇 药学(可授医学、理...
28 篇 法学
- 23 篇 社会学
18 篇 经济学
9 篇 农学
3 篇 军事学
1 篇 文学
1 篇 艺术学

主题

91 篇 mobile computing
73 篇 distributed comp...
70 篇 computer science
52 篇 grid computing
47 篇 application soft...
40 篇 concurrent compu...
39 篇 computational mo...
36 篇 computer network...
34 篇 computer archite...
32 篇 cloud computing
29 篇 virtual reality
29 篇 ubiquitous compu...
27 篇 internet
26 篇 costs
25 篇 laboratories
23 篇 peer to peer com...
23 篇 middleware
20 篇 parallel process...
20 篇 hardware
20 篇 delay

机构

20 篇 the hong kong po...
18 篇 hong kong polyte...
18 篇 department of co...
15 篇 school of comput...
15 篇 school of comput...
12 篇 institute of com...
12 篇 department of co...
10 篇 nit calicut
10 篇 depauw universit...
10 篇 national institu...
9 篇 school of comput...
8 篇 college of compu...
7 篇 school of comput...
7 篇 school of comput...
6 篇 university of lo...
6 篇 pablo de olavide...
6 篇 department of co...
6 篇 college of compu...
6 篇 department of co...
6 篇 school of comput...

作者

25 篇 hong va leong
18 篇 leong hong va
15 篇 alvin chan
12 篇 hong jiman
11 篇 hung chih-cheng
11 篇 chan alvin t.s.
10 篇 liu ling
10 篇 gloria childress...
10 篇 george roussos
8 篇 umesh bellur
8 篇 song enmin
7 篇 rajiv ramnath
7 篇 pu calton
7 篇 si antonio
7 篇 ahamed sheikh iq...
7 篇 chandran priya
6 篇 federico divina
6 篇 sheikh iqbal aha...
6 篇 madhu kumar s.d.
6 篇 raúl giráldez ro...

语言

2,067 篇 英文
6 篇 其他
3 篇 中文
2 篇 葡萄牙文

检索条件"任意字段=Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing"

共 2078 条记录，以下是2061-2070 订阅

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

详细简洁

排序：

Cryptography in NC/sup 0/

Cryptography in NC/sup 0/

引用

Annual IEEE symposium on Foundations of Computer Science

作者： B. Applebaum Y. Ishai E. Kushilevitz Computer Science Department Technion-Israel Institute of Technology Israel

We study the parallel time-complexity of basic cryptographic primitives such as one-way functions (OWFs) and pseudorandom generators (PRGs). Specifically, we study the possibility of computing instances of these primitives by NC/sup 0/ circuits, in which each output bit depends on a constant number of input bits. Despite previous efforts in this direction, there has been no significant theoretical evidence supporting this possibility, which was posed as an open question in several previous works. We essentially settle this question by providing overwhelming positive evidence for the possibility of cryptography in NC/sup 0/. Our main result is that every "moderately easy" OWF (resp., PRG), say computable in NC/sup 1/, can be compiled into a corresponding OWF (resp., low-stretch PRG) in NC/sub 4//sup 0/, i.e. whose output bits each depend on at most 4 input bits. The existence of OWF and PRG in NC/sup 1/ is a relatively mild assumption, implied by most number-theoretic or algebraic intractability assumptions commonly used in cryptography. Hence, the existence of OWF and PRG in NC/sup 0/ follows from a variety of standard assumptions. A similar compiler can also be obtained for other cryptographic primitives such as one-way permutations, encryption, commitment, and collision-resistant flashing. The above results leave a small gap between the possibility of cryptography in NC/sub 4//sup 0/, and the known impossibility of implementing even OWF in NC/sub 2//sup 0/. We partially close this gap by providing evidence for the existence of OWF in NC/sub 3//sup 0/. Finally, our techniques can also be applied to obtain unconditionally provable constructions of non-cryptographic PRGs. In particular, we obtain e-biased generators in NC/sub 3//sup 0/, resolving an open question posed by Mossel et al. (2003), as well as a PRG for logspace in NC/sup 0/. Our results make use of the machinery of randomizing polynomials which was originally motivated by questions in the domain of inform

关键词： Cryptography Computer science Circuits Chromium Machinery Polynomials Concurrent computing Concrete

来源：评论

学校读者我要写书评

暂无评论

Modulo scheduling of loops in control-intensive non-numeric programs 29

Modulo scheduling of loops in control-intensive non-numeric ...

引用

proceedings of the 29th annual acm/IEEE international symposium on Microarchitecture

作者： Daniel M. Lavery Wen-mei W. Hwu Center for Reliable and High-Performance Computing University of Illinois Urbana-Champaign IL

ISBN: (纸本)9780818676413

Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early exits. In control-intensive non-numeric programs, the loops frequently have characteristics that make it more difficult to effectively apply modulo scheduling. These characteristics include multiple control flow paths, loops that are not based on a loop counter, and multiple exits. In these loops, the presence of unimportant paths with high resource usage or long dependence chains can penalize the important paths. A path that contains a hazard such as another nested loop can prohibit modulo scheduling of the loop. Control dependences can severely restrict the overlap of the blocks within and across iterations. This paper describes a set of methods that allow effective modulo scheduling of loops with multiple exits. The techniques include removal of control dependences to enable speculation, extensions to modulo variable expansion, and a new epilogue generation scheme. These methods can be used with superblock and hyperblock techniques to allow modulo scheduling of the selected paths of loops with arbitrary control flow. A case study is presented to show how these methods, combined with superblock techniques, enable modulo scheduling to be effectively applied to control-intensive non-numeric programs. Performance results for several SPEC CINT92 benchmarks and Unix utility programs are reported and demonstrate the applicability of modulo scheduling to this class of programs.

关键词： control-intensive modulo scheduling modulo variable expansion instruction-level parallelism software pipelining speculation

来源：评论

学校读者我要写书评

暂无评论

Harmonic analysis via wavelet packet decomposition using special elliptic half-band filters

Harmonic analysis via wavelet packet decomposition using spe...

引用

IEEE Instrumentation and Measurement Technology Conference

作者： L. Eren M. Unal M.J. Devaney Department of Electrical and Electronics Engineering University of Bahcesehir Istanbul Turkey Department of Mathematics and Computer Sciences University of Bahcesehir Istanbul Turkey Department of Electrical and Computer Engineering University of Missouri Columbia Columbia MO USA

The Fast Fourier Transform is the most widely used power system harmonic analysis tool in real little power metering due to its computational efficiency. Recently, an alternate method, wavelet packet decomposition, has been applied to power system signals to meter voltage and current harmonics. Although the new method provides better analysis, the computational complexity of wavelet packet decomposition places a limitation on its use in real time metering. This paper proposes the use of all-pass implemented half-hand elliptic IIR filters in the wavelet packet decomposition of power system signals. The proposed implementation reduces the computational complexity to levels comparable to Fast Fourier Transform.

关键词： Harmonic analysis Wavelet analysis Wavelet packets Power system harmonics Power harmonic filters Fast Fourier transforms Power system analysis computing Computational complexity Computational efficiency Voltage

来源：评论

学校读者我要写书评

暂无评论

Test quality for high level structural test

Test quality for high level structural test

引用

IEEE International High-Level Design Validation and Test Workshop

作者： A. AI- Yamani E.J. McCluskey Center for Reliable Comput. Stanford Univ. CA USA TNT LSI Logic Corporation Milpitas CA USA Center for Reliable Computing Stanford University Stanford CA

Using complex (high-level) gates, such as multiplexers, full adders, etc., for automatic test pattern generation (ATPG) has several advantages. It makes A TPG faster and potentially reduces the size of the test set that needs to be applied. A variety of other techniques are used to reduce the size of test sets for digital chips. They typically rely on preserving the single-stuck-fault coverage of the test set. This paper presents data obtained from applying a variety of test sets on the ELF35 test chip and recording the test escapes. The data presented show the test quality effect of using complex gates as fault sites. The paper also shows the impact of test compaction and reduced fault coverage on the test quality.

关键词： Circuit faults Circuit testing Logic testing Automatic test pattern generation Chip scale packaging Libraries Large scale integration Adders Cyclic redundancy check Logic design

来源：评论

学校读者我要写书评

暂无评论

LZW-based code compression for VLIW embedded systems 04

LZW-based code compression for VLIW embedded systems

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Chang Hong Lin Yuan Xie W. Wolf Princeton University Princeton NJ USA Pennsylvania State University University Park PA USA

ISBN: (纸本)9780769520858

We propose a new variable-sized-block method for VLIW code compression. Code compression traditionally works on fixed-sized blocks and its efficiency is limited by the small block size. Branch blocks-instructions between two consecutive possible branch targets-provide larger blocks for code compression. We propose LZW - based algorithms to compress branch blocks. Our approach is fully adaptive and generates coding table on-the-fly during compression and decompression. When encountering a branch target, the coding table is cleared to ensure correctness. Decompression requires only a simple lookup and update when necessary. Our method provides 8 bytes peak decompression bandwidth and 1.82 bytes in average. Compared to Huffman's 1 byte and V2F's 13-bit peak performance, our methods have higher decoding bandwidth and comparable compression ratio. Parallel decompression could also be applied to our methods, which is more suitable for VLIW architecture.

关键词： VLIW Embedded system Decoding Bandwidth Costs Reduced instruction set computing Compression algorithms Instruments Huffman coding Dictionaries

来源：评论

学校读者我要写书评

暂无评论

Partial tag comparison: a new technology for power-efficient set-associative cache designs

Partial tag comparison: a new technology for power-efficient...

引用

International Conference on VLSI Design

作者： R. Min Zhiyong Xu Yiming Hu W.-B. Jone Department of Electrical & Computer Engineering and Computer Science University of Cincinnati Cincinnati OH USA

We call comparing a small part of two tags a Partial Comparison. In this paper, we show that the partial comparison method can filter out most of the unmatched tag comparisons for different cache configurations. The delay of the partial comparison operation is only 60% of that of the full comparison. This paper proposes to use the partial comparison technique to reduce energy dissipation on major cache components of set-associative caches. We show that when adaptive schemes based on partial comparison are applied to amplifiers and bit-lines, the power consumption of set-associative caches is similar to that of direct-mapped caches. We used the CACTI cache model to evaluate the proposed cache architecture and the Simplescalar CPU simulator to produce final results. The power simulation results suggest that the proposed set-associative cache architecture is very power-efficient. In the simulated cache configurations, 25%-60% of cache accessing energy was saved.

关键词： Technical Activities Guide -TAG Delay Energy consumption Decoding Multiplexing Signal design Phased arrays Power engineering computing Design engineering Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

A robust visual tracking system for patient motion detection in SPECT: hardware solutions

A robust visual tracking system for patient motion detection...

引用

IEEE symposium on Nuclear Science (NSS/MIC)

作者： P.P. Bruyant M.A. Gennert G.C. Speckert R.D. Beach J.D. Morgenstern N. Kumar S. Nadella M.A. King NIBIB PP Bruyant USA University of Massachusetts Worcester MA Worcester Polytechnic Institute Worcester MA USA Speck Technology Inc. Melrose MA USA SpeckTech Inc. Melrose MA University of Massachusetts Worcester MA USA

The goal of our project is to devise a robust method to track and compensate patient motion by combining an emission data based approach with a visual tracking system (VTS) that provides an independent estimate of motion. In a previous study, we used the Polaris infra-red system (NDI Inc., Ontario, Canada) as the gold standard to show that the VTS can accurately track motion without having the limitations of the Polaris. In the present work, we present the latest hardware configuration of the VTS and our solution for temporal synchronization between the SPECT and the optical acquisitions. The current version of the VTS includes stereo imaging with sets of optical network cameras with lighting, a SPECT/VTS calibration phantom, a black stretchable garment with reflective spheres to track chest motion, and a computer to control the cameras. The computer also stores the JPEG files generated by the optical cameras with timing synchronization to the list-mode acquisition of events on our SPECT system. Five Axis PTZ 2130 network cameras (Axis Communications AB, Lund, Sweden) were used to track motion of spheres with a highly retro-reflective coating using stereo methods. The calibration phantom is comprised of seven reflective spheres, and radioactivity can be added to the tip of the mounts holding the spheres. This phantom is used to determine the transformation to be applied to convert the motion detected by the VTS into the SPECT coordinates system. Synchronization is assessed in two ways. First, optical cameras are aimed at a digital clock and the elapsed time estimated by the cameras is compared to the actual time shown by the clock in the images. Synchronization is also assessed by moving a radioactive and reflective sphere three times during concurrent VTS and SPECT acquisitions and comparing the time at which motion occurred in the optical and SPECT images. The results show that optical and SPECT images stay synchronized within a 150 ms range. The 100Mbit network l

关键词： Robustness Tracking Motion detection Hardware Cameras Synchronization Imaging phantoms Calibration Computer networks Optical computing

来源：评论

学校读者我要写书评

暂无评论

An enhanced message exchange mechanism in cluster-based mobile ad hoc networks, 04

引用

proceedings of the Second international conference on Parallel and Distributed Processing and Applications

作者： Wei Lou Jie Wu Dept. of Computing Hong Kong Polytechnic University Kowloon Hong Kong Dept. of Computer Science and Engineering Florida Atlantic University Boca Raton Florida

ISBN: (纸本)9783540241287

In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper bounded clusterheads in any networks even in the worst case. Generally, clusterheads and selected gateways form a connected dominating set (CDS) of the network. This CDS forms the backbone of the network and can be used for routings (broadcasting/multicasting/unicating). As clusterheads need to determine the selected gateways to connect their adjacent clusterheads within the coverage set, they periodically collect 2-hop and 3-hop clusterhead information. These information can be gathered when they hear their non-clusterhead neighbors sending out messages that contain neighboring clusterhead information. These extra maintenance cost can be reduced when some enhanced mechanism is applied. In this paper, an enhanced mechanism is proposed to reduce the total length of the messages when non-clusterhead nodes exchange their 1-hop and 2-hop neighboring clusterhead information. Simulation shows that over 50% of message overhead can be saved for dense networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable HIL simulator with mixed real and virtual sensing capabilities

Scalable HIL simulator with mixed real and virtual sensing c...

引用

International Conference on Intelligent Transportation

作者： Z. Papp M. Dorrepaal D.J. Verburg M.R. Koopman A.H.C. Thean TNO Institute of Applied Physics TNO-TPD Delft Netherlands TNO Automotive Helmond Netherlands

The advance in intelligent vehicle systems (IVS) puts emphasis to vehicle-vehicle and vehicle-environment interactions. Sensing and sensory data interpretation play ever increasing role because sensing becomes the primary way of collecting information about the environment. In the IVS application domain the environment is unstructured, which results in demanding data interpretation and control algorithms. Similarly, the control and decision-making algorithms inevitably become more complex in order to be able to cope with the unstructured and dynamic environment. Consequently a sophisticated evaluation/test environment is required, which provides full control of the circumstances, reproducibility and flexible mix of real and virtual components. The paper presents the runtime architecture of the multi-agent based distributed HIL simulation environment (MARS), which assures scalable real-time performance and introduces an extension with high fidelity sensor simulation functionality.

关键词： Mars Computational modeling Intelligent vehicles Vehicle dynamics Reproducibility of results Runtime environment Virtual environment Distributed computing Automotive engineering Decision making

来源：评论

学校读者我要写书评

暂无评论

On the power of quantum proofs

On the power of quantum proofs

引用

Annual IEEE Conference on Computational Complexity

作者： R. Raz A. Shpilka Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot Israel

We study the power of quantum proofs, or more precisely, the power of quantum Merlin-Arthur (QMA) protocols, in two well studied models of quantum computation: the black box model and the communication complexity model. Our main results are obtained for the communication complexity model. For this model, we identify a complete promise problem for QMA protocols, the linear sub-spaces distance problem. The problem is of geometrical nature: each player gets a linear subspace of R/sup m/ and considers the sphere of unit vectors in that subspace. Their goal is to output 1 if the distance between the two spheres is very small (say, smaller than 0.1 /spl middot/ /spl radic/2) and 0 if the distance is very large (say, larger than 0.9 /spl middot/ /spl radic/2). We show that: 1. The QMA communication complexity of the problem is O(logm). 2. The (classical) MA communication complexity of the problem is /spl Omega/(m/sup /spl epsi//) (for some /spl epsi/ > 0). 3. The (standard) quantum communication complexity of the problem is /spl Omega/(/spl radic/m). In particular, this gives an exponential separation between QMA communication complexity and MA communication complexity. For the black box model we give several observations. First, we observe that the block sensitivity method, as well as the polynomial method for proving lower bounds for the number of queries, can both be extended to QMA protocols. We use these methods to obtain lower bounds for the QMA black box complexity of functions. In particular, we obtain a tight lower bound of /spl Omega/(N) for the QMA black box complexity of a random function, and a tight lower bound of /spl Omega/(/spl radic/N) for the QMA black box query complexity of NOR(X/sub 1/,..., X/sub n/). In particular, this shows that any attempt to give short quantum proofs for the class of languages Co - NP have to go beyond black box arguments. We also observe that for any Boolean function G(X/sub 1/,..., X/sub n/), if for both G and 7minus;G there ar

关键词： Complexity theory Quantum computing Protocols Mathematics Mathematical model Computational modeling Polynomials Boolean functions Radio access networks Computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 199 200 201 202 203 204 205 206 207 208 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：