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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A novel framework for dynamic survivable routing in mesh WDM networks

A novel framework for dynamic survivable routing in mesh WDM...

引用

International Conference on Transparent Optical Networks

作者： A. Haque Pin-Han Ho J. Ho School of Computer Science University of Waterloo ONT Canada Department of Electrical and Computer Engineering University of Waterloo ONT Canada

The paper proposes a novel framework of shared protection, namely group shared protection (GSP), in mesh wavelength division multiplexing (WDM) networks with dynamically arriving connection requests. Based on the (M:N)/sup n/ control architecture, GSP has n mutually independent protection groups, each of which contain N link-disjoint working paths protected by M protection paths. Based on this framework, an integer linear programming (ILP) formulation is proposed; it can optimally reconfigure the spare capacity for a specific protection group whenever a working-protection path-pair joins. Two heuristics, namely link-shared protection (LSP) and ring-shared protection (RSP), are introduced for further compromising the performance and the computational complexity. The proposed schemes are compared with a reported one, namely successive survivable routing (SSR). We conclude that GSP provides a scalable and efficient solution for dynamic spare capacity reconfiguration following the (M:N)/sup n/ control architecture.

关键词： Routing Intelligent networks WDM networks Protection Wavelength division multiplexing Computer architecture Communication system traffic control integer linear programming Scalability Computer network management

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of five protection schemes for preplanned recovery in multicast WDM networks

Design and analysis of five protection schemes for preplanne...

引用

IEEE Princeton Section Sarnoff Symposium

作者： P. Leelarusmee C. Boworntummarat L. Wuttisittikulkij Department of Electrical Engineering Faculty of Engineering Chulalongkom University Bangkok Thailand

The paper proposes five novel protection strategies against single link failure in multicast multi-fiber WDM networks. These strategies are able to provide rapid recovery from failure by reserving sufficient preplanned spare capacity. Mathematical formulations based on integer linear programming (ILP) are derived to determine optimal multicast routing and wavelength assignment (MC-RWA) while achieving 100% restoration. Based on a sample network, it is shown that the joined-path recovery (JPR) scheme is the most cost-effective, whereas the ring-based protection strategies offer other advantages, i.e. fast and reliable recovery.

关键词： Protection Intelligent networks WDM networks Telecommunication traffic Optical fiber networks Wavelength division multiplexing integer linear programming Wavelength routing Wavelength assignment Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Traffic engineering and routing in survivable multiservice networks

Traffic engineering and routing in survivable multiservice n...

引用

International Zurich Seminar on Communications

作者： V. Pasias D. Karras R.C. Papademetriou Department of Electronic and Computer Engineering University of Portsmouth United Kingdom (UK) Hellenic Aerospace Industry (AMEC group) Hellenic Open University

This paper presents a new framework for traffic engineering (TE) of primary and backup paths and routing of quality of service (QoS) and best-effort (BE) flows in multiservice backbone networks capable of surviving against single or multiple node and/or link failure(s). The aforementioned framework involves an off-line and an on-line phase. In the off-line phase either a method based on an integer linear programming (ILP) TE problem or a method based on a heuristic TE algorithm provides the primary and the backup routes (where required) for the QoS-guaranteed flows and the routes for the BE flows. In the on-line phase the QoS and BE flows are routed based on the outputs of the off-line phase. In the case that one or more primary paths fail the corresponding backup paths are used for restoration. However, if one or more backup paths also fail or a backup path is not defined dynamic restoration is applied. Test results regarding the two off-line TE methods are presented.

关键词： Telecommunication traffic Routing Intelligent networks Tellurium Quality of service Spine integer linear programming Heuristic algorithms Bandwidth Protection

来源：评论

学校读者我要写书评

暂无评论

Differential on-line sensor calibration [light intensity sensor example]

Differential on-line sensor calibration [light intensity sen...

引用

IEEE SENSORS

作者： J. Feng G. Qu M. Potkonjak Computer Science Department University of California Los Angeles CA USA Electrical and Computer Engineering Department University of Maryland College Park MD USA

We have developed an on-line calibration scheme that employs a single source as the external stimulus that creates differential sensor readings used for calibration. The technique utilizes the maximal likelihood principle and a nonlinear system optimization solver to derive the calibration function of arbitrary complexity and accuracy. The approach is intrinsically localized and we present two variants: i) one where only two neighboring sensors have to communicate in order to conduct calibration; ii) one where a provably minimum amount of communication is achieved. We evaluate the techniques using traces from light sensors recorded by deployed sensors, and statistical evaluations are conducted in order to obtain the interval of confidence to support all the results.

关键词： Calibration linear programming Computer science Educational institutions Nonlinear systems Noise figure Error correction Actuators integer linear programming Broadcasting

来源：评论

学校读者我要写书评

暂无评论

ShatterPB: symmetry-breaking for pseudo-boolean formulas

ShatterPB: symmetry-breaking for pseudo-boolean formulas

引用

Asia and South Pacific Design Automation Conference

作者： F.A. Aloulb A. Ramani I.L. Markov K.A. Sakallah University of Michigan Department of EECS University of Michigan Ann Arbor USA

Many imponant tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However such reductions often leave out application-specific structure, thus handicapping EDA tools in their competition with creative engineers. Successful attempts to represent and utilize additional structure on Boolean variables include recent work on 0-1 integer linear programming (ILP) and on symmetries in SAT. Those extensions gracefully accommodate well-known advances in SAT-solving, but their combined use has not been attempted previously. Our work shows (i) how one can detect and use symmetries in instances of 0-1 ILP, and (ii) what benefits this may bring.

关键词： Electronic design automation and methodology Lead integer linear programming Encoding Design engineering Circuit synthesis Design automation Data mining Constraint optimization Phase detection

来源：评论

学校读者我要写书评

暂无评论

On-line routing of MPLS tunnels with time-varying bandwidth profiles

On-line routing of MPLS tunnels with time-varying bandwidth ...

引用

IEEE Workshop on High Performance Switching and Routing

作者： F. Ricciato U. Monaco INFO-COM Department University of Roma La Sapienza Rome Italy

We consider the problem of routing bandwidth-guaranteed flows with time-varying bandwidth profiles on an MPLS network. We assume that each demand is routed in a fixed LSP, and that the amount of bandwidth that must be reserved along the LSP varies during the day according to a piece-wise mask which is known in advance. Such profiles can be explicitly declared by the VPN customers in the SLA, or, alternatively, predicted by the ISP based on past measurements. We propose a simple on-line algorithm based on shortest-path computation with link weights influenced by the residual peak bandwidth. We also provide an ILP formulation for the associated off-line problem, and adopt it as a reference performance bound for the on-line algorithm. The results presented show that the proposed algorithm, despite its simplicity, closely approximates the optimal solution. The paper shows that the a priori knowledge of the per-demand traffic profiles, still within a fixed routing framework, can be exploited to achieve a sensible bandwidth saving, and/or to differentiate bandwidth provisioning (and billing) on a per-hour basis.

关键词： Routing Multiprotocol label switching Bandwidth Virtual private networks Telecommunication traffic Timing integer linear programming Fitting

来源：评论

学校读者我要写书评

暂无评论

A heterogeneity based clustering heuristic for mobile ad hoc networks

A heterogeneity based clustering heuristic for mobile ad hoc...

引用

IEEE International Conference on Communications (ICC)

作者： B. Latre J. Hocbeke L. Peters T. Van Leeuwen I. Moerman B. Dhoedt P. Demeester Department of Information Technology (INTEC) Ghent University–IMEC Gent Belgium Universiteit Gent Gent BE Dept. Inf. Technol. Ghent Univ. Belgium

An ad hoc network is an autonomous system of heterogeneous, mobile nodes that communicate with each other over wireless links. Routing protocols for these networks are inherently based on broadcasting control information and are therefore very bandwidth consuming. In order to limit the amount of routing information that has to be stored and maintained by the individual nodes, the technique of clustering is used. The network is partitioned into nonoverlapping sub networks, referred to as clusters, and one cluster node, the clusterhead, will take a leading role in the dissemination of control information. In this paper we approach the problem of finding an optimal partition that explicitly takes into account the heterogeneity of the network, as an integer linear programming (ILP) problem. In a second phase we have developed a new heuristic that approximates our ILP solution that is used in our clustering algorithm. It is shown that this heuristic tends to be more stable than existing clustering techniques that are solely based on ID number and/or connectivity and that do not take into account the heterogeneity of the network.

关键词： Mobile ad hoc networks Routing protocols Bandwidth Broadcasting Ad hoc networks Network topology Scalability integer linear programming Clustering algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

The generation expansion planning of the utility in a deregulated environment

The generation expansion planning of the utility in a deregu...

引用

International Conference on Electric Utility Deregulation and Restructuring and Power Technologies (DRPT)

作者： Whei-Min Lin Tung-Sheng Zhan Ming-Tong Tsay Wen-Cha Hung Department of Electrical Engineering National Sun Yat-Sen University Kaohsiung Taiwan Department of Electrical Engineering Cheng Shiu University Kaohsiung Taiwan

ISBN: (纸本)0780382374

In this paper, an improved genetic algorithm (IGA) is presented to determine the generation expansion planning of the utility in a deregulated market. The utility has to take both the IPPs' participation and environment impact into account when a new generation is expanded. The CO/sub 2/emission also took into account, while satisfying all electrical constraints simultaneously. IGA was conducted by an improved crossover and mutation mechanism with a competition and autoadjust scheme to avoid prematurity. Tabu lists with heuristic rules were also employed in the searching process to enhance the performance. Testing results shows that IGA can offer an efficient way in determining the generation expansion planning. Results can offer utilities for determining the optimal expansion planning.

关键词： Nuclear power generation Power generation Costs integer linear programming Genetic algorithms Petroleum Dynamic programming Artificial intelligence Genetic mutations Character generation

来源：评论

学校读者我要写书评

暂无评论

On multicast routing using rectilinear Steiner trees for LEO satellite networks

On multicast routing using rectilinear Steiner trees for LEO...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： De-Nian Yang Wanjiun Liao Department of Electrical Engineering National Taiwan University Taipei Taiwan

In this paper, we propose a bandwidth-efficient multicast routing mechanism using rectilinear Steiner trees for IP-based LEO satellite networks. Different from the previous approach which minimizes the end-to-end delay, our mechanism minimizes the total bandwidth, i.e, the number of hops, used by a multicast tree since the wireless bandwidth in satellite networks is a limited and scarce resource. We propose a new integer linear programming formulation for network planning and a distributed algorithm for protocol design. Our simulation results show that the trees created by our approach use less bandwidth than shortest-path trees. Moreover, the difference of the optimal solutions and the solutions obtained by our distributed algorithm is within 5% on average.

关键词： Routing Low earth orbit satellites Satellite broadcasting Tree graphs integer linear programming Distributed algorithms Bandwidth Algorithm design and analysis Web and internet services Multimedia communication

来源：评论

学校读者我要写书评

暂无评论

Bi-criteria models for all-uses test suite reduction 04

Bi-criteria models for all-uses test suite reduction

引用

International Conference on Software Engineering (ICSE)

作者： J. Black E. Melachrinoudis D. Kaeli College of Engineering Northeastern University Boston MA USA

ISBN: (纸本)9780769521633

Using bi-criteria decision making analysis, a new model for test suite minimization has been developed that pursues two objectives: minimizing a test suite with regard to a particular level of coverage while simultaneously maximizing error detection rates. This new representation makes it possible to achieve significant reductions in test suite size without experiencing a decrease in error detection rates. Using the all-uses inter-procedural data flow testing criterion, two binary integer linear programming models were evaluated, one a single-objective model, the other a weighted-sums bi-criteria model. The applicability of the bi-criteria model to regression test suite maintenance was also evaluated. The data show that minimization based solely on definition-use association coverage may have a negative impact on the error detection rate as compared to minimization performed with a bi-criteria model that also takes into account the ability of test cases to reveal error. Results obtained with the bi-criteria model also indicate that test suites minimized with respect to a collection of program faults are effective at revealing subsequent program faults.

关键词： Software testing Decision making integer linear programming Mathematical programming Educational institutions Performance evaluation Minimization methods NP-complete problem Application software Automatic testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 348 349 350 351 352 353 354 355 356 357 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：