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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,011 篇 期刊文献
1,888 篇 会议
32 篇 学位论文
4 篇 资讯

馆藏范围

3,935 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,544 篇 工学
- 1,690 篇 计算机科学与技术...
- 830 篇 电气工程
- 676 篇 软件工程
- 431 篇 信息与通信工程
- 209 篇 控制科学与工程
- 149 篇 电子科学与技术（可...
- 105 篇 交通运输工程
- 104 篇 机械工程
- 74 篇 土木工程
- 49 篇 石油与天然气工程
- 36 篇 建筑学
- 34 篇 仪器科学与技术
- 28 篇 测绘科学与技术
- 26 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 力学（可授工学、理...
- 24 篇 动力工程及工程热...
- 22 篇 环境科学与工程（可...
1,191 篇 理学
- 986 篇 数学
- 109 篇 物理学
- 79 篇 生物学
- 67 篇 系统科学
- 57 篇 统计学（可授理学、...
- 12 篇 化学
616 篇 管理学
- 587 篇 管理科学与工程(可...
- 80 篇 工商管理
- 17 篇 图书情报与档案管...
116 篇 经济学
- 86 篇 应用经济学
- 23 篇 理论经济学
41 篇 医学
- 17 篇 临床医学
29 篇 农学
13 篇 法学
10 篇 教育学
9 篇 文学
6 篇 艺术学
3 篇 军事学

主题

3,935 篇 integer linear p...
227 篇 optimization
226 篇 linear programmi...
170 篇 routing
164 篇 costs
114 篇 processor schedu...
113 篇 heuristic algori...
92 篇 scheduling
90 篇 computer science
89 篇 bandwidth
85 篇 energy consumpti...
79 篇 algorithm design...
77 篇 testing
75 篇 cost function
74 篇 resource managem...
72 篇 optical fiber ne...
71 篇 constraint optim...
71 篇 computational mo...
71 篇 telecommunicatio...
70 篇 delay

机构

12 篇 xidian univ sch ...
11 篇 macau univ sci &...
11 篇 naval postgradua...
10 篇 duke univ dept e...
9 篇 kyoto univ grad ...
9 篇 southwest jiaoto...
8 篇 nanyang technol ...
8 篇 kyoto univ grad ...
7 篇 beijing jiaotong...
7 篇 tech univ munich...
6 篇 macau univ sci &...
6 篇 wright state uni...
6 篇 polytech bari de...
6 篇 department of el...
6 篇 kyoto univ kyoto
6 篇 kyoto university...
6 篇 consejo nacl inv...
6 篇 univ massachuset...
6 篇 department of el...
5 篇 new jersey inst ...

作者

27 篇 oki eiji
18 篇 li zhiwu
15 篇 dao thanh hai
14 篇 sato takehiro
13 篇 de sousa amaro
12 篇 santos dorabella
11 篇 fanti maria pia
11 篇 delorme xavier
10 篇 hanzalek zdenek
10 篇 eiji oki
9 篇 maria pia fanti
9 篇 picelli renato
9 篇 dolgui alexandre
9 篇 mangini agostino...
9 篇 tomiyama hiroyuk...
9 篇 gouveia luis
8 篇 dauzere-peres st...
8 篇 soumya j.
8 篇 righini giovanni
8 篇 gomes teresa

语言

3,536 篇 英文
365 篇 其他
26 篇 中文
3 篇 土耳其文
2 篇 葡萄牙文
1 篇 西班牙文

检索条件"主题词=integer linear programming"

共 3935 条记录，以下是3581-3590 订阅

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

详细简洁

排序：

Low power memory design

Low power memory design

引用

13th IEEE International Conference on Applications-Specific Systems, Architectures and Processors

作者： Shiue, WT Oregon State Univ ECE Dept Corvallis OR 97331 USA

ISBN: (纸本)0769517129

In this paper, we present a novel design procedure for multi-module, multi-port memory design that satisfies area and/or energy/timing constraints. Our procedure consists of (i) use of Storage Bandwidth Optimization (SBO) techniques to simplify the conflict graph and (H) use of memory exploration techniques to determine the best memory configuration (number of modules, size and number of ports per module) with the minimum area if the energy and timing are bounded or with the minimum energy/timing if the area is bounded. Here the simplest conflict graph implies more possibilities for the arrays assigned to the same module without the penalty in an increase of the number of ports for each module. Our benchmark shows that the heuristic algorithm is very efficient to decide the best memory configuration for the system constraints (timing, area, or energy). In addition, the CACTI tool [14] is modified to estimate the timing, area, and energy for each module in different CMOS technologies (0. 8um. 0. 35um, and 0. 18um). Furthermore, we consider the lifetime for arrays;this results in the significant reduction in timing, area, and energy for the arrays executed in different cycles sharing the same memory module.

关键词： Bandwidth CMOS technology Concurrent computing Costs Delay Electrocardiography Energy storage Heuristic algorithms integer linear programming Timing

来源：评论

学校读者我要写书评

暂无评论

Routing and wavelength assignment in all optical networks to establish survivable lightpaths

Routing and wavelength assignment in all optical networks to...

引用

IEEE Region 10 Technical Conference on Computers, Communications, Control and Power Engineering

作者： Li, SF Tao, J Gu, GQ Southeast Univ Dept Comp Sci & Engn Nanjing 210096 Peoples R China

ISBN: (纸本)0780374908

In WDM optical networks it is critical that lightpaths are routed in a way that a single link failure would not disconnect the network. We call such a routing survivable and develop algorithm for survivable routing of a logical topology. We studied integer linear programming (ILP) formulation for the complete virtual topology design, including choice the, constituent lightpaths, routes for these lightpaths, and survivable.

关键词： integer linear programming RWA routing survivable WDM

来源：评论

学校读者我要写书评

暂无评论

A faster optimal register allocator 35

A faster optimal register allocator

引用

35th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Fu, CQ Wilken, K Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

ISBN: (纸本)0769518591

Recently. researchers have proposed modeling register allocation as an integer linear programming (IP) problem and solving it optimally for general purpose processors [17, 20] and for dedicated embedded systems [23]. Compared with traditional graph-coloring approaches, the IP-based allocators can improve a program's performance. However the solution times are much slower. This paper presents an IP-based optimal register allocator which is much faster than previous work. We present several local and global reduction techniques to identify locations in a program's control-flow graph where spill decisions and register deallocation decisions are unnecessary for optimal register allocation. We propose a hierarchical reduction approach to efficiently remove the corresponding redundant decisions and constraints front the IP model. This allocator is built into the Gnu C Compiler and is evaluated experimentally using the SPEC92INT benchmarks. The results show that the improved IP model is much simpler The number of constraints produced is almost linear with the function size. The optimal allocation time is much faster with a speedup factor of about 150 for hard allocation problems.

关键词： Computer architecture Degradation Embedded system Energy consumption integer linear programming Microarchitecture Optimizing compilers Program processors Registers

来源：评论

学校读者我要写书评

暂无评论

Compiling with code-size constraints 02

Compiling with code-size constraints

引用

Joint Conference on Languages, Compilers and Tools for Embeddded Systems/Software and Compilers for Embedded Systems (LCTES 02-SCOPES 02)

作者： Naik, M Palsberg, J Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)9781581135275

Most compilers ignore the problems of limited code space in embedded systems. Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code. Besides being tedious and error-prone, such optimization results in obfuscated code which is difficult to maintain and reuse. In this paper, we present a code-size-directed compiler. We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint. Our experiments show that our compiler, when applied to two commercial microcontroller programs, generates code as compact as carefully crafted code.

关键词： register allocation integer linear programming space optimization banked architecture

来源：评论

学校读者我要写书评

暂无评论

On using rectangle packing for SOC Wrapper/TAM co-optimization 20

On using rectangle packing for SOC Wrapper/TAM co-optimizati...

引用

20th IEEE VLSI Test Symposium (VTS 02)

作者： Iyengar, V Chakrabarty, K Marinissen, EJ Duke Univ Dept Elect & Comp Engn Durham NC 27708 USA

ISBN: (纸本)0769515703

The testing time for a system-on-chip (SOC) is determined to a large extent by the design of test wrappers and the test access mechanism (TAM). Wrapper/TAM co-optimization is therefore necessary for minimizing SOC testing time. We recently proposed an exact technique for co-optimization based on a combination of integer linear programming (ILP) and exhaustive enumeration. However, this approach is computationally expensive for large SOCs, and it is limited to fixed-width test buses. We present a new approach for wrapper/TAM co-optimization based on generalized rectangle packing, also referred to as two-dimensional packing. This approach allows us to decrease testing time by reducing the mismatch between a core's test data needs and the width of the TAM to which it is assigned. We apply our co-optimization technique to an academic benchmark SOC and three industrial SOCs. Compared to the ILP-based technique, we obtain lower or comparable testing times for two out of the three industrial SOCs. Moreover, we obtain more than two orders of magnitude decrease in the CPU time needed for wrapper/TAM co-design.

关键词： Benchmark testing Design engineering Design optimization integer linear programming Laboratories Logic testing Pins System testing System-on-a-chip Wires

来源：评论

学校读者我要写书评

暂无评论

Test wrapper and test access mechanism co-optimization for system-on-chip

Test wrapper and test access mechanism co-optimization for s...

引用

IEEE European Test Workshop (ETW 01)

作者： Iyengar, V Chakrabarty, K Marinissen, EJ Duke Univ Dept Elect & Comp Engn Durham NC 27708 USA Philips Res Labs NL-5656 AA Eindhoven Netherlands

Test access mechanisms (TAMs) and test wrappers are integral parts of a system-on-chip SOC) test architecture. Prior research has concentrated on only one aspect of the TAM/wrapper design problem at a time, i.e., either optimizing the TAMs for a set of pre-designed wrappers, or optimizing the wrapper for a given TAM width. In this paper, we address a more general problem, that of carrying out TAM design and wrapper optimization in conjunction. We present an efficient algorithm to construct wrappers that reduce the testing time for cores. Our wrapper design algorithm improves on earlier approaches by also reducing the TAM width required to achieve these lower testing times. We present new mathematical models for TAM optimization that use the core testing time values calculated by our wrapper design algorithm. We further present a new enumerative method for TAM optimization that reduces execution time significantly when the number of TAMs being designed is small. Experimental results are presented for an academic SOC as well as an industrial SOC.

关键词： embedded core testing test access mechanism (TAM) test wrapper testing time integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Radioabsorbing material optimal using in the reduction of aircraft radar cross-section 9

Radioabsorbing material optimal using in the reduction of ai...

引用

International Conference on Mathematical Methods in Electromagnetic Theory (MMET 02)

作者： Vasilets, VA Gorelyshev, SA Tkachuk, KI Kharkov Mil Univ Kharkov Ukraine

ISBN: (纸本)078037391X

It's well known, local scattering parts on a smooth convex object elements make the most important contribution to reflected signal energy. So these surface parts of complex shape objects are coated by radioabsorbing materials (RM) in camouflage purpose. As a rule, the radioabsorbing coating (RC) has the sizeable weight and the, cost. In this, case the problem of optimal using of RM on the object surface has been occurred. The optimal coating method for the reduction of radar cross-sect ion (RCS) has been obtained for a certain illumination and reception directions in limitation conditions for a quantity of the RC using. Optimal coating has been realized due to decision of some integer linear programming problem. Using this method we have had RCS numerical results for reductive aircraft model partly coated by RM.

关键词： Aerospace materials Aircraft manufacture Azimuth Coatings Frequency integer linear programming Lighting Military aircraft Radar cross section Radar scattering

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of 100% resilient all-optical WDM networks based on mesh and multi-ring approaches using joint optimization technique

Design and analysis of 100% resilient all-optical WDM networ...

引用

Workshop on High Performance Switching and Routing (HPSR2002)

作者： Boworntummarat, C Thanakomsakorn, P Tirasirikul, W Wuttisittikulkij, L Segkhoonthod, S Chulalongkorn Univ Fac Engn Dept Elect Engn Bangkok 10330 Thailand

ISBN: (纸本)488552184X

This paper presents a comprehensive investigation of a wide range of protection strategies against all single link failures in all-optical WDM networks based on mesh and multi-ring architectures. In the mesh architecture, three protection strategies, namely, minimal cost, single link basis and disjoint path protection strategies are investigated. In the multi-ring architecture, the distribution and non-distribution traffic multi-ring design strategies are extensively examined. Although, the concepts of mesh and multi-ring designs have previously been perceived to be fundamentally different, in this paper we shall explain and show that these two architectures can be systematically related and viewed as a unified concept. This new way of looking at the fully survivable network design helps understand clearly the mechanisms and performance of each protection strategy. To minimize the system cost of 100% protection WDM networks, mathematical models based on the integer linear programming (ILP) are derived as the tool for achieving optimal path placement, wavelength assignment and ring selection simultaneously. Apart from the mathematical model, the main contributions of this paper are the analysis and comparison in aspects of the spare capacity requirement and ease of operation and practical feasibility amongst these protection strategies. However, the emphasis will be on the multi-ring protection schemes. In addition, the influence of the number of multiplexed wavelengths per fiber to design outcomes and the benefit of having wavelength conversion capability in WDM network environment are also studied.

关键词： wavelength division multiplexing resilient network mesh-based design multi-ring design integer linear programming

来源：评论

学校读者我要写书评

暂无评论

New results on array contraction [memory optimization]

New results on array contraction [memory optimization]

引用

IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2002

作者： Darte, A. Huard, G. ENS-Lyon 46 Allée d'Italie Lyon69007 France

ISBN: (纸本)0769517129

Array contraction is an optimization that transforms array variables into scalar variables within a loop. While the opposite transformation, scalar expansion, is used for enabling parallelism (with a penalty in memory size), array contraction is used to save memory by removing temporary arrays and to increase locality. Several heuristics have already been proposed to perform array contraction through loop fusion and/or loop shifting, but thus far, the complexity of the problem was unknown, and no exact approach was available. In this paper, we prove two NP-complete results that characterize precisely the problem and we give a practical integer linear programming formulation to solve the problem exactly. © 2002 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal selection of Army military construction projects

Optimal selection of Army military construction projects

引用

作者： Dzwonchyk, James D. Naval Postgraduate School

学位级别：硕士

The Assistant Chief of Staff for Installation Management (ACSIM) manages all Army military construction (MILCON) implementation and requests. Annually, the ACSIM submits a prioritized list of MILCON projects requiring Congressional approval. Typically, Congress does not approve all Army requests. This thesis develops an integer linear program, PESA (Project Evaluation and Selection Assistant), to assist the ACSIM evaluate and select the best set of MILCON projects under various policies and budgets; thus assisting ACSIM develop a defendable set of MILCON projects to submit to Congress. Using a budget of $600 million (funds allocated in fiscal year 2001) and data for 62 projects for fiscal year 2001, we recommend funding a set of 50 projects that adhere to the following: fund each Major Army Command's projects in priority; limit each Major Army Command to less than 25% of the total budget; and use at least 80% of the total budget on the worst condition facilities. We demonstrate how this set of 50 projects better adheres to Army policies than those that would be recommended by the current Army technique.

关键词： Military Construction Project Selection integer linear programming Optimization Facilities Optimal Funding

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 355 356 357 358 359 360 361 362 363 364 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：