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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,477 篇 工学
- 843 篇 计算机科学与技术...
- 640 篇 软件工程
- 230 篇 信息与通信工程
- 173 篇 控制科学与工程
- 152 篇 电气工程
- 147 篇 仪器科学与技术
- 140 篇 电子科学与技术（可...
- 136 篇 生物工程
- 114 篇 动力工程及工程热...
- 105 篇 土木工程
- 103 篇 机械工程
- 103 篇 生物医学工程（可授...
- 86 篇 建筑学
- 86 篇 核科学与技术
- 83 篇 光学工程
- 76 篇 化学工程与技术
- 53 篇 航空宇航科学与技...
947 篇 理学
- 364 篇 数学
- 355 篇 物理学
- 160 篇 生物学
- 126 篇 地球物理学
- 118 篇 统计学（可授理学、...
- 95 篇 化学
- 79 篇 系统科学
333 篇 管理学
- 226 篇 管理科学与工程(可...
- 133 篇 工商管理
- 115 篇 图书情报与档案管...
100 篇 医学
- 94 篇 临床医学
- 73 篇 基础医学(可授医学...
56 篇 法学
- 50 篇 社会学
49 篇 经济学
31 篇 农学
30 篇 教育学
7 篇 艺术学
5 篇 军事学
3 篇 文学
2 篇 哲学
1 篇 历史学

主题

151 篇 computer archite...
106 篇 hadron colliders
55 篇 hardware
45 篇 artificial intel...
44 篇 computer science
43 篇 application soft...
43 篇 computational mo...
32 篇 optimization
31 篇 deep learning
31 篇 neutrons
31 篇 delay
29 篇 laboratories
28 篇 w & z bosons
27 篇 parallel process...
27 篇 genetic algorith...
27 篇 feature extracti...
26 篇 electronic mail
26 篇 neural networks
26 篇 machine learning
25 篇 internet of thin...

机构

151 篇 centro brasileir...
150 篇 national and kap...
150 篇 istanbul technic...
150 篇 yerevan physics ...
149 篇 university of sp...
148 篇 universidad iber...
147 篇 indian institute...
147 篇 charles universi...
146 篇 brunel universit...
145 篇 academy of scien...
143 篇 university of de...
142 篇 rwth aachen univ...
141 篇 imperial college...
139 篇 università di to...
139 篇 department of ph...
136 篇 infn sezione di ...
136 篇 zhejiang univers...
132 篇 department of ph...
131 篇 université de st...
131 篇 indian institute...

作者

146 篇 ardid m.
132 篇 ferrara g.
114 篇 coleiro a.
113 篇 kalekin o.
113 篇 díaz a.f.
110 篇 g. tonelli
110 篇 d. barney
110 篇 l. valencia palo...
110 篇 t. liu
110 篇 c. hensel
110 篇 a. garcia-bellid...
110 篇 a. steen
110 篇 n. cartiglia
110 篇 n. colino
110 篇 f. moortgat
110 篇 b. clerbaux
109 篇 a. babaev
109 篇 v. karjavine
109 篇 g. sultanov
109 篇 m. a. ciocci

语言

2,289 篇 英文
86 篇 其他
36 篇 中文
1 篇 法文
1 篇 斯洛文尼亚文
1 篇 土耳其文

检索条件"机构=Department of Computer Architecture and Computer Technology"

共 2413 条记录，以下是1931-1940 订阅

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

详细简洁

排序：

Scaling the Performance of Tiled Processor architectures with On-Chip-Network Topology

Scaling the Performance of Tiled Processor Architectures wit...

引用

The Second International Joint Conference on Computational Science and Optimization(CSO 2009)(2009 国际计算科学与优化会议)

作者： Yongqing Ren Hong An Ming Cong Guang Xu Li Wang Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 100080 China

The trend in wire delays due to resistance is becoming a significant problem for microprocessor designers, forcing radically new tiled microprocessor architecture designs. This type of architecture will necessarily incorporate on-chip networks topology. This paper examines a few of the possible on-chip network topology in the context of tiled processor architectures. Firstly, by investigating some proposed tiled processor architecture, we observe that the on-chip network interconnecting is the critical design point in the architectures. After that, we discuss the candidate topologies of on-chip network topology that satisfy these properties. Finally, a detailed experimental evaluation of these networks topology is presented to highlight the scalability and performance of these tiled processor architectures. Results show that we can achieve performance improvement by modifying basic mesh appropriately according to the granularity of the tile within technology restrictions.

关键词： Tiles Network topology Wire Network-on-a-chip Microprocessors Delay Switches computer architecture Process design Registers

来源：评论

学校读者我要写书评

暂无评论

The Description of Properties of Vector-Valued Wavelet Packets with Six-scale

The Description of Properties of Vector-Valued Wavelet Packe...

引用

WRI World Congress on Software Engineering, WCSE

作者： Ruohui Liu Jialong Peng Department of Computer Science Huanghuai University Zhumadian China School of Science Xi'an University of Architecture and Technology Xi'an China

ISBN: (纸本)9781424435661

Wavelet analysis is an active research subject for twenty years. In this paper, the notion of orthogonal vector-valued wavelet packets in higher dimensions is introduced. A procedure for constructing them is presented. Their properties are investigated by using time-frequency analysis method, matrix theory and finite group theory. Orthogonality formulas are established.

关键词： Wavelet packets Wavelet analysis Software engineering computer science Variable speed drives Time frequency analysis Mathematics Signal processing Image coding Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Spike-based control monitoring and analysis with Address Event Representation

Spike-based control monitoring and analysis with Address Eve...

引用

ACS/IEEE International Conference on computer Systems and Applications

作者： A. Jimenez-Fernandez A. Linares-Barranco R. Paz-Vicente G. Jimenez-Moreno R. Berner Department Computer Architecture and Technology Universidad de Sevilla Seville Spain Institute of Neuroinformatics Eth Zurich Zurich Switzerland

Neuromorphic engineering tries to mimic biological information processing. Address-event representation (AER) is a neuromorphic communication protocol for spiking neurons between different chips. We present a new way to drive robotic platforms using spiking neurons. We have simulated spiking control models for DC motors, and developed a mobile robot (Eddie) controlled only by spikes. We apply AER to the robot control, monitoring and measuring the spike activity inside the robot. The mobile robot is controlled by the AER-Robot tool, and the AER information is sent to a PC using the USBAERmini2 interface.

关键词： Monitoring Communication system control Robot control Neurons Biological system modeling Mobile robots Neuromorphic engineering Information processing Mobile communication Protocols

来源：评论

学校读者我要写书评

暂无评论

Target coverage problem in wireless sensor networks: A column generation based approach

Target coverage problem in wireless sensor networks: A colum...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Yu Gu Jie Li Baohua Zhao Yusheng Ji Department of Computer Science and Technology University of Science and Technology Hefei Anhui China Department of Computer Science University of Tsukuba Tsukuba Ibaraki Japan Information Systems Architecture Science Research Division National Institute of Information Tokyo Japan

ISBN: (纸本)9781424451142

Target coverage problem in wireless sensor networks remains a challenge. Due to nonlinear nature, previous work has mainly focused on heuristic algorithms, which remain difficult to characterize and have no performance guarantee. To solve the problem, this paper offers two important contributions. The first contribution is to have two lifetime upper bounds, which could be used to justify performance of previously proposed heuristic algorithms. One upper bound is based on the relaxation and reformulation technique while the other is derived by relaxing coverage constraints. We study the interesting connection between those two bounds and thus endow them with physical meanings. The second contribution is proposing a column generation based (CG) approach. The objective is to find an optimal schedule, defined as a time table specifying from what time up to what time which sensor watches which targets while the maximum lifetime has been obtained. We also offer an in-depth theoretic analysis as well as several novel techniques to further optimize the approach. Numerical results not only demonstrate that the lifetime upper bounds are very tight, but also verify that the proposed CG based approach constantly yields the optimal or near optimal solution.

关键词： Wireless sensor networks Network coding Feedback Wireless networks Encoding computer science Decoding computer network reliability Wireless LAN Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs 09

Detecting and Eliminating Potential Violations of Sequential...

引用

International Symposium on Code Generation and Optimization (CGO)

作者： Yuelu Duan Xiaobing Feng Lei Wang Chao Zhang Pen-Chung Yew Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences Beijing China Department of Computer Science and Engineering University of Minnesota Twin-Cities Minneapolis USA

ISBN: (纸本)9780769535760

When a concurrent shared-memory program written with a sequential consistency (SC) model is run on a machine implemented with a relaxed consistency (RC) model, it could cause SC violations that are very hard to debug. To avoid such violations, programmers need to provide explicit synchronizations or insert fence instructions. In this paper, we propose a scheme to detect and eliminate potential SC violations by combining Shasha/Snir's conflict graph and delay set theory with existing data race detection techniques. For each execution, we generate a race graph, which contains the improperly synchronized conflict accesses, called race accesses, and race cycles formed with those accesses. As a race cycle would probably lead to a non-sequential-consistent execution, we call it a potential violation of sequential consistency (PVSC) bug. We then compute the race delays of race cycles, and suggest programmers to insert fences into source code to eliminate PVSC bugs. We further convert a race graph into a PC race graph, and improves cycle detection and race delay computation to O(n 2 ), where n is the number of race access instructions. We evaluate our approach with the SPLASH-2 benchmarks, two large real-world applications (MySQL and Apache), and several multi-threaded Cilk programs. The results show that (1) the proposed approach could effec-tively detect PVSC bugs in real-world applications with good scalability; (2) it retains most of the performance of the concurrent program after inserting required fence instructions, with less than 6.3% performance loss; and (3) the additional cost of our approach over traditional race detection techniques is quite low, with 3.3% on average.

关键词： Programming profession Delay Set theory computer bugs Performance loss Chaos computer science Laboratories Concurrent computing computer architecture

来源：评论

学校读者我要写书评

暂无评论

Fundamental Results on Target Coverage Problem in Wireless Sensor Networks

Fundamental Results on Target Coverage Problem in Wireless S...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Yu Gu Yusheng Ji Jie Li Baohua Zhao Department of Computer Science and Technology University of Science and Technology Hefei Anhui China Information Systems Architecture Science Research Division National Institute of Information Tokyo Japan Department of Computer Science University of Tsukuba Tsukuba Ibaraki Japan

The target coverage problem is one of the most fundamental challenges in wireless sensor networks. Due to the complexity of the problem (time-dependent network topology and coverage constraints), previous studies have mainly focused on heuristic algorithms and the theoretical bound remains unknown. In this paper, we aim to fill in this gap by providing fundamental results. First, we investigate the properties of a problem in time domain via an example topology and build a novel transformation to connect a problem in the time domain with a corresponding problem in the space domain while maintaining the same network lifetime. Based on this transformation, we mathematically formulate the problem and build a column-generation based algorithm, which decomposes the original formulation into two sub-formulations and iteratively solves them in a way that approaches the optimal solution. We prove that the network lifetime that can be guaranteed by the proposed algorithm is at least (1-¿) of the optimum, where ¿ can be made arbitrarily small depending on the required precision.

关键词： Wireless sensor networks Heuristic algorithms computer science Network topology Iterative algorithms Laboratories Information systems computer architecture Informatics Cities and towns

来源：评论

学校读者我要写书评

暂无评论

A stochastic method for controlling the scaling parameters of Cauchy mutation in fast evolutionary programming

A stochastic method for controlling the scaling parameters o...

引用

Congress on Evolutionary Computation

作者： Yunji Chen Ke Tang Tianshi Chen Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Nature Inspired Computation and Applications Laboratory Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

The fast evolutionary programming (FEP) introduced the Cauchy distribution into its mutation operator, thus the performances of EP were promoted significantly on a number of benchmark problems. However, the scaling parameter of the Cauchy mutation is invariable, which has become an obstacle for FEP to reach better performance. This paper proposes and analyzes a new stochastic method for controlling the variable scaling parameters of Cauchy mutation. This stochastic method collects information from a group of individuals randomly selected from the population. Empirical evidence validates our method to be very helpful in promoting the performance of FEP.

关键词： Stochastic processes Genetic mutations Genetic programming Laboratories Random variables Gaussian distribution Control systems Stochastic systems computer architecture computer applications

来源：评论

学校读者我要写书评

暂无评论

CORDIC instruction set extensions for matrix decompositions on Software Defined Radio processors

CORDIC instruction set extensions for matrix decompositions ...

引用

Asilomar Conference on Signals, Systems & computers

作者： Murugappan Senthilvelan Mihai Sima Daniel Iancu Javier Hormigo Michael Schulte Sandbridge Technologies Inc. Tarrytown NY USA Department of Electrical and Computer Engineering University of Wisconsin Madison Madison WI USA Department of Electrical and Computer Engineering University of Victoria Victoria BC Canada Tampere University of Technology Tampere Finland Department of Computer Architecture University of Malaga Malaga Spain

ISBN: (纸本)9781424458257

Software Defined Radio (SDR) is favored by the wireless industry as the platform of choice for implementing physical layers of wireless protocols due to its significant benefits of reduced development costs and accelerated time-to-market. However, to attain high spectral efficiency, emerging wireless protocols use increasingly complex two-dimensional techniques that are extremely expensive to implement using conventional Digital Signal Processor (DSP) instruction sets. In this paper, we present COordinate Rotation DIgital computer (CORDIC) instruction set extensions that speed up the QR Decomposition (QRD) and Singular Value Decomposition (SVD) of complex matrices that are used in several important communication algorithms. The performance benefits are evaluated on the Sandbridge Sandblaster SB3000 low-power, multithreaded SDR processor. The proposed instructions provide significant performance improvements with little hardware overhead, while improving the accuracy of the wireless algorithms under investigation.

关键词： Matrix decomposition Software radio Wireless application protocol Signal processing algorithms computer industry Physical layer Costs Acceleration Time to market Digital signal processors

来源：评论

学校读者我要写书评

暂无评论

On reducing uplift payment in electricity markets

On reducing uplift payment in electricity markets

引用

IEEE PES Power Systems Conference and Exposition, PSCE

作者： Bingjie Zhang Peter B. Luh Eugene Litvinov Tongxin Zheng Feng Zhao Department of Electrical and Computer Engineering University of Connecticut Storrs CT USA New England ISO Systems Architecture and Technology Holyoke MA USA

In current U.S. deregulated wholesale electricity markets, an auction mechanism that minimizes the total bid cost is used to select bids and their output levels. Energy market clearing prices (MCPs) are derived from the shadow prices associated with the system demand constraints in an economic dispatch process with fixed unit commitment status. Therefore they do not reflect no-load and start-up costs, resulting in the uplift payments. To reduce such side payments and improve the market transparency, the ldquoconvex hull pricing modelrdquo is adopted, and ldquoonline capacity constraintsrdquo are introduced to the energy market, requiring the total online capacities to be greater than or equal to the system demand. With the associated multipliers serving as uniform ldquono-load clearing prices,rdquo the total uplift payment is proved to be reduced based on optimality conditions for multipliers. Numerical examples support the analytical results and shed insights on different types of uplift payments.

关键词： Electricity supply industry Pricing Cost function Lagrangian functions Power generation economics Linear programming Electricity supply industry deregulation Power generation ISO Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

Web Service Selection Algorithm Based on Particle Swarm Optimization

Web Service Selection Algorithm Based on Particle Swarm Opti...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Hong Xia Yan Chen Zengzhi Li Haichang Gao Yanping Chen Institute of Computer System Architecture and Network Xi'an Jiaotong University Xi'an China Software Engineering Institute Xidian University Xi'an China Department of Computer Science and Technology Xi'an Institute of Post and Telecommunications Xi'an China

A novel multi-objective optimization based particle swarm optimization algorithm is presented to solve the global optimization problem for based services selecting in Web services composition technology. This algorithm takes Web services selection as a multi-objective constrained optimization problem with constraints. It introduces multi-objective PSO intelligent theory to optimize multi parameters simultaneously, and produces a set of constraints to meet the Pareto optimal solution. The experiments show that the algorithm is a feasible and efficient method for Web services selection.

关键词： Web services Particle swarm optimization Quality of service Constraint optimization computer networks Software algorithms Service oriented architecture Linear programming Optimization methods Telecommunication computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共242页 << < 190 191 192 193 194 195 196 197 198 199 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：