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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

610 篇 会议
32 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

551 篇 工学
- 495 篇 计算机科学与技术...
- 283 篇 软件工程
- 224 篇 电子科学与技术（可...
- 184 篇 电气工程
- 91 篇 信息与通信工程
- 36 篇 控制科学与工程
- 34 篇 动力工程及工程热...
- 24 篇 机械工程
- 15 篇 生物工程
- 12 篇 仪器科学与技术
- 9 篇 建筑学
- 9 篇 土木工程
- 8 篇 冶金工程
- 8 篇 化学工程与技术
- 7 篇 材料科学与工程（可...
- 7 篇 生物医学工程（可授...
- 6 篇 测绘科学与技术
- 4 篇 光学工程
- 3 篇 农业工程
199 篇 理学
- 165 篇 数学
- 34 篇 物理学
- 19 篇 统计学（可授理学、...
- 16 篇 生物学
- 8 篇 系统科学
- 6 篇 化学
54 篇 管理学
- 46 篇 管理科学与工程(可...
- 30 篇 工商管理
- 9 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 8 篇 社会学
3 篇 农学
2 篇 教育学
1 篇 医学

主题

295 篇 field programmab...
172 篇 field programmab...
65 篇 clocks
64 篇 signal processin...
64 篇 estimation
63 篇 modulation
63 篇 ofdm
63 篇 filtration
30 篇 fpga
8 篇 routing
8 篇 optimization
8 篇 field-programmab...
7 篇 fpgas
7 篇 systolic arrays
7 篇 high-level synth...
7 篇 hardware
7 篇 field-programmab...
7 篇 reconfigurable c...
5 篇 programmable log...
5 篇 logic gates

机构

6 篇 univ of toronto ...
5 篇 university of to...
5 篇 univ of toronto
5 篇 univ of californ...
5 篇 altera corporati...
5 篇 intel corporatio...
4 篇 univ british col...
4 篇 tsinghua univers...
4 篇 dept. of cs 256-...
4 篇 department of el...
4 篇 imperial college...
4 篇 nanyang technol ...
3 篇 computer science...
3 篇 department of ee...
3 篇 georgia inst tec...
3 篇 department of el...
3 篇 nanyang technol ...
3 篇 xilinx inc. san ...
3 篇 politecn milan d...
3 篇 school of comput...

作者

20 篇 rose jonathan
20 篇 cong jason
11 篇 betz vaughn
10 篇 wawrzynek john
10 篇 chen deming
9 篇 dehon andré
9 篇 hauck scott
9 篇 zhang zhiru
8 篇 wilton steven j....
8 篇 schmit herman
7 篇 constantinides g...
7 篇 chow paul
7 篇 langhammer marti...
6 篇 wilton steven j....
6 篇 pasca bogdan
6 篇 kiah han mao
6 篇 li fei
5 篇 anderson jason h...
5 篇 dehon andre
5 篇 cheung peter y. ...

语言

635 篇 英文
7 篇 其他

检索条件"任意字段=Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays"

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

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

详细简洁

排序：

Age of Information: Design and Analysis of Optimal Scheduling Algorithms

Age of Information: Design and Analysis of Optimal Schedulin...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Hsu, Yu-Pin Modiano, Eytan Duan, Lingjie Natl Taipei Univ Dept Commun Engn New Taipei Taiwan MIT Lab Informat & Decis Syst Cambridge MA 02139 USA Singapore Univ Technol & Design Engn Syst & Design Pillar Singapore Singapore

ISBN: (纸本)9781509040964

Age of information is a newly proposed metric that captures delay from an application layer perspective. The age measures the amount of time that elapsed from the moment the mostly recently received update was generated until the present time. In this paper, we study an age minimization problem over a wireless broadcast network with many users, where only one user can be served at a time. We formulate a Markov decision process (MDP) to find dynamic transmission scheduling schemes, with the purpose of minimizing the long-run average age. While showing that an optimal scheduling algorithm for the MDP is a simple stationary switch-type, we propose a sequence of finite-state approximations for our infinite-state MDP and prove its convergence. We then propose both optimal off-line and on-line scheduling algorithms for the finite-approximate MDPs, depending on knowledge of time-varying arrivals.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Uniprior Index Coding

Uniprior Index Coding

引用

IEEE international symposium on Information Theory (ISIT)

作者： Mareedu, Vijaya Kumar Krishnan, Prasad Int Inst Informat Technol Signal Proc & Commun Res Ctr Hyderabad Andhra Prades India

ISBN: (纸本)9781509040964

The index coding problem is a problem of efficient broadcasting with side-information. In uniprior index coding, the sets of side-information symbols possessed by different receivers are disjoint. For single uniprior index coding, in which each receiver has a single unique side-information symbol, a polynomial complexity construction of an optimal index code is known from prior work. In this work, we model the uniprior index coding problem as a supergraph, and focus on a class of uniprior problems defined on special supergraphs known as generalized cycles in which the sizes of the demand set and the side-information set are equal at each receiver. For such problems, we prove upper and lower bounds on the optimal broadcast rate. Using a connection with Eulerian directed graphs, we also show that the upper and lower bounds are equal for a subclass of uniprior problems. We show the NP-hardness of finding the lower bound for uniprior problems on generalized cycles, hence contrasting such uniprior problems with single uniprior problems. Finally, we look at a simple extension of the generalized cycle uniprior class for which we give bounds on the optimal rate and show an explicit scheme which achieves the upper bound.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Binary Subblock Energy-Constrained Codes: Bounds on Code Size and Asymptotic Rate

Binary Subblock Energy-Constrained Codes: Bounds on Code Siz...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Tandon, Anshoo Kiah, Han Mao Motani, Mehul Natl Univ Singapore Singapore Singapore Nanyang Technol Univ Singapore Singapore

ISBN: (纸本)9781509040964

The subblock energy-constrained codes (SECCs) have recently been shown to be suitable candidates for simultaneous energy and information transfer, where bounds on SECC capacity were presented for communication over noisy channels. In this paper, we study binary SECCs with given error correction capability, by considering codes with a certain minimum distance. Binary SECCs are a class of constrained codes where each codeword is partitioned into equal sized subblocks, and every subblock has weight exceeding a given threshold. We present several upper and lower bounds on the optimal SECC code size, and also derive the asymptotic Gilbert-Varshamov (CV) and sphere-packing hounds for SECCs. A related class of codes are the heavy weight codes (HWCs) where the weight of each codeword exceeds a given threshold. We show that for a fixed subblock length, the asymptotic rate for SECCs is strictly lower than the corresponding rate for HWCs when the relative distance of the code is small. The rate gap between HWCs and SECCs denotes the penalty due to imposition of weight constraint per subblock, relative to the codeword based weight constraint.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-Time Capability of Meteotsunami Detection by WERA Ocean Radar System 18

Real-Time Capability of Meteotsunami Detection by WERA Ocean...

引用

18th international Radar symposium (IRS)

作者： Dzvonkovskaya, Anna Petersen, Leif Insua, Tania L. Helzel Messtech GmbH Kaltenkirchen Germany Univ Victoria Ocean Networks Canada Victoria BC Canada

ISBN: (纸本)9783736993433

High-frequency (HF) ocean radar systems have demonstrated their capability to capture the signal from tsunami currents after the 2011 Tohoku earthquake and tsunami. However, these systems were configured for mapping surface currents in the coastal zones and not for detecting specific patterns of tsunami waves in real-time. The WERA (R) ocean radar system was optimized for tsunami alerting and installed for real-time tsunami monitoring at the coast of Tofino, British Columbia, Canada. If the shelf extends tens of kilometers off the coast then the first appearance of tsunami waves can be monitored early enough to issue an alert message. On 14 October 2016, the WERA system detected strong changes in measured radial currents at distances up to 60 km off the coast and triggered an alert immediately. The system tracked the unusual current pattern in real-time following the wave propagation coincided with an atmospheric cold frontal passage. No earthquake occurred at that time but strong storm currents caused most likely by remnants of typhoon Songda were the most likely reason for the detection. This localized event seems to be the combination of the strong currents caused by the typhoon, the storm surge, and a large wave that could be classified as a meteorological tsunami (meteotsunami). This detection showed the capability of the radar to measure unusual surface current velocities induced by tsunami waves. The real-time detection and alerting on this tsunami-like current have shown a good applicability of HF phased-array radar technology for offshore tsunami monitoring and navigation safety.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Rate 1/3 Index Coding: Forbidden and Feasible Configurations

Rate 1/3 Index Coding: Forbidden and Feasible Configurations

引用

IEEE international symposium on Information Theory (ISIT)

作者： Lalitha, V. Krishnan, Prasad Int Inst Informat Technol SPCRC Hyderabad Andhra Prades India

ISBN: (纸本)9781509040964

Linear index coding can be formulated as an interference alignment problem, in which precoding vectors of the minimum possible length are to be assigned to the messages in such a way that the precoding vector of a demand (at some receiver) is independent of the space of the interference (non side-information) precoding vectors. An index code has rate 1/l if the assigned vectors are of length l. In this paper, we introduce the notion of strictly rate 1/L message subsets which must necessarily be allocated precoding vectors from a strictly L-dimensional space (L = 1, 2, 3) in any rate 1/3 code. We develop a general necessary condition for rate 1/3 feasibility using intersections of strictly rate 1/L message subsets. We apply the necessary condition to show that the presence of certain interference configurations makes the index coding problem rate 1/3 infeasible. We also obtain a class of index coding problems, containing certain interference configurations, which are rate 1/3 feasible based on the idea of contractions of an index coding problem. Our necessary conditions for rate 1/3 feasibility and the class of rate 1/3 feasible problems obtained subsume all such known results for rate 1/3 index coding.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

The Zero-Error Capacity of a Collision Channel With Successive Interference Cancellation

The Zero-Error Capacity of a Collision Channel With Successi...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Zhang, Yijin Chen, Yi Lo, Yuan-Hsun Wong, Wing Shing Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing Jiangsu Peoples R China Southeast Univ Natl Mobile Communicat Res Lab Nanjing Jiangsu Peoples R China Shenzhen Res Inst Big Data Shenzhen Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen Peoples R China Xiamen Univ Sch Math Sci Xiamen Peoples R China Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China

ISBN: (纸本)9781509040964

The collision channel without feedback (CCw/oFB) model depicts a scenario in which multiple users share a communication channel with random relative time offsets among their clocks. This paper considers an extension of this model, which allows the receiver to use successive interference cancellation (SIC) to iteratively cancel the interference caused by those collided packets that have been decoded by the receiver. We derive the zero-error capacity region of this channel in the slot synchronous case, and present a zero-error capacity achieving scheme by joint protocol sequences and channel coding design. It is shown that the negative impact on the zero-error capacity due to a lack of time synchronization can be removed by SIC.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Lowest Density MDS Array Codes of Column Distance 4

Efficient Lowest Density MDS Array Codes of Column Distance ...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Huang, Zhijie Jiang, Hong Xiao, Nong Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Guangdong Peoples R China Univ Texas Arlington Dept Comp Sci & Engn Arlington TX 76010 USA

ISBN: (纸本)9781509040964

The extremely strict code length constraint is the main drawback of lowest density, maximum-distance separable (MDS) array codes of distance greater than 3. To break away from the status quo, we proposed in [5] a family of lowest density MDS array codes of (column) distance 4, called XI-Code. Compared with the previous alternatives, XI-Code has lower encoding and decoding complexities, and much looser constraint on the code length, thus is much more practical. In this paper, we present a new family of lowest density MDS array codes of (column) distance 4, called R Lambda-Code, which is derived from XI-Code, and outperforms the latter substantially in terms of encoding complexity, decoding complexity, and memory consumption during encoding/decoding. The inherent connection between R Lambda-Code and XI-Code and how the former is derived from the latter may provide inspiration for the readers to derive new codes from other existing codes in a similar way.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Rate-Loss Reduction of SC-LDPC Codes by Optimizing Reliable Variable Nodes via Expected Graph Evolution

Rate-Loss Reduction of SC-LDPC Codes by Optimizing Reliable ...

引用

IEEE international symposium on Information Theory (ISIT)

作者： Kwak, Heeyoul Kim, Jaewha No, Jong-Seon Seoul Natl Univ INMC Dept Elect & Comp Engn Seoul 08826 South Korea

ISBN: (纸本)9781509040964

The outstanding decoding performance of spatially coupled low-density parity-check (SC-LDPC) codes comes from wave-like propagation of reliable messages. The reliable messages are triggered by shortened (known) variable nodes in some consecutive reliable positions. However, at the cost of the improvement, shortened variable nodes cause rate-loss of SC-LDPC codes. To reduce the rate-loss, additional variable nodes (so called reliable variable nodes) can be added to the reliable positions instead of shortened variable nodes. Density evolution (DE) is an efficient method to design degree distribution of the reliable variable nodes. However, degree distributions obtained by DE show degraded performance in finite-length code performance. In this paper, we generalize the expected graph evolution and use the analysis tool in optimizing degree distribution which shows the minimum rate-loss without finite-length performance degradation. From the well-designed degree distribution, rate loss reduction by 60% can he achieved without finite-length performance degradation.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

GPU-Accelerated High-Level Synthesis for Bitwidth Optimization of FPGA Datapaths 16

GPU-Accelerated High-Level Synthesis for Bitwidth Optimizati...

引用

acm/sigda international symposium on field-programmable gate arrays (FPGA)

作者： Kapre, Nachiket Ye, Deheng Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)9781450338561

Bitwidth optimization of FPGA datapaths can save hardware resources by choosing the fewest number of bits required for each datapath variable to achieve a desired quality of result. However, it is an NP-hard problem that requires unacceptably long runtimes when using sequential CPU-based heuristics. We show how to parallelize the key steps of bitwidth optimization on the GPU by performing a fast brute-force search over a carefully constrained search space. We develop a high-level synthesis methodology suitable for rapid prototyping of bitwidth-annotated RTL code generation using gcc's GIMPLE backend. For range analysis, we perform parallel evaluation of sub-intervals to provide tighter bounds compared to ordinary interval arithmetic. For bitwidth allocation, we enumerate the different bitwidth combinations in parallel by assigning each combination to a GPU thread. We demonstrate up to 10-1000x speedups for range analysis and 50-200x speedups for bitwidth allocation when comparing NVIDIA K20 GPU implementation to an Intel Core i5-4570 CPU while maintaining identical solution quality across various benchmarks. This allows us to generate tailor-made RTL with minimum bitwidths in hundreds of milliseconds instead of hundreds of minutes when starting from high-level C descriptions of dataflow computations.

关键词： field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Democratisation of the SmartGrid and the Active Participation of Prosumers 26

Democratisation of the SmartGrid and the Active Participatio...

引用

26th IEEE international symposium on Industrial Electronics (ISIE)

作者： Pitt, Jeremy Diaconescu, Ada Bourazeri, Aikaterini Imperial Coll London Exhibit Rd London SW7 2BT England Paris Saclay Univ Telecom ParisTech IMT 46 Rue Barrault F-75634 Paris 13 France Coventry Univ Gosford St Coventry CV1 5DD W Midlands England

ISBN: (纸本)9781509014125

We observe that SmartGrids are an example of a crossover point where cyber-physical systems meet socio-technical systems. However, control of this crossover point, in the form of a peer-to-peer platform, is a contentious issue. We argue that if the platform is 'closed' it can lead to an asymmetry in the distribution of power and information that can inhibit successful collective action. Instead, an 'open' platform is required: this entails the 'democratisation' of the SmartGrid by unbundling the SmartMeter and enabling a prosumer-centric ICT layer. This ICT layer can support, for example, collective action through the self-management and distribution of both data and energy, various forms of self-organisation and governance, and the promotion and preservation of values. This argument generalises to other socio-technical/cyber-physical systems, for example for architecture, urban mobility and other infrastructure management. Therefore we conclude that to encourage active participation of citizens in different roles, in order to help communities address collective action problems or self-organise local arrangements, then we need open, participatory platforms which represent values congruently, distribute power fairly, and manage knowledge transparently.

关键词： Estimation field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：