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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是3601-3610 订阅

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

详细简洁

排序：

Multi-domain mesh optical network protection using Hamiltonian cycles

Multi-domain mesh optical network protection using Hamiltoni...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Hong Huang J.A. Copeland Comm System Centre School of Electrical & Computer Engineering Georgia Institute of Technology Atlanta GA USA

Designing simple and efficient network protection mechanism is an important requirement of optical networks, which is a challenging task for large mesh networks. We extend our previous work on Hamiltonian cycle protection to large-scale multiple domain inhomogeneous optical networks. We proposed two protection schemes with different trade-off between spare resource usage and failure isolation. Our proposed schemes are simple and competitive in network resource usage.

关键词： Optical fiber networks Protection Optical design Telecommunication traffic Traffic control SONET Mesh networks Large-scale systems Optimization methods integer linear programming

来源：评论

学校读者我要写书评

暂无评论

WDM network optimization by ILP based on source formulation

WDM network optimization by ILP based on source formulation

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： M. Tomatore G. Maier A. Pattavina CoreCom Milan Italy CoreCom Via Ampere Milan Italy Dept. of Electronics and Information Politecnico di Milano Milan Italy

Efficient planning and optimization of wavelength division multiplexing networks is an important issue today. integer linear programming (ILP) is the most used exact method to perform this task. We propose a new ILP formulation that allows to solve optimization with less computational effort compared to other ILP approaches. This formulation applies to multifiber mesh networks with or without wavelength conversion, when either the total fiber number or the total fiber length is the cost function to be minimized. After presenting the formulation we discuss the results we obtained by exploiting it in the optimization of two case-study networks.

关键词： WDM networks Wavelength division multiplexing Optical wavelength conversion Switching circuits Computer networks integer linear programming Optical fiber devices Optical fiber networks Space technology Optical design

来源：评论

学校读者我要写书评

暂无评论

Comparison of wavelength reusability based on rerouting and reconfiguration in wavelength-routed optical networks

Comparison of wavelength reusability based on rerouting and ...

引用

IEEE Region 10 International Conference TENCON

作者： Xudong Yang Qingji Zeng Fengqing Liu Xu Zhu R & D Center for Broadband Optical Networking Technology Shanghai Jiaotong University Shanghai China Shanghai Jiao Tong University Shanghai CN R&D Center for Broadband Opt. Networking Technol. Shanghai Jiao Tong Univ. China

ISBN: (纸本)0780374908

The efficiency of wavelength utilization of two failure protection methods in wavelength-routed optical networks: rerouting and reconfiguration, is investigated. Wavelength reusability /spl rho/, is introduced as an evaluation criteria. Routing and wavelength assignment (RWA) problem for failure protection is formulated as integer linear programming (ILP) equations, heuristic algorithms are also developed and detailed numerical results are presented and discussed.

关键词： Intelligent networks Optical fiber networks Protection Telecommunication traffic Wavelength division multiplexing Wavelength routing Heuristic algorithms Network topology Wavelength assignment integer linear programming

来源：评论

学校读者我要写书评

暂无评论

ILP-based engineering change 02

ILP-based engineering change

引用

Proceedings of the 39th annual Design Automation Conference

作者： Farinaz Koushanfar Jennifer L. Wong Jessica Feng Miodrag Potkonjak University of California Berkeley CA University of California Los Angeles CA

ISBN: (纸本)9781581134612

We have developed a generic integer linear programming(ILP)-based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabling EC provides a user with the means to specify the amount of flexibility and how this flexibility should be distributed throughout the solution so that one can guarantee that a specific set of EC demands can be satisfied while preserving the quality of the initially obtained solution. Fast EC conducts changes in a fraction of the time needed to solve the problem while preserving or in some cases improving the quality of the initial solution. Preserving EC maintains either user specified components of the solution or as much as possible of the initial solution while still guaranteeing an optimal solution to the altered problem instance. We applied the generic methodology to Boolean Satisfiability (SAT) problem. The effectiveness of all proposed approaches and algorithms is demonstrated on standard benchmarks.

关键词： synthesis satisfiability(SAT) integer linear programming engineering change

来源：评论

学校读者我要写书评

暂无评论

Low power memory design

Low power memory design

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Wen-Tsong Shiue ECE Department Oregon State University USA

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 (ii) 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 (Premkishore Shivakumar and N.P. Jouppi, 2001) is modified to estimate the timing, area, and energy for each module in different CMOS technologies (0.8 /spl mu/m, 0.35 /spl mu/m, and 0.18 /spl mu/m). Furthermore, we consider the lifetime for arrays; this results in significant reduction in timing, area, and energy for the arrays executed in different cycles sharing the same memory module.

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

来源：评论

学校读者我要写书评

暂无评论

Algorithms and complexity for weighted hypergraph embedding in a cycle

Algorithms and complexity for weighted hypergraph embedding ...

引用

International Conference on Cyberworlds

作者： SingLing Lee Hann-Jang Ho Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan

The problem of weighted hypergraph embedding in a cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as the paths in a cycle, such that the maximum congestion of any physical link in the cycle is minimized. A simpler version of this problem is the weighted graph embedding in a cycle (WGEC) that embeds the weighted edges of a normal graph as the paths in a cycle. The WHEC and WGEC problems have applications in design automation, parallel computing and computer communication. In this paper we first show that both WHEC and WGEC problems are NP-Complete. Afterwards we formulate the WHEC problem as an integer linear programming (ILP). Therefore, an approximation solution can be obtained by using LP-relaxation and rounding heuristic. Our LP-approximation algorithm generates an embedding with congestion at most two times the optimal solution. Finally, to guarantee the efficiency, we develop a linear-time approximation algorithm that also provides a solution with the same worst case approximation bound as the LP-approximation.

关键词： Approximation algorithms Routing Parallel processing Polynomials Computer science Application software Design automation Concurrent computing integer linear programming Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Mathematical Methods in Electromagnetic Theory (MMET)

作者： V.A. Vasilets S.A. Gorelyshev K.I. Tkachuk Kharkov Military University Kharkov Ukraine

Local scattering parts on smooth convex object elements make the most important contribution to reflected signal energy. So, the surface parts of complex shape objects are coated with a radioabsorbing materials (RM) for camouflage purposes. As a rule, the radioabsorbing coating (RC) has sizeable weight and cost. The optimal coating method for the reduction of radar cross-section (RCS) has been obtained for certain illumination and reception directions under limiting conditions for the quantity of RC used. An optimal coating has been realized by solving an integer linear programming problem. Using this method, we present RCS numerical results for a reductive aircraft model partly coated by RM.

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

来源：评论

学校读者我要写书评

暂无评论

On test scheduling for core-based SOCs

On test scheduling for core-based SOCs

引用

Asia and South Pacific Design Automation Conference

作者： S. Koranne ED&T/Test Philips Research Laboratories Eindhoven Netherlands

ISBN: (纸本)0769514413

Presents a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of test resources (e.g., test access mechanisms (TAM)), we determine the test plan for the application of the tests to the SOC. Test planning in this paper refers to the combined activities of test access architecture partitioning and test scheduling. These activities must be performed in conjunction as the choice of the test access architecture influences the test schedule. We justify the formulation of test scheduling w.r.t. minimum average completion time criterion as compared to minimum makespan. We show that then the problem of scheduling tests on TAMs can be mapped onto a graph theoretic problem which has a polynomial time optimal solution. We have implemented our algorithm as a test planner tool TPLAN. We present the theoretical analysis of our approach in this paper and compare our results against those published earlier using integer linear programming techniques with encouraging results.

关键词： System testing Integrated circuit testing Very large scale integration integer linear programming Firewire Knowledge transfer Pins Mathematical model System-on-a-chip Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Comparison of rule-based and optimization-based control of resource allocation on a production line

Comparison of rule-based and optimization-based control of r...

引用

American Control Conference (ACC)

作者： M.B. Larsen H. Holm H.J. Lynggaard Odense Steel Shipyard Ltd. Denmark Department of Production Aalborg University Denmark Odense Production Information Denmark

The effect of disturbances to task execution in manufacturing cells can be minimized by control. A rule-based and an optimization-based controller is developed for a production-line at Odense Steel Shipyard and implemented in a computer-based simulation model. The differences in performance between the two controllers is found in a two-level five factor factorial experiment. The simulations show that on average the optimization-based controller is 2-5% better than the rule-based controller. It is also shown that the rule-based controller is generally more sensitive to changes in parameters on the production-line.

关键词： Resource management Production Optimization methods Welding Steel Manufacturing Computational modeling integer linear programming Computer simulation Shipbuilding industry

来源：评论

学校读者我要写书评

暂无评论

A systematic methodology for channel assignment in mobile radio networks

A systematic methodology for channel assignment in mobile ra...

引用

IEEE Conference on Wireless Communications and Networking

作者： S.Z. Ali Department of Electrical and Electronic Engineering Imperial College of Science Technology and Medicine London UK

ISBN: (纸本)0780373766

The optimal assignment of radio channels to base stations, subject to bandwidth and other constraints, is a non-polynomial-complete problem. The known exact solution approaches to the problem are strictly limited by the size of the problem to be solved. In order to solve optimally this problem, an efficient methodology is proposed. The underlying principle of the proposed methodology is to decompose an intractable channel assignment problem into several small-size, weakly interconnected sub-problems. Each sub-problem so obtained is formulated as a binary integer linear programming (BILP) problem. The set of small-size BILP problems so developed is then solved using a sequential branch and bound algorithm. Experimental evaluations using benchmark problems confirm that the proposed methodology is capable of solving real-world channel assignment problems with the theoretical guarantee of the solutions obtained.

关键词： Intelligent networks Land mobile radio Interchannel interference Interference constraints Base stations Bandwidth Radio propagation Educational institutions integer linear programming Communication channels

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 357 358 359 360 361 362 363 364 365 366 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：