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

optimal flood control operation for the Three Gorges and Qingjiang cascade reservoirs

Optimal flood control operation for the Three Gorges and Qin...

5th International Symposium on Integrated Water Resources Management/3rd International Symposium on Methodology in Hydrology

作者： Guo, Shenglian Li, Yu Chen, Jionghong Wuhan Univ State Key Lab Water Resources & Hydropower Engn S Wuhan 430072 Peoples R China

ISBN: (纸本)9781907161254

Both separate and joint flood control operation models or the Three Gorges and Qingjiang cascade reservoirs are proposed. The models were solved by the modified progressive optimality algorithm according to the procedure of optimization-veritication-adjustment and its constraint conditions were treated by dynamic penalty function. Four typical years of 1954, 1981, 1982 and 1998 were selected to derive the design flood hydrographs for the corresponding return periods by the peak and volume amplitude method. The conventional, separate and joint cascade operation Hood control models were performed for these reservoirs. The results show that the separate cascade operation gives full play to the role of flood control storage compensation between cascade reservoirs, while joint cascades operation can also perform storage compensation between two cascades. The Jingjiang River flood control standards can be raised to 118-year and 136-year design floods based on 1982 typical year, and 150-year and 168-year design floods based on the average of four typical years, respectively.

关键词： cascade reservoirs storage compensation flood control operation optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal algorithm for slab designing of fixed weight slabs

Beijing Keji Daxue Xuebao/Journal of University of Science a...

引用

Beijing Keji Daxue Xuebao/Journal of University of Science and Technology Beijing 2008年第10期30卷 1179-1183页

作者： Xi, Yang Li, Tieke School of Economics and Management University of Science and Technology Beijing Beijing 100083 China Business School Beijing Institute of Fashion Technology Beijing 100029 China

A kind of slab designing problem was brought forward, in which the weight of slabs is fixed and the customer order demand specifications of weight and width are interval values. A multi-objective model to minimize the number of slabs and the total surplus weight was built. Based on the idea of the order-slab matrix and the compatible set of slabs, a two-stage optimal algorithm was proposed to solve the problem. In the algorithm, the first stage is to minimize the number of slabs, and the second stage is to minimize the total surplus weight. For this algorithm, the optimal nature was proved theoretically and an application case was given based on practical data.

关键词： Customer order Interval value optimal algorithm Slab designing

来源：评论

学校读者我要写书评

暂无评论

Hybrid GA-BF based intelligent PID controller tuning for AVR system

引用

APPLIED SOFT COMPUTING 2011年第1期11卷 11-22页

作者： Kim, Dong Hwa Hanbat Natl Univ Dept Instrumentat & Control Eng Taejon 305719 South Korea

This paper deals with hybrid system (GA-BF) based on the conventional GA (Genetic algorithm) and BF (Bacterial Foraging) which is the social foraging behavior of bacteria. A variety of test function is introduced and simulated to illustrate the characteristics and performance by mutation, crossover, variation of step size, variation of chemotactic step, and variation of lifetime of bacteria in the proposed hybrid system GA-BF. The simulated results represent that the proposed method is highly satisfactory. This approach provides us with novel hybrid model based on foraging behavior and also with a possible new connection between evolutionary forces in social foraging and distributed nongradient optimization algorithm design for global optimization over noisy surfaces. (c) 2010 Published by Elsevier B.V.

关键词： Genetic algorithm Bacterial Foraging optimization Hybrid system optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal Quality of Service Routing Model for Multicast Network

An Optimal Quality of Service Routing Model for Multicast Ne...

引用

International Conference on Mechatronics and Intelligent Materials

作者： Feng, Shaowei Zhang, Jing Wang, Rui Naval Univ Engn Off Sci Res Wuhan 430033 Hubei Peoples R China Naval Univ Engn Training Dept Wuhan 430033 Hubei Peoples R China

ISBN: (纸本)9783037850695

The QoS requirement of a connection is given as a set of constraints, which can be link constraints, path constraints, or tree constraints. A feasible path (tree) is one that has sufficient residual resources to satisfy the QoS constraints of a connection. In this solution some complicated constraint are relaxed and the primal problem is decomposed into several sub problems. Primal feasible solutions are obtained by some heuristics and a link set adjusting method is proposed by the aggregate flow on links. In computational experiments, the proposed algorithm determines solutions that are within a few percent of an optimal solution with 30 nodes in the QoS model. In terms of performance, our solution has more significant improvement than simple heuristics. The improvement on the total revenue can reach 12% on the average in the QoS model. The improvement of heuristics 2 in the QoS model on the total revenue can reach 8% on the average.

关键词： Multicast network Quality of Service optimal algorithm Routing algorithm

来源：评论

学校读者我要写书评

暂无评论

optimal and Suboptimal Reconstruction of Non Gaussian Realizations on the Output of Non Linear Converters

Optimal and Suboptimal Reconstruction of Non Gaussian Realiz...

引用

10th WSEAS International Conference on TELECOMMUNICATIONS and INFORMATICS/10th WSEAS International Conference on MICROELECTRONICS, NANOELECTRONICS, OPTOELECTRONICS/and 10th WSEAS International Conference on SIGNAL PROCESSING

作者： Kazakov, Vladimir Olvera, Yair Natl Polytech Inst Mexico Mexico City DF Mexico

ISBN: (纸本)9781618040053

Two algorithms of sampling reconstruction procedures of non Gaussian processes are investigated. The optimal algorithm is analyzed on the basis of the conditional mean rule and cumulant functions. In this case the error reconstruction function depends on the given samples and on the probability density function of the given process. The non optimal algorithm is only based on the covariance function of the output process. We investigate the non Gaussian processes on the output of exponential and polynomial converters driven by the Gaussian Markov process. Comparison of both algorithms is given.

关键词： Conditional mean rule Non Gaussian process Non linear converter Non optimal algorithm optimal algorithm Sampling - Reconstruction Procedure

来源：评论

学校读者我要写书评

暂无评论

Speedup for natural problems and noncomputability

引用

THEORETICAL COMPUTER SCIENCE 2011年第4-5期412卷 478-481页

作者： Monroe, Hunter Int Monetary Fund Washington DC 20431 USA

A resource-bounded version of the statement "no algorithm recognizes all non-halting Turing machines" is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any (paddable) coNP-complete language and also equivalent to a superpolynomial speedup in proof length in propositional proof systems for tautologies, each of which implies P not equal NP. This suggests a correspondence between the properties "has no algorithm at all" and "has no best algorithm" which seems relevant to open problems in computational and proof complexity. (c) 2010 Elsevier B.V. All rights reserved.

关键词： Speedability Speedup coNP-complete Propositional proof system optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimized NGBM(1,1) model for forecasting the qualified discharge rate of industrial wastewater in China

引用

APPLIED MATHEMATICAL MODELLING 2011年第12期35卷 5524-5532页

作者： Wang, Zheng-Xin Hipel, Keith W. Wang, Qian He, Sha-Wei Zhejiang Normal Univ Sch Econ & Management Jinhua 321004 Zhejiang Peoples R China Univ Waterloo Dept Syst Design Engn Waterloo ON N2L 3G1 Canada

The Nonlinear Grey Bernoulli Model NGBM(1,1) performs well in the simulation and forecasting of series having non-linear variations. To improve the simulation and forecasting accuracy, the parameters optimization of an NGBM(1,1) model is formulated as a combinatorial optimization problem and is solved collectively using LINGO (an Operational Research software) in this paper. The optimized result has been verified by a numerical example of a fluctuating sequence and a case study of opto-electronics industry in Taiwan. Comparisons of the obtained simulation results from the optimized combinatorial NGBM(1,1) model with the traditional one demonstrates that the optimal algorithm is a good alternative for parameters optimization of the NGBM(1,1) model. The optimized NGBM(1,1) model is used to simulate and forecast the annual qualified discharge rate of industrial wastewater in 31 provinces of China for the period from 2001 to 2011. The modeling results can assist the government in developing future policies regarding environmental management. (C) 2011 Elsevier Inc. All rights reserved.

关键词： NGBM(1,1) model optimal algorithm Forecasting Qualified discharge rate of industrial wastewater

来源：评论

学校读者我要写书评

暂无评论

optimal algorithms for the Economic Lot-Sizing Problem with Multi-supplier

Optimal Algorithms for the Economic Lot-Sizing Problem with ...

引用

6th International Conference on algorithmic Aspects in Information and Management

作者： Bai, Qing-Guo Xu, Jian-Teng Qufu Normal Univ Sch Operat Res & Management Sci Rizhao 276826 Shandong Peoples R China Sch Management Harbin Inst Technol Harbin Peoples R China

ISBN: (纸本)9783642143540

This paper considers the economic lot-sizing problem with multi-supplier in which the retailer may replenish his inventory from several suppliers. Each supplier is characterized by one of two types of order cost structures: incremental quantity discount cost structure and multiple set-ups cost structure. The problem is challenging clue to the mix of different cost structures. By analyzing the optimal properties, we reduce the searching range of the optimal solutions and develop several optimal algorithms to solve all cases of this multi-supplier problem.

关键词： Economic lot-sizing optimal algorithm dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Efficient State Estimation with Energy Harvesting and Fairness Control Using Stochastic Optimization

Efficient State Estimation with Energy Harvesting and Fairne...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Vijayandran, Luxmiram Brandt-Pearce, Maite Kansanen, Kimmo Ekman, Torbjorn Norwegian Univ Sci & Technol Dept Elect & Telecommun Trondheim Norway Univ Virginia Dept Elect & Comp Engn Charlottesville VA 22903 USA

ISBN: (纸本)9781424492688

Wireless sensor networks (WSN) intended for critical applications often rely on energy harvesting batteries, yet also require backup batteries to ensure uninterrupted operation. An optimal algorithm for resource allocation in such WSN used for state estimation is presented. The resulting state estimate approaches a minimum accuracy constraint with efficient use of the harvesting capability to minimize the use of the backup power. Power usage is fairly distributed among the sensors to prolong system lifetime. The algorithm is based on a stochastic Lyapunov optimization used with a standard Kalman filter estimator. The framework can achieve arbitrarily close to optimal power efficiency over time without requiring knowledge of either the channel or harvesting statistics. Asymptotically optimal efficiency is obtained at the expense of an increase in latency for the system to converge to the desired estimation accuracy.

关键词： Accuracy Batteries Optimization Resource management State estimation Wireless sensor networks asymptotically optimal efficiency backup batteries backup power energy harvesting energy harvesting batteries fairness control harvesting capability minimum accuracy constraint optimal algorithm optimal power efficiency optimisation power usage resource allocation standard Kalman filter estimator state estimation state estimation stochastic Lyapunov optimization stochastic optimization stochastic processes system lifetime uninterrupted operation wireless sensor networks wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Model and algorithm for Time-Dependent Team Orienteering Problem

Model and Algorithm for Time-Dependent Team Orienteering Pro...

引用

International Conference on Advanced Research on Computer Education, Simulation and Modeling

作者： Li, Jin Zhejiang Gongshang Univ Coll Comp Sci & Informat Engn Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9783642217821

In the team orienteering problem (TOP) a set of locations is Oven, each with a score. The goal is to determine a fixed number of routes, limited in length, that visit some locations and maximize the sum of the collected scores. The team orienteering problem is often used as a starting point for modeling many combinatorial optimization problems. This paper studies the time-dependent team orienteering problem considering the travel cost varying with time and visiting time constraints. After a mixed integer programming model is proposed, a novel optimal dynamic labeling algorithm is designed based on the idea of network planning and dynamic programming. Finally, a numerical example is presented to show the validity and feasibility of this algorithm.

关键词： Team orienteering problem time-dependent network travel time optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：