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

Reliability evaluation of hybrid power markets based on multiple transaction matrix and optimal transaction curtailment

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2007年第1期1卷 65-71页

作者： Goel, L. Viswanath, P. A. Wang, P. Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore

A Monte Carlo simulation technique evaluates the reliability indices of restructured power systems with a hybrid market. A model for optimal transaction curtailment for a contingency state in a hybrid market is developed to incorporate the changes brought about by deregulation. The objective of the contingency optimal transaction curtailment for each individual generation company is to minimise its revenue loss. The problem is formulated as a linear programming problem and solved using an optimisation technique. Customer load curtailment, which is the basic parameter for reliability evaluation, is determined using a load-shedding philosophy which is based on the results of the optimal transaction curtailment by the genco. Supply and demand transactions of the market participants are represented by a transaction matrix. The impact of the firm and nonfirm bilateral and reserve contracts on customer reliabilities have been studied. The technique has been illustrated by application to the IEEE Reliability Test System.

关键词： power system reliability firm contracts reserve contracts reliability indices evaluation Power system management, operation and economics linear programming Optimisation techniques power markets Monte Carlo simulation technique linear programming problem supply and demand hybrid power markets IEEE Reliability Test System customer load curtailment nonfirm bilateral contracts optimisation technique restructured power systems load-shedding philosophy load shedding Monte Carlo methods optimal transaction curtailment multiple transaction matrix contingency state supply and demand transactions power system simulation deregulation

来源：评论

学校读者我要写书评

暂无评论

On the minimum average distance of binary codes: linear programming approach

引用

DISCRETE APPLIED MATHEMATICS 2001年第3期111卷 263-281页

作者： Fu, FW Wei, VK Yeung, RW Nankai Univ Dept Math Tianjin 300071 Peoples R China Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China

Ahlswede and Katona posed the following average distance problem: For every n and 1 less than or equal to M less than or equal to 2(n), determine the minimum average Hamming distance beta (n,M) of binary codes with length n and size M. In this paper. improved lower bounds for B(n,M) are found with the help of linear programming. As a corollary, beta (n, 2(n-2) +/- 1), beta (n, 2(n-1) + 2(n-2) +/-1), beta (n, 2(n-2)), beta (n, 2(n-1) + 2(n-2)), beta (n, 2(n-1) +/- 2) and beta (n, 2(n) - 2) are determined. Furthermore, an upper bound for beta (n, M) is obtained by constructing a binary code with length n and size M. This upper bound is tight for some cases, but not in general. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： binary codes average Hamming distance distance enumerator MacWilliams-Delsarte identity linear programming problem

来源：评论

学校读者我要写书评

暂无评论

linear optimization and fuzzy-based clustering for WSNs assisted internet of things

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2023年第4期82卷 5161-5185页

作者： Maratha, Priti Gupta, Kapil Natl Inst Technol Kurukshetra Dept Comp Applicat Kurukshetra Haryana India

Wireless data transmission on the Internet of Things (IoT) needs data-aware communication protocols. Clustering is one of the effective network management approaches that enhance the lifetime of IoT. The primary challenge in the data transmission across IoT is designing an energy-efficient clustering mechanism. Existing protocols struggle with the non-optimal selection of CHs and frequent re-clustering on IoT, which leads to significant energy consumption. If the cluster head (CH) lifetime of the devices (nodes) is known prior, then re-clustering can be avoided to a reasonable extent. Therefore, in this paper, we estimate the lifetime of devices as CHs by solving a linear optimization problem to extend the first node death as much as possible and also, stalls the frequent re-clustering process to minimize the energy consumption. We also apply the uniform distribution of CHs to ensure balanced energy consumption on IoT devices. The proposed clustering technique named ECFEL (Efficient Clustering using Fuzzy logic based on Estimated Lifetime) for IoT outperforms the existing protocols, namely Low Energy Adaptive Clustering Hierarchy (LEACH), MODified LEACH (MOD-LEACH), Dynamic k-LEACH (DkLEACH), Novel-PSO-LEACH, FM-SCHEL, and M-IWOCA techniques in terms of first node death (FND), half node death (HND), last node death (LND). Our simulation results showcase that ECFEL is having a better lifetime in terms of FND, HND, and LND, respectively. Furthermore, the experiments also confirm that ECFEL consumes less energy while maintaining a packet delivery ratio for a more extended period.

关键词： Sensor networks Network lifetime Fuzzy logic Residual energy Node centrality linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Recursive Algorithm for L1 Norm Estimation in linear Models

引用

JOURNAL OF SURVEYING ENGINEERING 2011年第1期137卷 1-8页

作者： Khodabandeh, A. Amiri-Simkooei, A. R. Univ Tehran Dept Surveying & Geomat Engn Geodesy Div Fac Engn Tehran Iran Delft Univ Technol Delft Inst Earth Observat & Space Syst Fac Aerosp Engn NL-2629 HS Delft Netherlands Univ Isfahan Dept Surveying Engn Fac Engn Esfahan 81744 Iran

L1 norm estimator has been widely used as a robust parameter estimation method for outlier detection. Different algorithms have been applied for L1 norm minimization among which the linear programming problem based on the simplex method is well known. In the present contribution, in order to solve an L1 norm minimization problem in a linear model, an interior point algorithm is developed which is based on Dikin's method. The method can be considered as an appropriate alternative for the classical simplex method, which is sometimes time-consuming. The proposed method, compared with the simplex method, is thus easier for implementation and faster in performance. Furthermore, a recursive form of the Dikin's method is derived, which resembles the recursive least-squares method. Two simulated numerical examples show that the proposed algorithm gives as accurate results as the simplex method but in considerably less time. When dealing with a large number of observations, this algorithm can thus be used instead of the iteratively reweighted least-squares method and the simplex method.

关键词： Iteratively reweighted least squares linear programming problem Interior point methods Simplex method Affine method of Dikin Robust estimation L1 norm minimization Recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Optimal Distribution problem for Teams of Specialists

引用

AUTOMATION AND REMOTE CONTROL 2019年第1期80卷 93-101页

作者： Burkov, V. N. Rossikhina, L. V. Vyunov, A. P. Rogovaya, L. V. Russian Acad Sci Trapeznikov Inst Control Sci Moscow Russia Voronezh Inst Fed Penitentiary Serv Voronezh Russia Fed Penitentiary Serv Cent Regulatory & Tech Lab Moscow Russia JSC Voronezhsintezkauchuk Res Ctr Voronezh Russia

We consider the task of assigning teams of specialists who jointly perform certain types of jobs (consulting services, compliance assessment for products, goods or services according to given requirements etc.). The team performing this work is composed of a set of specialists of various types (specialties), and their total number is limited. The problem is to design a team work plan for which the time to complete all jobs is minimal. We reduce this task to a linear programming problem and also consider heuristic algorithms and special cases of the problem.

关键词： team of specialists schedule set of teams linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Constrained regulation problem for continuous-time stochastic systems under state and control constraints

引用

JOURNAL OF VIBRATION AND CONTROL 2022年第21-22期28卷 3218-3230页

作者： Si, Xindong Yang, Hongli Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Peoples R China

Constrained regulation problem (CRP) for continuous-time stochastic systems is investigated in this article. New existence conditions of linear feedback control law for continuous-time stochastic systems under constraints are proposed. The computation method for solving constrained regulation problem of stochastic systems considered in this article is also presented. Continuous-time stochastic linear systems and stochastic nonlinear systems are focused on, respectively. First, the condition of polyhedral invariance for stochastic systems is established by using the theory of positive invariant set and the principle of comparison. Second, the asymptotic stability conditions in the sense of expectation for two types of stochastic systems are established. Finally, finding the linear feedback controller model and corresponding algorithm of constrained regulation problem for two types of stochastic systems are also proposed by using the obtained condition. The presented model of the stochastic constrained regulation problem in this article is formulated as a linear programming problem, which can be easily implemented from a computational point of view. Our approach establishes a connection between the stochastic constrained regulation problem and positively invariant set theory, as well as provides the possibility of using optimization methodology to find the solution of stochastic constrained regulation problem, which differs from other methods. Numerical examples illustrate the proposed method.

关键词： Stochastic nonlinear systems stochastic linear systems positive invariant set linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Correcting a Single Error in Feedback Channels

引用

problemS OF INFORMATION TRANSMISSION 2022年第4期58卷 329-340页

作者： Vorobyev, I. V. Deppe, C. Lebedev, A. V. Lebedev, V. S. Tech Univ Munich Munich Germany Russian Acad Sci Kharkevich Inst Informat Transmiss Problems Moscow Russia

We address the problem of correcting a single error in an arbitrary discrete memoryless channel with error-free instantaneous feedback. For the case of a one-time feedback, we propose a method for constructing optimal transmission strategies. The obtained result allows us to prove that for a binary channel, two feedbacks are sufficient to transmit the same number of messages as in the case of complete feedback. We also apply the developed techniques to a binary asymmetric channel to construct transmission strategies for small lengths.

关键词： coding with feedback symmetric channel asymmetric channel Hamming bound linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Quasi-finite-rank approximation of compression operators on L_∞[0, h) with application to stability analysis of time-delay systems

引用

IET CONTROL THEORY AND APPLICATIONS 2014年第2期8卷 77-85页

作者： Kim, Jung Hoon Hagiwara, Tomomichi Kyoto Univ Dept Elect Engn Nishikyo Ku Kyoto 6158510 Japan

This study discusses a new method for approximating compression operators, which play important roles in the operator-theoretic approach to sampled-data systems and time-delay systems. Stimulated by the success in the application of quasi-finite-rank approximation of compression operators defined on the Hilbert space L-2[0, h), the authors study a parallel problem for compression operators defined on the Banach space L[0, h). In spite of similarity between these problems, they are led to applying a completely different approach because of essential differences in the underlying spaces. More precisely, they apply the idea of the conventional fast-sample/fast-hold (FSFH) approximation technique, and show that the approximation problem can be transformed into such a linear programming problem that asymptotically leads to optimal approximation as the FSFH approximation parameter M tends to infinity. Finally, they demonstrate the effectiveness of the L[0, h)-based approximation technique through numerical examples, with particular application to stability analysis of time-delay systems.

关键词： approximation theory Banach spaces delay systems Hilbert spaces linear programming sampled data systems stability quasi-finite rank approximation compression operator stability analysis time delay system operator theory approach sampled data system Hilbert space L-2[0, h) parallel problem Banach space L-a[0, h) fast sample-fast hold FSFH approximation technique linear programming problem L-a[0, h)-based approximation technique

来源：评论

学校读者我要写书评

暂无评论

Energy provision minimisation in large-scale wireless powered communication networks with throughput demand

引用

IET COMMUNICATIONS 2020年第3期14卷 458-465页

作者： Ge, Haijiang Yu, Zhanwei Chi, Kaikai Mao, Keji Shao, Qike Chen, Lijian Zhejiang Univ Technol Sch Comp Sci & Technol Hangzhou 310023 Zhejiang Peoples R China Hangzhou Vocat & Tech Coll Inst Informat Engn Hangzhou 310018 Zhejiang Peoples R China

So far, the research of wireless powered communication networks (WPCNs) mainly considers the scenarios with a single radio-frequency (RF) energy transmitter (ET) and a single sink. However, in practice, there are many applications where multiple ETs and sinks need to be deployed. This study focuses on large-scale WPCNs having multiple RF ETs and sinks. Specifically, the authors aim to minimise the total energy provision by optimising ETs' transmit powers with the node-throughput demand and sum-throughput demand, respectively. For the node-throughput demand case, they firstly formulate it to be a convex optimisation problem, then transform it to be a linear programming (LP) problem, and finally present a distributed algorithm to obtain the optimal solution. For the sum-throughput demand case, they firstly formulate it to be a non-linear optimisation problem, then prove its convexity and finally propose an efficient dual subgradient algorithm to obtain the optimal solution. Simulation results demonstrate that compared to the sum-throughput demand, imposing the node-throughput demand can effectively alleviate the throughput unfairness at the cost of increased energy provision;the proposed optimal algorithms can substantially decrease the total energy provision of ETs;the energy provision reduction percentage achieved by their schemes increases as the number of ETs increases.

关键词： inductive power transmission linear programming optimisation cooperative communication convex programming distributed algorithms resource allocation efficient dual subgradient algorithm optimal transmit power throughput unfairness problem increased energy provision total energy provision energy provision reduction percentage ETs increases energy provision minimisation wireless powered communication networks single radio-frequency energy transmitter single sink multiple ETs available power provision data collection schemes multiple RF ETs transmit power allocation large-scale WPCNs node-throughput demand case convex optimisation problem linear programming problem sum-throughput demand case nonlinear optimisation problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：