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

ON THE CIRCUIT DIAMETER OF DUAL TRANSPORTATION POLYHEDRA

SIAM JOURNAL ON DISCRETE MATHEMATICS 2015年第1期29卷 113-121页

作者： Borgwardt, Steffen Finhold, Elisabeth Hemmecke, Raymond Tech Univ Munich D-85747 Munich Germany

In this paper we introduce the circuit diameter of polyhedra, which is always bounded from above by the combinatorial diameter. We consider dual transportation polyhedra defined on general bipartite graphs. For complete MxN bipartite graphs the Hirsch bound (M-1)(N-1) on the combinatorial diameter is a known tight bound [Math. Oper. Res., 9 (1984), pp. 629-633]. For the circuit diameter we show the much stronger bound M+N-2 for all dual transportation polyhedra defined on arbitrary bipartite graphs with M+N nodes.

关键词： augmentation Graver basis test set circuit elementary vector linear program integer program diameter Hirsch conjecture

来源：评论

学校读者我要写书评

暂无评论

Efficient methods for stochastic joint replenishment and delivery problem

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2022年第4期29卷 2288-2315页

作者： Wang, Sirui Wang, Lin Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Peoples R China

In this paper, we consider the joint replenishment and delivery scheduling of the one-warehouse, n-retailer system with stochastic demand. In this distribution system, items are first jointly replenished and therefore can share a major ordering cost. Then a coordinated delivery scheduling is adopted to arrange the delivery plan. The problem is formulated as a mixed integer nonlinear program. Subsequently, we introduce two algorithms to handle this complex problem: a Lipschitz optimization method and a modified RAND heuristic. Numerical experiments show that the proposed methods are quite efficient. Sensitivity analysis also shows some interesting findings in terms of management.

关键词： joint replenishment mixed integer non‐ linear program Lipschitz optimization heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Variables Bounding Based Retiming Algorithm

引用

Journal of Computer Science & Technology 2002年第6期17卷 797-806页

作者：宫宗伟林争辉陈后鹏 VLSI Research Institute Shanghai Jiaotong University Shanghai 200030 P.R. China

Retiming is a technique for optimizing sequential circuits. In this paper, wediscuss this problem and propose an improved retiming algorithm based on variables *** the computation of the lower and upper bounds on variables, the algorithm can signi-ficantly reduce the number of constraints and speed up the execution of retiming. Furthermore,the elements of matrixes D and W are computed in a demand-driven way, which can reducethe capacity of memory. It is shown through the experimental results on ISCAS89 benchmarksthat our algorithm is very effective for large-scale sequential circuits.

关键词： retiming linear program sequential circuits digital integrated circuit'electronic design automation

来源：评论

学校读者我要写书评

暂无评论

Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems

引用

OPERATIONS RESEARCH LETTERS 2013年第3期41卷 249-251页

作者： Feinberg, Eugene A. Huang, Jefferson SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA

This note considers an average-cost Markov Decision Process (MDP) with finite state and action sets and satisfying the additional condition that there is a state to which the system jumps from any state and under any action with a positive probability. The main result is that the policy iteration algorithm is strongly polynomial for such MDPs, which are often used to model replacement and maintenance problems. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Markov Decision Process Average cost Policy iteration algorithm linear program Simplex method Strongly polynomial

来源：评论

学校读者我要写书评

暂无评论

On Complete Targets Coverage in RF-Harvesting Internet of Things Networks

引用

IEEE COMMUNICATIONS LETTERS 2019年第5期23卷 922-925页

作者： Li, Chuyu Chin, Kwan-Wu Yang, Changlin Univ Wollongong Sch Elect Comp & Telecommun Engn Wollongong NSW 2500 Australia Zhongyuan Univ Technol Sch Comp Sci Zhengzhou 450007 Henan Peoples R China

This letter considers radio frequency (RF) energy harvesting and targets monitoring sensor nodes that are managed by a hybrid access point (HAP). We address a novel problem called maximizing data collected for complete targets' coverage (MDC-CTC) that involves computing a schedule comprising the time used by the HAP for charging, and the time used by the sensor nodes for monitoring targets and data upload. We model the MDC-CTC problem as a linear program (LP) and use it to determine the optimal schedule that maximizes the amount of data collected by the HAP. In addition, we also propose a heuristic to generate a subset of set covers for use by the LP in large-scale networks. Our results show that the amount of data collected by the HAP is proportional to the number of sensor nodes or the HAP's transmission power. Finally, using our heuristic along with the formulated LP yields results that are within 75% of the optimal result.

关键词： Energy harvesting networks IoTs data collection targets coverage linear program heuristic

来源：评论

学校读者我要写书评

暂无评论

Recovery of short, complex linear combinations via e₁ minimization

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第4期51卷 1568-1570页

作者： Tropp, JA Univ Texas ICES Austin TX 78712 USA

This note provides a condition under which e 1 minimization (also known as basis pursuit) can recover short linear combinations of complex vectors chosen from fixed, overcomplete collection. This condition has already... 详细信息

关键词： algorithms approximation basis pursuit linear program redundant dictionaries sparse representations

来源：评论

学校读者我要写书评

暂无评论

PRIOR REDUCED FILL-IN IN SOLVING EQUATIONS IN INTERIOR POINT ALGORITHMS

引用

OPERATIONS RESEARCH LETTERS 1992年第4期11卷 195-198页

作者： BIRGE, JR FREUND, RM VANDERBEI, R PRINCETON UNIV DEPT CIVIL ENGN & OPERAT RESPRINCETONNJ 08544 UNIV MICHIGAN ANN ARBORMI 48109 MIT ALFRED P SLOAN SCH MANAGEMENTCAMBRIDGEMA 02139

The efficiency of interior-point algorithms for linear programming is related to the effort required to factorize the matrix used to solve for the search direction at each iteration. When the linear program is in symmetric form (i.e., the constraints are Ax less-than-or-equal-to b, x greater-than-or-equal-to 0), then there are two mathematically equivalent forms of the search direction, involving different matrices. One form necessitates factoring a matrix whose sparsity pattern has the same form as that of (AA(T)). The other form necessitates factoring a matrix whose sparsity pattern has the same form as that of (A(T)A). Depending on the structure of the matrix A, one of these two forms may produce significantly less fill-in than the other. Furthermore, by analyzing the fill-in of both forms prior to starting the iterative phase of the algorithm, the form with the least fill-in can be computed and used throughout the algorithm. Finally, this methodology can be applied to linear programs that are not in symmetric form, that contain both equality and inequality constraints.

关键词： INTERIOR-POINT ALGORITHM linear program FACTORIZATION FILL-IN

来源：评论

学校读者我要写书评

暂无评论

An economic analysis model for the energy storage system applied to a distribution substation

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2012年第1期34卷 132-137页

作者： Leou, Rong-Ceng Cheng Shiu Univ Dept Elect Engn Kaohsiung Taiwan

Recent developments and advances in energy storage technologies are making the application of energy storage technologies a viable solution to power applications. The energy storage system can store energy previously, and then release it in the proper time. Due to their flexibility, it is suitable to apply this technology to deregulated power markets. Therefore, this paper will build the economic analysis model for the energy storage system to apply to a distribution substation in a deregulated power market. The costs including installing energy storage system and operation and maintenance expense, and the revenues containing energy price arbitrage, reducing transmission access cost, and deferring facility investment are considered in this model. All these factors are evaluated by present worth value. Due to complexity of this problem, this paper proposes a method combining the genetic algorithm with linear program (GALP) to determine the optimal capacity and operations of the energy storage system. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Energy storage system Deregulated power market Transmission access cost Genetic algorithm linear program

来源：评论

学校读者我要写书评

暂无评论

An Efficient LP-Based Approach for Spatial-Temporal Coordination of Electric Vehicles in Electricity-Transportation Nexus

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2023年第3期38卷 2914-2925页

作者： Wang, Hongru Ye, Yujian Wang, Qi Tang, Yi Strbac, Goran Southeast Univ Sch Cyber Sci & Engn Nanjing 210096 Jiangsu Peoples R China Southeast Univ Sch Elect Engn Nanjing 210096 Jiangsu Peoples R China Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

A growing integration of electric vehicles (EV) and fast charging stations (FCS) has paved the way for the emergence of transportation and power distribution networks. However, previous work on the coordination of EV in the transportation system mainly focuses on static traffic assignment (STA) models which are unable to characterize the temporal evolution of EV flows on traffic links. Meanwhile, limited prior effort in dynamic traffic assignment (DTA) employs a static FCS model which is unable to describe the temporal evolution of charging and discharging (C&D) behavior of EV flows, while respecting the state-of-charge (SoC) related operating constraints, hindering full exploitation of EV flexibility potentials. To bridge the knowledge gap, this paper proposes a novel DTA model to optimize the spatial-temporal distribution of EV flows on roads and at FCSs, taking into account their flexible C&D options and SoC-related constraints, through the solution of only a single linear program. Case studies validate the effectiveness of the proposed DTA model by benchmarking its performance against traditional STA models, and corroborate the core benefits from the proposed spatial-temporal coordination of EV C&D demand in the power distribution network in terms of peak demand reduction, improved RES absorption, reduced carbon emission as well as more efficient network congestion management.

关键词： Roads Indexes Biological system modeling Power system dynamics Transportation Behavioral sciences Electric vehicle charging Dynamic traffic assignment electric vehicles linear program state-of-charge transportation electrification

来源：评论

学校读者我要写书评

暂无评论

Augmented reality-based block piling game with superimposed collapse prediction

引用

VIRTUAL REALITY 2013年第4期17卷 279-292页

作者： Okamoto, Kazuya Kume, Naoto Tokunaga, Tatsuya Tanaka, Yoko Terasawa, Noriaki Tsukasa, Takashi Takemura, Tadamasa Yoshihara, Hiroyuki Kyoto Univ Hosp Dept Med Informat Kyoto 606 Japan Kyoto Univ Grad Sch Informat Kyoto Japan

Understanding what cannot be seen is difficult. Physical behavior can be explained on the basis of physical theories even if the behavior cannot be observed. Explanation of what is physically happening in the real world would become easy, however, if annotations were superimposed on the real objects. Herein, the authors demonstrate how an understanding of a physical event can be facilitated by overlapping a real-world situation with a simulation that predicts a future state. This idea is demonstrated in a game application in which a player stacks blocks into a pile until it collapses. In general, it is easy to estimate whether a block on the edge of a table will fall or not. However, it is more difficult to predict whether a stack of many blocks will collapse, and in what manner the stack will collapse. Even though previous research has demonstrated that the problem of how two-dimensionally stacked blocks collapse can be reduced to solving a sequence of convex quadratic programs, algorithms for convex quadratic programs require massive computational resources. Hence, the authors developed a fast and new algorithm based on a linear program. The proposed algorithm realizes real-time simulation based on physics that superimposes predicted collapse. The block that is predicted to fall is superimposed on the real block with a lit background projection. The system was evaluated in an experiment, and superimposed augmented reality annotation was observed to be efficient. The system was also demonstrated in game contests and received positive feedback and comments.

关键词： Augmented reality Block collapse linear program Overhang problem Physical simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：