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

Methods of Chebyshev Points of Convex Sets and Their Applications

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2008年第1期48卷 16-29页

作者： Belykh, T. I. Bulatov, V. P. Yas'kova, E. N. Baikal State Univ Econ & Law Irkutsk 664003 Russia Russian Acad Sci Siberian Branch Melentiev Energy Syst Inst Irkutsk 664033 Russia

Chebyshev points of bounded convex sets, search algorithms for them, and various applications to convex programming are considered for simple approximations of reachable sets, optimal control, global optimization of additive functions on convex polyhedra, and integer programming. The problem of searching for Chebyshev points in multicriteria models of development and operation of electric power systems is considered.

关键词： convex programming problem convex sets Chebyshev points integer programming problem

来源：评论

学校读者我要写书评

暂无评论

Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set

引用

INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT 2020年第1期11卷 189-222页

作者： Kumar, P. Senthil Navodaya Inst Technol Dept Humanities & Sci Bijanagera Rd PB 26Navodaya Nagar Raichur 584103 Karnataka India

In this article, the crisp, fuzzy and intuitionistic fuzzy optimization problem is formulated. The basic definitions and notations related to optimization problems are given in the preliminaries section. Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set is presented in this article. Then, with the help of the proposed algorithm the optimal solution of the crisp, fuzzy and intuitionistic fuzzy optimization problems are determined. A new theorem related to type-2 fuzzy/type-2 intuitionistic fuzzy optimization problems is proposed and proved. Some new and concrete results related to type-2 fuzzy/type-2 intuitionistic fuzzy optimization problems are presented. To illustrate the proposed method, some real-life numerical examples are presented. The proposed article provides seven fully worked examples with screenshots of output summaries from the software used in the computations for better understanding. The advantages of the proposed approach as compared to other existing work are also specified. Detail analyses of the comparative study as well the discussion are given. To show the advantages of the proposed approach, superiority analysis is discussed. Comparison analysis and the advantages of the proposed operators are also discussed. Some managerial applications and the advantages of the proposed approach are given. Finally, conclusion and future research directions are also given.

关键词： Fuzzy set Fuzzy number TFN TrFN Intuitionistic fuzzy set Intuitionistic fuzzy number TIFN TrIFN Type-2 FTP Type-2 IFTP Type-2 IFSTP FAP IFAP IFSAP Linear programming method integer programming problem Optimal solution Optimal assignment PSK theorem

来源：评论

学校读者我要写书评

暂无评论

Identification of petri nets from knowledge of their language

引用

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS 2007年第4期17卷 447-474页

作者： Cabasino, Maria Paola Giua, Alessandro Seatzu, Carla Univ Cagliari Dept Elect & Elect Engn I-09123 Cagliari Italy

In this paper we deal with the problem of identifying a Petri net system, given a finite language generated by it. First we consider the problem of identifying a free labeled Petri net system, i.e., all transition labels are distinct. The set of transitions and the number of places is assumed to be known, while the net structure and the initial marking are computed solving an integer programming problem. Then we extend this approach in several ways introducing additional information about the model (structural constraints, conservative components, stationary sequences) or about its initial marking. We also treat the problem of synthesizing a bounded net system starting from an automaton that generates its language. Finally, we show how the approach can also be generalized to the case of labeled Petri nets, where two or more transitions may share the same label. In particular, in this case we impose that the resulting net system is deterministic. In both cases the identification problem can still be solved via an integer programming problem.

关键词： petri nets identification integer programming problem

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：