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

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Saito, Tomohiko Matsushima, Toshiyasu Hirasawa, Shigeichi Shonan Inst Technol Fac Engn Fujisawa Kanagawa 2518511 Japan Waseda Univ Sch Fundamental Sci & Engn Tokyo 1698555 Japan Waseda Univ Res Inst Sci & Engn Tokyo 1698555 Japan

ISBN: (纸本)9781538666500

In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and linear programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds.

关键词： Error correction codes Upper bound linear programming Hamming weight Binary codes Conferences

来源：评论

学校读者我要写书评

暂无评论

linear programming Complementation

arXiv

引用

arXiv 2019年

作者： Gadouleau, Maximilien Mertzios, George B. Zamaraev, Viktor Department of Computer Science Durham University United Kingdom Department of Computer Science University of Liverpool United Kingdom

In this paper we introduce a new operation for linear programming (LP), called LP complementation, which resembles many properties of LP duality. Given a maximisation (resp. minimisation) LP P, we define its complement Q as a specific minimisation (resp. maximisation) LP which has the same objective function as P. Our central result is the LP complementation theorem, that establishes the following relationship between the optimal value Opt(P) of P and the optimal value Opt(Q) of its complement: (Equation presented). The LP complementation operation can be applied if and only if P has an optimum value greater than 1. As it turns out, LP complementation has far-reaching implications. To illustrate this, we first apply LP complementation to hypergraphs. For any hypergraph H, we review the four classical LPs, namely covering K(H), packing P (H), matching M (H), and transversal T (H). For every hypergraph H = (V, E), we call H = (V, {V \ e: e ∈ E}) the complement of H. For each of the above four LPs, we relate the optimal values of the LP for the dual hypergraph H∗ to that of the complement hypergraph (Equation presented). As a second application of LP complementation, we consider fractional graph theory. We prove that the LP for the fractional in-dominating number of a digraph D is the complement of the LP for the fractional total out-dominating number of the digraph complement D of D. Furthermore we apply the hypergraph complementation theorem to matroids. We establish that the fractional matching number of a matroid coincide with its edge toughness. This result can then be applied to graphic matroids, yielding a formula for the edge toughness of a graph. Moreover, we derive an alternative proof of the relationship between the edge toughness of a matroid and the fractional covering number of its dual matroid. As our last application of LP complementation, we introduce the natural problem Vertex Cover with Budget (VCB): for a graph G = (V, E) and a positive integer b, w

关键词： linear programming

来源：评论

学校读者我要写书评

暂无评论

L1-norm vs. L2-norm fitting in optimizing focal multi-channel tES stimulation: linear and semidefinite programming vs. weighted least squares

arXiv

引用

arXiv 2022年

作者： Prieto, Fernando Galaz Rezaei, Atena Samavaki, Maryam Pursiainen, Sampsa Computing Sciences Unit Faculty of Information Technology and Communication Sciences Tampere University Tampere Finland

Background and Objective: This study focuses on Multi-Channel Transcranial Electrical Stimulation, a non-invasive brain method for stimulating neuronal activity under the influence of low-intensity currents. We introduce mathematical formulation for finding a current pattern which optimizes a L1-norm fit between a given focal target distribution and volume current density inside the brain. L1-norm is well-known to favor well-localized or sparse distributions compared to L2-norm (least-squares) fitted estimates. Methods: We present a linear programming approach which performs L1-norm fitting and penalization of the current pattern (L1L1) to control the number of non-zero currents. The optimizer filters a large set of candidate solutions using a two-stage metaheuristic search in from a pre-filtered set of candidates. Results: The numerical simulation results, obtained with both a 8- and 20-channel electrode montages, suggest that our hypothesis on the benefits of L1-norm data fitting is valid. As compared to L1-norm regularized L2-norm fitting (L1L2) via semidefinite programming and weighted Tikhonov least-squares method, the L1L1 results were overall preferable with respect to maximizing the focused current density at the target position and the ratio between focused and nuisance current magnitudes. Conclusions: We propose the metaheuristic L1L1 optimization approach as a potential technique to obtain a well-localized stimulus with a controllable magnitude at a given target position. L1L1 finds a current pattern with a steep contrast between the anodal and cathodal electrodes meanwhile suppressing the nuisance currents in the brain, hence, providing a potential alternative to modulate the effects of the stimulation, e.g., the sensation experienced by the *** Codes 49M05 © 2022, CC BY-NC-ND.

关键词： linear programming

来源：评论

学校读者我要写书评

暂无评论

Discrete-Event Simulation and Integer linear programming for Constraint-Aware Resource Scheduling

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2018年第9期48卷 1578-1593页

作者： Shin, Seung Yeob Brun, Yuriy Balasubramanian, Hari Henneman, Philip L. Osterweil, Leon J. Univ Massachusetts Coll Informat & Comp Sci Amherst MA 01003 USA Univ Luxembourg L-1855 Luxembourg Luxembourg Univ Massachusetts Dept Mech & Ind Engn Amherst MA 01003 USA Univ Massachusetts Sch Med Worcester MA 01199 USA

This paper presents a method for scheduling resources in complex systems that integrate humans with diverse hardware and software components, and for studying the impact of resource schedules on system characteristics. The method uses discrete-event simulation and integer linear programming, and relies on detailed models of the system's processes, specifications of the capabilities of the system's resources, and constraints on the operations of the system and its resources. As a case study, we examine processes involved in the operation of a hospital emergency department, studying the impact staffing policies have on such key quality measures as patient length of stay (LoS), number of handoffs, staff utilization levels, and cost. Our results suggest that physician and nurse utilization levels for clinical tasks of 70% result in a good balance between LoS and cost. Allowing shift lengths to vary and shifts to overlap increases scheduling flexibility. Clinical experts provided face validation of our results. Our approach improves on the state of the art by enabling using detailed resource and constraint specifications effectively to support analysis and decision making about complex processes in domains that currently rely largely on trial and error and other ad hoc methods.

关键词： Discrete-event simulation (DES) human-intensive systems linear programming resource planning resource policy

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient task scheduling on heterogeneous computing systems by linear programming

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2018年第19期30卷

作者： Zhang, Yujian Wang, Yun Tang, Xueyan Yuan, Xin Xu, Yifan Southeast Univ Minist Educ Key Lab Comp Network & Informat Integrat Nanjing Jiangsu Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing 210096 Jiangsu Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore Southeast Univ Network & Informat Ctr Nanjing Jiangsu Peoples R China

The continually increasing energy consumption represents a critical issue in modern heterogeneous computing systems. With the aid of dynamic voltage frequency scaling (DVFS), task scheduling is considered an effective software-based technique for reducing the total energy consumption and minimizing the overall schedule length (makespan). A natural solution is to reclaim the slack time in a given time-efficient schedule, which is also referred to as a two-pass method or a rescheduling method. A number of studies have focused on slack reclamation to achieve energy reductions through heuristics;although, these methods offer suboptimal solutions. In this article, the rescheduling optimization problem is formulated as a linear program for minimizing an energy objective function subject to precedence and deadline constraints implied in the given schedule. Two types of decision variables, ie, frequency duty factors and task intervals, are defined to set up the linear model. Consequently, an optimal solution to the problem can be provided in a straightforward manner by a linear programming solver, which suggests that such a rescheduling problem belongs to the P (polynomial time) class. The experimental results show the effectiveness of the proposed approach and demonstrate that the performance is superior to that of other competitive algorithms in terms of both energy saving and runtime efficiency.

关键词： dynamic voltage frequency scaling (DVFS) energy efficiency heterogeneous computing system linear programming slack reclamation task scheduling

来源：评论

学校读者我要写书评

暂无评论

Comprehensive mixed-integer linear programming model for distribution system reconfiguration considering DGs

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第20期12卷 4515-4523页

作者： Teshome, Dawit F. Lian, Kuo Lung Univ Alberta Dept Elect & Comp Engn Edmonton AB Canada NTUST Dept Elect Engn Taipei Taiwan

Distribution system reconfiguration (DSR) is a critical process that improves the power transfer efficiency and reduces the over-all operational cost. There have been various methods for addressing the DSR problems. Recently, DSR problems formulated in mixed-integer linear programming (MILP) has gained popularity as they generally can be solved by the state-of-the-art commercially accessible linear programming solvers, and is able to solve the system with thousands of unknown variables within a reasonable time. However, in some MILP formulations, the distribution line losses are omitted in the nodal power injections for the sake of simplicity. This compromises the accuracy of the linearised model and contributes to the disparity between the MILP and the true non-linear model. Hence, in this study, new formulations are introduced for embedding the expressions of line losses inside load flow equations so that the deviations between the modelled and exact losses notably reduce. Moreover, other novel formulations have also been presented for simultaneously optimising distributed generation (DG) locations and sizes, while at the same time considering various DG's modes of connection to the distribution grid. The validity and effectiveness of the proposed MILP model is tested on standard IEEE systems and actual distribution network.

关键词： linear programming distributed power generation distribution networks integer programming load flow MILP formulations distribution line losses nodal power injections linearised model contributes nonlinear model modelled losses exact losses novel formulations sizes distribution grid MILP model standard IEEE systems actual distribution network enhanced mixed-integer linear programming model distribution system reconfiguration integrating critical process power transfer efficiency operational cost DSR problems state-of-the-art commercially accessible linear programming solvers unknown variables reasonable time

来源：评论

学校读者我要写书评

暂无评论

Improving Self-Consumption of Green Energy Using linear programming for Reactive Control of Smart Devices

引用

INFORMATICA 2018年第2期29卷 187-210页

作者： Amato, Alba Scialdone, Marco Venticinque, Salvatore Univ Campania Luigi Vanvitelli Dept Engn Via Roma 29 I-81031 Aversa CE Italy

A relevant challenge introduced by decentralized installations of photo-voltaic systems is the mismatch between green energy production and the load curve for domestic use. We advanced an ICT solution that maximizes the self-consumption by an intelligent scheduling of appliances. The predictive approach is complemented with a reactive one to minimize the short term effects due to prediction errors and to unforeseen loads. Using real measures, we demonstrated that such errors can be compensated modulating the usage of continuously running devices such as fridges and heat-pumps. linear programming is used to dynamically compute in real-time the optimal control of these devices.

关键词： smart energy linear programming performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Whole-Body Kinematic Control of Nonholonomic Mobile Manipulators Using linear programming

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2018年第2期91卷 263-278页

作者： Quiroz-Omana, Juan Jose Adorno, Bruno Vilhena Fed Univ Minas Gerais UFMG Grad Program Elect Engn Av Antonio Carlos 6627 BR-31270901 Belo Horizonte MG Brazil Fed Univ Minas Gerais UFMG Dept Elect Engn Av Antonio Carlos 6627 BR-31270901 Belo Horizonte MG Brazil

This paper presents some improvements to the robot kinematic control strategy based on linear programming, as well as its application to a nonholonomic mobile manipulator. In addition to being computationally efficient, this approach enables the inclusion of inequality and equality constraints in the system control inputs and has formal guarantee of stability. We first propose a new positive definite function of the error variation to avoid joint movements when the robot end-effector stabilizes at a point different from the desired one. In addition, the nonholonomic constraint of the mobile base is imposed as an equality constraint, and inequality constraints are defined to avoid both violation of joint limits and collisions between the mobile base and obstacles in the plane. Last, a performance comparison between the linear programming strategy and an approach based on the pseudoinverse of the whole-body Jacobian matrix is presented. Experimental results show that the controller based on linear programming has low computational cost, and the robot is able to control its end-effector without colliding with obstacles in the plane and without violating its joints limits. However, it tends to generate more abrupt control signals than the continuous controller based on the pseudoinverse of the whole-body Jacobian matrix.

关键词： Whole-body control Kinematic control Mobile manipulator Dual quaternion linear programming Parsimonious control

来源：评论

学校读者我要写书评

暂无评论

A linear programming model to reduce rank violations while eliciting preference from pairwise comparison matrix

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2018年第9期69卷 1512-1523页

作者： Chen, Kun Kou, Gang Li, Chenhua Nanjing Audit Univ Coll Auditing & Evaluat Nanjing Jiangsu Peoples R China Southwestern Univ Finance & Econ Sch Business Adm Chengdu Sichuan Peoples R China Nanjing Audit Univ Sch Govt Audit Nanjing Jiangsu Peoples R China

Rank violation is a crucial criterion to decide the ordinal consistency of a priority vector derived from a pairwise comparison matrix. Popular prioritisation methods, such as the eigenvalue method, logarithmic least squares, and weighted least squares have not guaranteed minimal rank violations even with cardinal consistency examination. This article closes this gap by proposing a linear-programming-based procedure to update a priority vector obtained by one of the popular prioritisation methods with a better one that ensures minimal rank violations. Taking advantage of rank preservation in an improved linear programming model, the proposed procedure can examine the feasibility of including inconsistent constraints with respect to a given priority vector, and hence determines the existence of a better priority vector with reduced rank violations. The process of obtaining updated priority vectors by the proposed procedure is demonstrated in classic examples.

关键词： Multiple criteria analysis priority vector rank violation pairwise comparison matrix linear programming

来源：评论

学校读者我要写书评

暂无评论

Developing a successive linear programming model for head-sensitive hydropower system operation considering power shortage aspect

引用

ENERGY 2018年 155卷 252-261页

作者： Feng, Zhong-kai Niu, Wen-jing Wang, Sen Cheng, Chun-tian Jiang, Zhi-qiang Qin, Hui Liu, Yi Huazhong Univ Sci & Technol Sch Hydropower & Informat Engn Wuhan 430074 Hubei Peoples R China ChangJiang Water Resources Commiss Bur Hydrol Wuhan 430010 Hubei Peoples R China Minist Water Resources Key Lab Pearl River Estuarine Dynam & Associated Guangzhou 510611 Guangdong Peoples R China Dalian Univ Technol Inst Hydropower & Hydroinformat Dalian 116024 Peoples R China Dalian Univ Technol Key Lab Ocean Energy Utilizat & Energy Conservat Minist Educ Dalian Peoples R China

The power industry is playing an increasingly important role in the world economy, and insufficient power supply may lead to huge enormous economic loss throughout the world. Then, the problem of power shortage is receiving a great deal of attention from operators and managers in electrical power system. With the merits of fast startup-shutdown, hydropower is regarded as one of the most reliable renewable energy sources to smooth the electricity shortage of power grid. Thus, this paper focuses on the operation of head-sensitive hydropower system considering power shortage aspect. To effectively address this problem, a novel method based on linear programming and successive approximation is proposed, where the initial hydraulic heads of each hydroplants is generated based on the actual working condition, and then the linear programming method is used to solve the fixed-head hydropower optimization problem involving a carefully-designed min-max optimization objective, while the successive approximation strategy is employed to incrementally improve the solution's quality by dynamically updating water heads of all the hydropower plants. The simulations demonstrate that compared with the original load demand, our method can make an average of approximate 20% reduction in electricity shortage of power system, demonstrating its effectiveness and practicability. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Hydropower system Cascaded reservoirs Optimal operation Electricity shortage linear programming Successive approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：