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

Economic and ecological models in Russia’s mining sector

Regional Research of Russia 2017年第2期7卷 180-187页

作者： Glazyrina, I.P. Lavlinskii, S.M. Institute of Natural Resources Ecology and Cryology Siberian Branch Russian Academy of Sciences Chita 672014 Russian Federation Institute of Mathematics Siberian Branch Russian Academy of Sciences Novosibirsk 630090 Russian Federation

The paper analyzes the development level of the institute of public–private partnership (PPP) in Russia’s mining complex and the partnership mechanism, within which the state, using RF Investment Fund monies, assists investors in underdeveloped areas not only in creating infrastructure but also in implementing necessary environmental protection measures. In order to analyze the properties of such a partnership mechanism, the authors have worked out economic and mathematical tools that make it possible to effectively divide spending between the state and a private investor in development of the mineral resource base. The toolkit combines integer mathematical programming and a set of predictive models that describe the functioning of a resource area. The methodology of its application is illustrated with a case study of Zabaikalskii krai, for which a program for developing polymetallic fields is being worked out based on the PPP mechanism;the sensitivity of its decisions to changes in the main partnership parameters is analyzed. The results of numerical experiments confirm the rationality of using this mechanism in an underdeveloped area. They show that, in addition to a coherent approach to assessing the specific amount of funds to be allocated to infrastructural and environmental projects, an important role is played by transaction costs accounting, the level and structure of which affect the effectiveness indicators achieved not only by a private investor, but also by the state. © 2017, Pleiades Publishing, Ltd.

关键词： integer programming problem partnership mechanism program for development of the mineral resources base Zabaikalskii krai

来源：评论

学校读者我要写书评

暂无评论

A novel software-defined networking approach for vertical handoff in heterogeneous wireless networks

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2016年第15期16卷 2374-2389页

作者： Qiang, Li Li, Jie Ji, Yusheng Huang, Changcheng Univ Tsukuba Grad Sch Syst & Informat Engn Tsukuba Ibaraki Japan Univ Tsukuba Fac Engn Informat & Syst Tsukuba Ibaraki Japan Natl Inst Informat Informat Syst Architecture Res Div Tokyo Japan Carleton Univ Dept Syst & Comp Engn Ottawa ON Canada

We propose a novel vertical handoff scheme with the support of the software-defined networking technique for heterogeneous wireless networks. The proposed scheme solves two important issues in vertical handoff: network selection and handoff timing. In this paper, the network selection is formulated as a 0-1 integer programming problem, which maximizes the sum of channel capacities that handoff users can obtain from their new access points. After the network selection process is finished, a user will wait for a time period. Only if the new access point is consistently more appropriate than the current access point during this time period, will the user transfer its inter-network connection to the new access point. Our proposed scheme ensures that a user will transfer to the most appropriate access point at the most appropriate time. Comprehensive simulation has been conducted. It is shown that the proposed scheme reduces the number of vertical handoffs, maximizes the total throughput, and user served ratio significantly. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： vertical handoff software-defined networking integer programming problem total throughput user served ratio

来源：评论

学校读者我要写书评

暂无评论

Discreet Method to Match Safe Site-Pairs in Short Computation Time for Risk-Aware Data Replication

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2015年第8期E98D卷 1493-1502页

作者： Nakamura, Takaki Matsumoto, Shinya Muraoka, Hiroaki Tohoku Univ Res Inst Elect Commun Sendai Miyagi 9808577 Japan Hitachi Ltd Yokohama Res Lab Yokohama Kanagawa 2440817 Japan

Risk-aware Data Replication (RDR), which replicates data at primary sites to nearby safe backup sites, has been proposed to mitigate service disruption in a disaster area even after a widespread disaster that damages a network and a primary site. RDR assigns a safe backup site to a primary site while considering damage risk for both the primary site and the backup candidate site. To minimize the damage risk of all site-pairs the integer Programing problem (IPP), which is a mathematical optimization problem, is applied. A challenge for RDR is to choose safe backup sites within a short computation time even for a huge number of sites. As described in this paper, we propose a Discreet method for RDR to surmount this hurdle. The Discreet method first judges the backup sites of a potentially unsafe primary site and avoids assigning a very safe primary site with a very safe backup site. We evaluated the computation time for site-paring and the data availability in the cases of Earthquake and Tsunami using basic disaster simulations. We confirmed that the computation rate of the proposed method is more than 1000 times faster than the existing method when the number of sites is greater than 1000. We also confirmed the data availability of the proposed method;it provides almost equal rates to existing methods of strict optimization. These results mean that the proposed method makes RDR more practical for massively multiple sites.

关键词： remote replication disaster recovery distributed storage integer programming problem availability

来源：评论

学校读者我要写书评

暂无评论

Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems

引用

Journal of Central South University 2014年第7期21卷 2731-2742页

作者：谭跃谭冠政邓曙光 School of Information Science and Engineering Central South University School of Communication and Electronic Engineering Hunan City University

A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming *** performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search *** results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these ***,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.

关键词： particle swarm optimization chaotic search integer programming problem mixed integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Computing minimal hitting set based on immune genetic algorithm

引用

INTERNATIONAL JOURNAL OF MODELLING IDENTIFICATION AND CONTROL 2014年第1期21卷 93-100页

作者： Zhou, Gan Feng, Wenquan Jiang, Bofeng Li, Chao Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Univ Southern Calif Dept Elect Engn Los Angeles CA 90089 USA

The primary bottleneck of many model-based diagnosis approaches is computing minimal hitting sets (MHSs). Most existing algorithms for computing MHSs are deterministic. Such algorithms are sound and complete but with the complexity of exponential, since the problem of computing MHSs is NP-hard. To reduce the complexity, especially for large systems, we present a novel approach for multiple fault diagnosis, based on an immune genetic algorithm (IGA). This approach maps a hitting set problem onto an integer programming problem, followed by obtaining the lower bound on the size of the solution. The use of the bound in the immune operator guides the MHS search. An elite-set strategy and an appropriate termination criterion are proposed to improve the efficiency of the approach. Experimental results show that our approach solves MHSs faster than the traditional deterministic algorithm in large-scale problems. Compared with the incomplete algorithm, the speed and accuracy of our approach are also significantly improved.

关键词： model-based diagnosis minimal hitting set MHS immune operator elite-set strategy integer programming problem genetic algorithm termination criterion

来源：评论

学校读者我要写书评

暂无评论

Spectrum Access Strategies Based on the Ratio of Throughput to Spectrum Consumption in the Context of Spectrum Fragmentation in Distributed Cognitive Radio Networks

Spectrum Access Strategies Based on the Ratio of Throughput ...

引用

IEEE International Conference on Communication Systems (IEEE ICCS)

作者： Zhang, Shuai Lu, Yanhui Wang, Fang Mu, Xiaomin Zhengzhou Univ Sch Infolinat Engn Zhengzhou 450001 Peoples R China Univ Wollongong Sch Elect Comp & Telecommun Wollongong NSW 2522 Australia

ISBN: (纸本)9781479958320

Because of the random presence of primary users in cognitive radio networks, the available spectrums are fragmented with the size of each fragment varying from one channel to several channels. Due to the spectrum fragmentation, the cross-band interference between spectrally adjacent users is considered harmful in the distributed cognitive radio networks. To eliminate the interference, frequency guard-bands are inserted between spectrum fragments. The guard-bands not used for transmission are considered as the spectrum consumption. Accordingly, the achieved throughput is at the cost of the guard-bands consumption. Thus, to utilize the spectrum fragments efficiently, the ratio of throughput to spectrum consumption is defined for the dynamic spectrum access problem. Therefore, under the conditions of prescribed user quality-of-service (QoS) requirements and the frequency agility limit, a novel mathematic model in which the ratio of throughput to spectrum consumption is maximized is proposed in this paper, which is an integer programming problem. To this end, three spectrum access strategies with lower complexities than the traditional exhaustive search are proposed. Simulation results show that the ratio can be used as the index whether the spectrum fragments are effectively utilized. Meanwhile, the spectrum consumption is mainly affected by the size of guard-band, number of fragments and available channels, so the ratios are varying with these factors. Moreover, as the different spectrum utilizations of the four strategies, these factors also have significant influences on the performances of the strategies.

关键词： distributed cognitive radio network spectrum fragmentation guard-band integer programming problem spectrum access strategies

来源：评论

学校读者我要写书评

暂无评论

Efficiency Improvement in Explicit Enumeration for integer programming problems

Efficiency Improvement in Explicit Enumeration for Integer P...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Chen, S. G. Tungnan Univ Dept Ind Management New Taipei Taiwan

ISBN: (纸本)9781479909865

An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many cases, the problems can be divided into integer linear programming (ILP) problems and integer non-linear programming (INLP) problems. A more complex problems are mixed integer programming (MIP) problems. There are many algorithms to well solve ILP problems. However, there are relatively fewer algorithms to solve INLP problems. In most situations, the explicit enumeration method (EEM) can be used to solve both kinds of problems. EEM is very simple to implement but with the price of low efficiency. This paper proposes an efficient approach namely Chen's rearrangement to improve the efficiency in explicit enumeration for integer programming problems. Part of them can also be applied to MIP problems. An interesting example is explored to explain the proposed approach.

关键词： integer programming problem explicit enumeration exhausted search brute-force search

来源：评论

学校读者我要写书评

暂无评论

A Software-Defined Network based Vertical Handoff Scheme for Heterogeneous Wireless Networks

A Software-Defined Network based Vertical Handoff Scheme for...

引用

IEEE Global Communications Conference

作者： Li Qiang Jie Li Changcheng Huang Graduate School of Systems and Information Engineering University of Tsukuba Faculty of Engineering Information and Systems University of Tsukuba Department of Systems and Computer Engineering Carleton University

ISBN: (纸本)9781479935130

We propose a novel Quality of Service (QoS) vertical handoff scheme with the support of the Software-Defined Network (SDN) technique for the heterogeneous wireless networks. The proposed scheme solves two important issues of the vertical handoff: network selection and handoff timing. In this paper, the network selection is formulated as an 0-1 integer programming problem, which maximizes the overall QoS and avoids the network congestion. After the network selection process is finished, a mobile will wait for a time period for implementing the vertical handoff. The selected network should be consistently more appropriate than the current network during the time period, the mobile will transfer its inter-network connection to the selected network. Our proposed scheme ensures that, a mobile will transfer to the most appropriate network at the most appropriate time. Comprehensive simulation has been conducted. It is shown that the proposed scheme reduces the number of vertical handoffs, and maximizes the overall QoS significantly comparing with existing schemes.

关键词： integer programming mobility management (mobile radio) quality of service radio networks software defined networking handoff timing heterogeneous wireless networks integer programming problem network selection software-defined network vertical handoff scheme Bandwidth Mobile communication Mobile computing Quality of service Stability analysis Vectors Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Protecting Cognitive Radio Networks Against Primary Users: A Backup Path Approach

Protecting Cognitive Radio Networks Against Primary Users: A...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Mao, Rukun Li, Husheng Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA

ISBN: (纸本)9781424492688

The reliability of traffic flows is a serious challenge to cognitive radio networks due to the interruptions from primary users. A backup path scheme is proposed to protect the secondary user traffic flows against the interruptions from primary users. In such a scheme, the traffic flow can be switched to a backup path if the working path is interrupted by primary users. When primary users leave, the traffic flow will be switched back to the working path. The problem of selecting backup paths is formulated as an integer programming problem. Given a backup path, a statistical rule is proposed for switching the traffic flow to the backup path, based on the Bayesian decision framework. The switching rule is implemented on a USRP GNU Radio node based testbed, which consists of a multi-hop cognitive radio network and a primary user. The hardware experiment shows that the system cost, defined as a weighted sum of throughput loss and average packet delay, is reduced by around 50% in a typical setup, compared with the scenario of no backup paths.

关键词： Bayesian methods Cognitive radio Delay Linear programming Peer to peer computing Relays Switches backup path approach cognitive radio cognitive radio networks integer programming integer programming problem primary users secondary user traffic flow reliability statistical rule telecommunication network reliability telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

An optimisation model and its effective beam search heuristics for floor-storage warehousing systems

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2010年第7期48卷 1947-1966页

作者： Nishi, T. Konishi, M. Osaka Univ Grad Sch Engn Sci Osaka 5608531 Japan Okayama Univ Grad Sch Nat Sci & Technol Okayama 7008530 Japan

This paper presents an optimisation model and its effective solution technique using beam search heuristic for floor-storage warehousing systems. For a floor-storage system, storage can be accessed from the top of stacks only. The objective is to minimise the number of re-handling operations by optimally determining the storage location and by grouping products for each customer that fit a given sequence for receiving and retrieving operations. An integer programming model is formulated and an approximate solution technique based on the beam search method is proposed to solve the problem by incorporating effective heuristics to reduce the search space using future receiving and retrieving requests. The effectiveness of the proposed method is demonstrated for industrial warehousing problems in a steel plant with 58 storage areas involving more than 3000 retrieving operations. The proposed solution method is shown to be more efficient than the traditional branch-and-bound method for solving integer programming problems.

关键词： warehousing floor-storage systems storage allocation beam search optimisation integer programming problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：