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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Auto search algorithm for antenna structure by gradient method combined with method of moment

Auto search algorithm for antenna structure by gradient meth...

引用

2nd International ITG Conference on Antennas (INICA)

作者： Takei, Ken Ikegaya, Morihiko Hitachi Cable Ltd Cross Technol Dev Ctr Hitachi Ibaraki 3191418 Japan

ISBN: (纸本)9783000216442

We propose a novel antenna design method consisting of the gradient method and method of moment is proposed. An antenna structure is represented by the combination of small segments. By regarding the 0/1 state segment variable as a real parameter, a matrix equation for the gradient method is derived. Fast computation causing of automatic decisions of simultaneous changing segments achieves practical design for various antennas, including large-scale antennas.

关键词： method of moment gradient method DMB ISDB integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Unified particle swarm optimization for tackling operations research problems

Unified particle swarm optimization for tackling operations ...

引用

IEEE Swarm Intelligence Symposium

作者： Parsopoulos, KE Vrahatis, MN Univ Patras CI Lab Dept Math GR-26110 Patras Greece

ISBN: (纸本)0780389166

We investigate the performance of the recently proposed Unified Particle Swarm Optimization algorithm on two categories of operations research problems, namely minimax and integer programming problems. Different variants of the algorithm are employed and compared with established variants of the Particle Swarm Optimization algorithm. Statistical hypothesis testing is performed to justify the significance of the results. Conclusions regarding the ability of the Unified Particle Swarm Optimization method to tackle operations research problems as well as on the performance of each variant are derived and discussed.

关键词： integer programming minimax techniques operations research particle swarm optimisation statistical testing integer programming problem minimax problem operation research problem statistical hypothesis testing unified particle swarm optimization Particle swarm optimization integer programming minimax techniques Statistical tests Hypothesis testing

来源：评论

学校读者我要写书评

暂无评论

An efficient 0-1 integer programming algorithm for advertising media selection

引用

Journal of the Academy of Marketing Science 1984年第1-2期12卷 191-204页

作者： Ahmed, Nazim U. Ball State University Muncie United States

Advertising is one of the important instruments in the success and continued growth of a product. Total expenditures for advertising in the United States may run into many billions of dollars. In this paper, an efficient algorithm for allocating scarce advertising resources is developed. The advertising media selection problem is formulated in terms of a 0-1 integer programming problem. An iterative solution procedure for this formulation is presented. A simple numerical example which illustrates the steps of the algorithm is also presented. The algorithm can generate efficient solutions to large media selection problems with relative computational ease, and may be of practical significance to decision makers. © 1984 Academy of Marketing Science.

关键词： integer Program integer programming problem integer programming Formulation Minimum Exposure MBAA

来源：评论

学校读者我要写书评

暂无评论

Complexity-Constrainted Partitioning of Sequential Programs for Efficient Behavioral Synthesis

Complexity-Constrainted Partitioning of Sequential Programs ...

引用

17th Great Lakes Symposium on VLSI

作者： Hara, Yuko Tomiyama, Hiroyuki Honda, Shinya Takada, Hiroaki Ishii, Katsuya Nagoya Univ Grad Sch Informat Sci Chikusa Ku Nagoya Aichi 4648603 Japan

ISBN: (纸本)9781595936059

This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and ones to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.

关键词： Behavioral Synthesis Function Calls integer programming problem

来源：评论

学校读者我要写书评

暂无评论

integer programming Approach to PCB Assembly Optimization of Modular Mounters

Integer Programming Approach to PCB Assembly Optimization of...

引用

2010 IEEE World Congress on Computational Intelligence

作者： Park, Tae-Hyoung Kim, Kyung-Min Chungbuk Natl Univ Dept Control & Robot Eng CBITRC Cheongju 361763 Chungbuk South Korea Samsung Elect Co Mobile Commun Ctr Suwon 433742 Kyunggi South Korea

ISBN: (纸本)9781424481262

We propose an optimization method to maximize the productivity of PCB (printed circuit board) assembly of modular mounters. The modular mounter is a series of compact SMD (surface mount device) placement modules, where each module has assembly head and feeder lanes. The throughput of the mounter is maximized by balancing the assembly time of each module. We indentify the problem as an integer programming problem, and divide the problem into feeder arrangement problem and mount sequence problem by decoupling the path into forward arcs and backward arcs. The integer-programming based algorithms such as branch-and-bound algorithm and transportation algorithm are applied to solve the formulated problems. Simulation results are presented to verify the usefulness of the proposed method.

关键词： PCB assembly optimization assembling assembly time branch-and-bound algorithm feeder arrangement problem integer programming integer programming based algorithm integer programming problem modular mounter mount sequence problem optimisation printed circuit board assembly printed circuit manufacture printed circuits productivity surface mount device placement module transportation algorithm

来源：评论

学校读者我要写书评

暂无评论

A STUDY ON HIERARCHICAL PRODUCTION PLANNING FRAMEWORK FOR ENGINEER-TO-ORDER PRODUCTION OF LARGE PRODUCTS

A STUDY ON HIERARCHICAL PRODUCTION PLANNING FRAMEWORK FOR EN...

引用

International Symposium on Flexible Automation (ISFA)

作者： Iwamura, Koji Morinaga, Eiji Hirahara, Yoshiyuki Fukuda, Masamitsu Niinuma, Ayumu Oshima, Hirotomo Namioka, Yasuo Osaka Metropolitan Univ Osaka Japan Toshiba Co Ltd Yokohama Kanagawa Japan

ISBN: (纸本)9780791887882

Engineer-to-order (ETO) production is a method in which products are designed and manufactured in response to customer orders. Typical products of ETO production targeted in this study are large products such as power plants, plants, and shipbuilding. These products have long lead times and delivery times, and production plans need to be generated for a year or more in advance. This study proposes a hierarchical production planning (HPP) framework to generate long-term, medium-term, and short-term production plans using common granularity of production equipment and unit time on production planning method for ETO production of large products. A load planning required for the long-term production plan is formulated as an integer programming problem, and the load plans are generated using a mathematical programming solver and a constraint programming solver.

关键词： Engineer-to-order production Hierarchical production planning Load planning integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Minimizing risk in Bayesian supply chain networks

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2022年 169卷

作者： Ruskey, Brendan Rosenberg, Eric Lehigh Univ Bethlehem PA USA Georgian Court Univ Lakewood NJ USA

We develop an approach for minimizing expected unmet demand in a supply chain modelled using a Bayesian network. We allow for nodes to be upgraded, subject to a budget constraint, to reduce the probability that the node becomes non-operational. We formulate the problem of selecting an optimal set of node upgrades as a linear binary integer program (BIP). Ours is the first formulation of expected loss minimization in Bayesian-modelled supply chains as a BIP. Unlike previous published formulations, our formulation allows for the conditional probability table of each node in the Bayesian network to be quite general, including allowing an upgraded node to have a nonzero probability of failure, and allowing multiple types of upgrades for a node. This reflects real world scenarios, including those in which node upgrades do not completely eliminate risk. We present computational results for small problems and illustrate how the solution set changes with the budget. Results for a larger food supply chain with 44 nodes and 63 arcs are also discussed. Finally, we present a preprocessing method for reducing the number of constraints needed for the BIP formulation, and evaluate the savings in run time achieved by applying our constraint reduction method.

关键词： Bayesian networks Supply chain networks Risk mitigation integer programming problem

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Discrete Brain Storm Algorithm Solves 3D Protein Structure Prediction

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2021年第8期12卷 850-859页

作者： Fahim, Alaa Abdelraheem, Nehad Assiut Univ Fac Sci Math Dept Assiut Egypt Assiut Univ Fac Comp Sci & Informat Syst Assiut Egypt

Brain Storm Optimization (BSO) is one of the major effective swarm intelligence algorithms that simulate the human brainstorming process to find optimality for optimization problems. BSO method has successfully been applied to many real-world problems. This study employs BSO method, called BSO-IP, to solve the integer programming problem. Our method collects best solutions to generate new solutions that then search for optimal solutions in all areas of search *** BSO-IP method solves some benchmark integer programming problems to test its efficiency. The BSO-IP is used to simulate the 3D protein structure prediction problem, which is mathematically presented as an integer programming problem to approve the viability and helpfulness of our proposed Algorithm. The experimental results of different benchmarks protein structure show that our proposed method is superior in high performance, convergence, and stability in predicting protein structure. We examined our strategy results to be promising compared to other results.

关键词： Brain storm optimization integer programming problem three dimensional protein structure prediction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：