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

IEEE Global Communications Conference (GLOBECOM)

作者： Fu, Norie Suppakitpaisarn, Vorapong Kimura, Kei Kakimura, Naonori Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan JST ERATO Kawarabayashi Large Graph Project Tokyo Japan Univ Tokyo Dept Math Informat Tokyo 1138654 Japan Univ Tokyo Grad Sch Arts & Sci Tokyo 1138654 Japan

ISBN: (纸本)9781479935123

Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor networks. This problem, called the maximum lifetime coverage problem (MLCP), can be formulated as a linear programming problem with exponential size, and has a constant-factor approximation algorithm. In reality, however, batteries of sensors have recovery effects, which is a phenomenon that the deliverable energy in batteries can be replenished by itself if it is left idling for sufficient duration. Thanks to that effects, we can obtain much longer lifetime of sensors if each sensor is forced to take a sleep at some interval. In this paper, we introduce two models that extend the MLCP, incorporating battery recovery effects. The first model represents battery recovery effects in a deterministic way, while the second one uses a probabilistic model to imitate the effects. We then propose efficient algorithms that work for both models by extending approximation algorithms for the original MLCP. Numerical experiments show that the lifetime of our schedule is 10-40% longer than one without battery recovery effects.

关键词： approximation theory linear programming telecommunication scheduling wireless sensor networks MLCP battery recovery effect constant-factor approximation algorithm linear programming problem maximum lifetime coverage problem probabilistic model sensor scheduling wireless sensor network Approximation algorithms Approximation methods Batteries Heuristic algorithms Mathematical model Numerical models Schedules

来源：评论

学校读者我要写书评

暂无评论

Model Predictive Control of Passive and Periodic Satellite Formation Based on linear programming Approach

Model Predictive Control of Passive and Periodic Satellite F...

引用

2014中国制导、导航与控制学术会议

作者： Guangyan Xu Tingting Yu Jianchao Wang Xia Chen Automation department Shenyang Aerospace University Shenyang 110136

ISBN: (纸本)9781479946983

This paper exploits the control algorithm design of fuel-optimal satellite formation keeping strategy using linear programming *** the study,a fuel-optimal control problem is converted into a linear programming problem by means of an approximate discretization ***,model predictive control approach is adopted to realize the fuel-optimal *** last,the designed control algorithm is applied to a satellite which maneuvers from an initial orbit to a passive and periodic relative orbit with minimal fuel *** results demonstrate the efficiency and rapidity of the proposed algorithm.

关键词： artificial satellites control system synthesis linear programming optimal control predictive control approximate discretization method control algorithm design designed control algorithm fuel-optimal control problem fuel-optimal maneuver fuel-optimal satellite formation keeping strategy linear programming problem minimal fuel consumption model predictive control periodic relative orbit periodic satellite formation Equations linear programming Mathematical model Optimal control Orbits Predictive control Satellites

来源：评论

学校读者我要写书评

暂无评论

A SIMPLE VARIANT OF THE MIZUNO-TODD-YE PREDICTOR-CORRECTOR ALGORITHM AND ITS OBJECTIVE-FUNCTION-FREE COMPLEXITY

引用

SIAM JOURNAL ON OPTIMIZATION 2013年第3期23卷 1890-1903页

作者： Kitahara, Tomonari Tsuchiya, Takashi Tokyo Inst Technol Grad Sch Decis Sci & Technol Meguro Ku Tokyo 1528552 Japan Natl Grad Inst Policy Studies Minato Ku Tokyo 1068677 Japan

In this paper, we propose a simple variant of the Mizuno-Todd-Ye predictor-corrector algorithm for linear programming. Our variant employs a simple and a natural scaling-invariant search direction aiming at finite-termination, and, even if finite-termination fails, the same direction is occasionally used instead of the ordinary predictor step. Our algorithm is scaling-invariant, is easy to implement, and enjoys an objective-function-free polynomial-time complexity for a linear program with bounded feasible region.

关键词： linear programming problem interior point method layered least squares interior point method iteration complexity strong polynomiality

来源：评论

学校读者我要写书评

暂无评论

Mega-Solar Optimal Allocation Using Data Envelopment Analysis

引用

ELECTRICAL ENGINEERING IN JAPAN 2013年第4期183卷 24-32页

作者： Yokota, Shinya Kumano, Teruhisa Meiji Univ Tokyo 101 Japan

In this paper, the optimal allocation of mega-solar is examined using data envelopment analysis (DEA). A great deal of attention is paid to photovoltaic power generation in Japan. Because such power generation can be freely used, it is attractive in Japan, which has few natural resources. The allocation of mega-solar, a large-scale photovoltaic power generation method, is an important problem for meeting the hope of efficient operation. We tried to apply DEA in Shizuoka Prefecture and to solve this issue. In this type of DEA application, some analyses often result in zero weighting factors in the parameters of some items to be studied, which implies that the corresponding items are not appropriately evaluated. The existing studies do not give special consideration to this situation. In this study, a new calculation scheme is proposed, the above-stated problems are successfully resolved, and the optimal candidate sites have been selected for the mega-solar allocation. (C) 2013 Wiley Periodicals, Inc. Electr Eng Jpn, 183(4): 24-32, 2013;Published online in Wiley Online Library (***). DOI 10.1002/eej.22322

关键词： data envelopment analysis (DEA) mega-solar location optimization linear programming problem decision-making unit sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

The s-monotone index selection rules for pivot algorithms of linear programming

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2012年第3期221卷 491-500页

作者： Csizmadia, Zsolt Illes, Tibor Nagy, Adrienn Eotvos Lorand Univ Sci Dept Operat Res Budapest Hungary

In this paper we introduce the concept of s-monotone index selection rule for linear programming problems. We show that several known anti-cycling pivot rules like the minimal index, Last-In-First-Out and the most-often-selected-variable pivot rules are s-monotone index selection rules. Furthermore, we show a possible way to define new s-monotone pivot rules. We prove that several known algorithms like the primal (dual) simplex, MBU-simplex algorithms and criss-cross algorithm with s-monotone pivot rules are finite methods. We implemented primal simplex and primal MBU-simplex algorithms, in MATLAB, using three s-monotone index selection rules, the minimal-index, the Last-In-First-Out (LIFO) and the Most-Often-Selected-Variable (MOSV) index selection rule. Numerical results demonstrate the viability of the above listed s-monotone index selection rules in the framework of pivot algorithms (c) 2012 Elsevier B.V. All rights reserved.

关键词： linear programming problem Pivot algorithms Anti-cycling pivot rules s-Monotone index selection rules

来源：评论

学校读者我要写书评

暂无评论

Eliciting dual interval probabilities from interval comparison matrices

引用

INFORMATION SCIENCES 2012年 190卷 17-26页

作者： Guo, Peijun Wang, Yuanbin Yokohama Natl Univ Fac Business Adm Hodogaya Ku Yokohama Kanagawa 2408501 Japan

In recent years, dealing with uncertainty using interval probabilities, such as combination, marginalization, condition, Bayesian inferences, has received considerable attention. However, how to elicit interval probabilities from subjective judgment is still a fundamental problem in applications of interval probabilities. In this paper, interval-valued pairwise comparisons of events are used to characterize the judgment of a person about which one is more likely to occur between each pair of events. From the interval comparison matrix, we elicit the dual interval probabilities by linear programming problems. The ratios of the estimated interval probabilities are used to approximate the interval comparison values from the outside and the inside of them. In other words, the inclusion relations between the interval comparison values and the ratios of the obtained interval probabilities hold. A numerical example concerning a new product development is presented to illustrate how to estimate dual interval probabilities and use interval probabilities to make a decision. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Interval probabilities Uncertainty modeling linear programming problem

来源：评论

学校读者我要写书评

暂无评论

An Architecture and a MAC Protocol for Throughput Improvement in Light Trail Networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第7期E95B卷 2330-2343页

作者： Chen, Wenjie Fukushima, Yukinobu Yokohira, Tokumi Okayama Univ Grad Sch Nat Sci & Technol Okayama 7008530 Japan

Light trail architecture is attracting attention as a new optical wavelength-division multiplexing network architecture that can be built with currently available devices and can achieve bandwidth allocation with granularity finer than a wavelength. Because a light trail is a shared medium, we need a medium access control (MAC) protocol to prevent collisions. Although MAC protocols using token passing can prevent collisions, the bandwidths of links that are located upstream of the token holding node are kept idle. We first propose a dynamic light trail splitting method for increasing throughput of a light trail by using such idle bandwidths. Our method splits a trail into upstream and downstream trails at the token holding node, and independent data transmission on the two trails are permitted. As a result, we expect that the split trail architecture will achieve higher throughput than the original non-split trail architecture. The degree of performance improvement with the split trail architecture depends on how appropriately we determine the upstream and downstream token holding times of every transmission node. Thus, we formulate a problem in which we optimize the token holding times to accommodate requested traffic volume as a linear programming problem. We then derive the throughput of the split trail architecture by solving the problem using the NUOPT solver and investigate the degree of improvement over the original architecture. In addition, we evaluate the end-to-end delay of the split trail architecture by simulation. According to numerical examples, the split trail architecture achieves 1) almost the same throughput as the original one for the worst-case traffic pattern where every transmission node sends data to the terminating node of the trail only, 2) about 1.6 times higher throughput for a uniform traffic pattern where every node pair requests the same traffic volume and an extremely unbalanced traffic pattern where only a few node pairs request huge

关键词： light trail network medium access control (MAC) token passing linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Application of He's homotopy perturbation method to linear programming problems

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2011年第2期88卷 341-347页

作者： Mehrabinezhad, M. Saberi-Nadjafi, J. Islamic Azad Univ Mashhad Branch Dept Appl Math Mashhad Iran Ferdowsi Univ Mashhad Sch Math Sci Dept Appl Math Mashhad Iran

In this paper, we use He's homotopy perturbation method (HPM) for solving linear programming ( LP) problems. By applying HPM for this class of problems, optimal solutions of a primal LP problem and its correspondi... 详细信息

关键词： homotopy perturbation method linear programming problem

来源：评论

学校读者我要写书评

暂无评论

F2C2: a fast tool for the computation of flux coupling in genome-scale metabolic networks

引用

BMC BIOINFORMATICS 2012年第1期13卷 1-9页

作者： Larhlimi, Abdelhalim David, Laszlo Selbig, Joachim Bockmayr, Alexander Univ Potsdam Inst Biochem & Biol Dept Bioinformat D-14476 Potsdam Germany Free Univ Berlin FB Math & Informat D-14195 Berlin Germany Max Planck Inst Mol Plant Physiol D-14476 Potsdam Germany DFG Res Ctr Matheon D-14195 Berlin Germany BMS D-14195 Berlin Germany

Background: Flux coupling analysis (FCA) has become a useful tool in the constraint-based analysis of genome-scale metabolic networks. FCA allows detecting dependencies between reaction fluxes of metabolic networks at steady-state. On the one hand, this can help in the curation of reconstructed metabolic networks by verifying whether the coupling between reactions is in agreement with the experimental findings. On the other hand, FCA can aid in defining intervention strategies to knock out target reactions. Results: We present a new method F2C2 for FCA, which is orders of magnitude faster than previous approaches. As a consequence, FCA of genome-scale metabolic networks can now be performed in a routine manner. Conclusions: We propose F2C2 as a fast tool for the computation of flux coupling in genome-scale metabolic networks. F2C2 is freely available for non-commercial use at https://***/projects/f2c2/files/.

关键词： Metabolic Network Couple Reaction Reversible Reaction linear programming problem Coupling Relationship

来源：评论

学校读者我要写书评

暂无评论

Optimum coordination of overcurrent relay timing using continuous genetic algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第9期38卷 11286-11292页

作者： Bedekar, Prashant P. Bhide, Sudhir R. Visvesvaraya Natl Inst Technol Dept Elect Engn Nagpur 440010 Maharashtra India

Overcurrent relays (OCR) are the major protection devices in a distribution system. To reduce the power outages, mal-operation of the backup relays should be avoided, and therefore. OCR time coordination in power distribution network is a major concern of protection engineer. The OCR time coordination in ring fed distribution networks is a highly constrained optimization problem. The purpose is to find an optimum relay setting to minimize the time of operation of relays and at the same time, to avoid the mal-operation of relays. This paper presents continuous genetic algorithm (CGA) technique for optimum coordination of OCR in a ring fed distribution system. Constraints are incorporated in the fitness function making use of the penalty method. The CGA is inherently faster than binary genetic algorithm (GA) because the chromosomes do not have to be decoded. Also the CGA gives an advantage of requiring less storage than binary GA. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Constrained optimization Continuous genetic algorithms linear programming problem Overcurrent relay coordination

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：