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

Data envelopment analysis-an application to turmeric production in North Western Region of Tamil Nadu

OPSEARCH 2010年第3期47卷 205-215页

作者： Louis, L. Joel, A. Avinashilingam Univ Women Fac Engn Dept Sci & Humanities Coimbatore 641108 Tamil Nadu India Tamil Nadu Agr Univ Ctr Plant Breeding & Genet Coimbatore 641003 Tamil Nadu India

The main objective of this research is to identify and analyze the sources of technical inefficiency in turmeric crop farming system in north western region of Tamil Nadu from a sample of 180 turmeric growing farmers. A non-parametric approach, Data Envelopment Analysis (DEA) has been used to estimate Technical Efficiency Scores (TES). Results indicate the presence of technical inefficiency in turmeric farming system. The average technical efficiency score is 79 per cent with the maximum score of 95 per cent and minimum score of 59 per cent. The potential to increase the technical efficiency score of turmeric growing farms is found to be 17 per cent.

关键词： Data envelopment analysis Technical efficiency linear programming problem CCR model

来源：评论

学校读者我要写书评

暂无评论

Generation of quadrilateral meshes from triangular data with resulting smooth surface reconstruction

Generation of quadrilateral meshes from triangular data with...

引用

IEEE Conference on Information Visualization

作者： Volpin, O Bercovier, M Hebrew Univ Jerusalem Inst Comp Sci IL-91904 Jerusalem Israel

ISBN: (纸本)0818685093

In this work a new method for surface reconstruction from an initial triangular mesh is introduced. The method transforms the mesh to a quadrilateral one and then builds a smooth surface on top of it. The present approach is efficient for large collections of triangular patches including difficult situations such as sharp junctions and n-patch vertices. During the reconstruction process the number of mesh elements is considerably reduced. The possibility of parallel computation mate a method efficient in practice. The method is illustrated by building several free form surfaces from a triangular mesh.

关键词： Bezier surface thin plate energy triangular mesh quadrilateral mesh linear programming problem

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Constraint-based Modelling (DCBM) Approach With Alternative Metabolic Objective Functions Predicts The impact of Oxidative Stress on Stored Red Blood Cells (RBCs) 10

A Dynamic Constraint-based Modelling (DCBM) Approach With Al...

引用

10th Vienna International Conference on Mathematical Modelling (MATHMOD)

作者： Yasemi, Mohammadreza Prudent, Michel Jolicoeur, Mario Ecole Polytech Montreal Res Lab Appl Metab Engn Dept Chem Engn POB 6079 Montreal PQ H3C 3A7 Canada Transfus Interreg CRS Lab Rech Sur Produits Sanguins Epalinges Switzerland Univ Lausanne Fac Biol & Med Ctr Transfus Sanguine Lausanne Switzerland Lausanne Univ Hosp Ctr Res & Innovat Clin Pharmaceut Sci Lausanne Switzerland Univ Lausanne Lausanne Switzerland

Mathematical metabolic modelling is a systematic endeavour to allow identifying the main causes of an observed metabolic change and to estimate the consequences of an imposed metabolic perturbation regarding a biosystem. Dynamic Constraint -based modelling (DCBM) has delivered promising results in metabolic engineering and in bioprocess design by providing mechanistically relevant systems-level knowledge of a network of bioreactions. Here, we seek to establish a DCBM approach that leverages convex optimization and nonlinear regression mathematical toolkit to estimate dynamic intracellular metabolic flux distributions in stored Red Blood Cells (RBCs) for transfusion purposes. First, we developed an ad-hoc metabolic network including 77 reactions and 74 metabolites, second, we adapted Flux Variability Analysis (FVA) technique to quantify the connection between exometabolomic dynamics and the dynamics of feasible intracellular reaction flux ranges. We have obtained fine-grained flux range dynamics of the intracellular reactions for the benchmark data published in (Bordbar et al., 2016). Then, we defined four objective functions regarding the accumulation of oxidative stress in stored RBCs for performing a dynamic Flux Balance Analysis (DFBA). In all four cases, time-resolved flux predictions were obtained respecting the imposed equality and inequality constraints. Last, we adapted a quadratic programming (QP) approach to calculate the Euclidean distance between the dynamic optimum flux vectors. The DCBM approach we have developed herein along with the developed metabolic network showed being suitable for the computational analysis of RBCs metabolic behaviour, and it is thought to be useful for other biosystems. Copyright (C) 2022 The Authors.

关键词： Mathematical programming Biological Systems Modelling Metabolic Network Modelling Constraint-based Modelling linear programming problem Oxidative Stress Red Blood Cells

来源：评论

学校读者我要写书评

暂无评论

Maximizing the Lifetime of Delay-Sensitive Sensor Networks via Joint Routing and Sleep Scheduling

Maximizing the Lifetime of Delay-Sensitive Sensor Networks v...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Gu, Yunan Pan, Miao Li, Wei Texas So Univ Dept Comp Sci Houston TX 77004 USA

ISBN: (纸本)9781479923588

Network lifetime is critical to any battery operated wireless sensor networks (WSNs). Especially for delay-sensitive WSNs, it is challenging to prolong the network lifetime, while meeting the delay requirements of different applications. In this paper, we investigate how to optimize the network lifetime of delay-sensitive WSNs with respect to energy efficient routing and sleep scheduling. Instead of treating routing and sleep scheduling as two separate approaches, we have a joint consideration of them, and mathematically formulate the lifetime maximization problem under multiple constraints (i.e., routing, end-to-end delay bounds, sleep scheduling, energy consumption of transmission, receiving and listening, etc.). Since the formulated problem is a mixed integer non-linear programming (MINLP) problem and NP-hard to solve, we relax it into a linear programming (LP) problem and solve the relaxed problem for the upper bound. We also develop a heuristic algorithm for the feasible solution, which yields a lower bound of WSNs' lifetime. Through extensive simulations, we show that the solution found by the proposed algorithm is close to the optimal one and the proposed scheme is effective in prolonging the lifetime of delay-sensitive WSNs.

关键词： integer programming linear programming nonlinear programming telecommunication network routing telecommunication power management wireless sensor networks MINLP NP-hard problem WSN battery operated wireless sensor networks delay-sensitive wireless sensor networks energy efficient routing linear programming problem mixed integer nonlinear programming network lifetime maximization problem sleep scheduling Ad hoc networks Delays Routing Tin Upper bound Wireless communication Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for solving a special class of Nonlinear bilevel programming problems

A genetic algorithm for solving a special class of Nonlinear...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： Li, Hecheng Wang, Yuping Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China Xidian Univ Sch Sci Xian 710071 Peoples R China

ISBN: (纸本)9783540725893

A special nonlinear bilevel programming problem (BLPP), whose follower-level problem is a convex programming with a linear objective function in y, is transformed into an equivalent single-level programming by using Karush-Kuhn-Tucker (K-K-T) conditions. To solve the equivalent problem effectively, a new genetic algorithm is proposed. First, a linear programming (LP) is constructed to decrease the dimensions of the transformed problem. Then based on a constraint-handling scheme, a second-phase evolving process is designed for some offspring of crossover and mutation, in which the linear property of follower's function is used to generate high quality potential offspring.

关键词： bilevel programming problems genetic algorithm linear programming problem constraint handling optimal solutions

来源：评论

学校读者我要写书评

暂无评论

Parametric analysis of dynamically equivalent reaction network models 22

Parametric analysis of dynamically equivalent reaction netwo...

引用

22nd Mediterranean Conference on Control and Automation (MED)

作者： Csercsik, David Szederkenyi, Gabor Pamany Peter Catholic Univ Fac Informat Technol & Bion Prater Utca 50-A H-1083 Budapest Hungary

ISBN: (纸本)9781479959013

Using the results related to dynamically equivalent realizations of reaction kinetic systems, we analyze the dynamical properties of mass action reaction networks on which the well known structure based theorems of reaction kinetics are not directly applicable with respect to given range of certain rate coefficients. We introduce a transformation matrix to describe parametric changes, and show that if the appropriate transformation matrix has been found, parameter ranges for which certain dynamical properties can be ensured may be determined via the solution of a linear programming problem. The method is illustrated by numerical examples.

关键词： chemistry computing dynamics linear programming matrix algebra reaction kinetics theory reaction rate constants dynamical properties dynamically equivalent reaction network model linear programming problem mass action reaction network numerical analysis parameter range determination parametric analysis parametric change rate coefficient range reaction kinetic system structure based theorem transformation matrix Chemicals Couplings Educational institutions Kinetic theory linear programming Stability analysis Vectors

来源：评论

学校读者我要写书评

暂无评论

Field Based Case Studies On Optimal Coordination Of Overcurrent Relays Using Genetic Algorithm 1

Field Based Case Studies On Optimal Coordination Of Overcurr...

引用

IEEE International Conference on Electrical, Computer and Communication Technologies

作者： Ghogare, Jagdish Madhukar Bapat, V. N. Sinhgad Inst Technol Dept Elect Engn Lonavala India

ISBN: (纸本)9781479960859

To avoid the larger area coming under outages, the coordination of Overcurrent (OC) relays in an interconnected power system is required. Fast isolation of fault is possible by minimizing operating time of OC relays by optimizing Time Multiplier Settings (TMS). Coordination problem with constraints is formulated as a linear programming problem. This paper presents optimization of OC relays coordination using Genetic Algorithm (GA). The objective is to minimize the time of operation by finding optimum TMS of relays. Two case studies are presented in this paper. The optimal coordination is utilized to obtain the optimal TMS of OC relays in a realistic power system in India.

关键词： Genetic Algorithm Pickup current Time dial settings linear programming problem Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A model of crop planning under uncertainty in agricultural management

A model of crop planning under uncertainty in agricultural m...

引用

11th International Symposium on Inventories

作者： Itoh, T Ishii, H Nanseki, T Univ Marketing & Distribut Sci Fac Informat Sci Kobe Hyogo 6512188 Japan Osaka Univ Grad Sch Engn Suita Osaka 5650871 Japan Minist Agr Forestry & Fisheries Tsukuba Ibaraki 3058666 Japan

The crop planning problem is often formulated as a linear programming problem. But, in many actual cases, the profit coefficients for agricultural products are not certain values because of the influence of the future weather, so a linear programming model with constant coefficients does not describe the environment of decision making properly. Therefore, we propose a model of crop planning with uncertain (stochastic) values which may support decision making of agricultural farms. In this paper, we treat such uncertain elements as the values with the fuzziness and randomness. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： crop planning linear programming problem fuzzy constraint discrete random variable

来源：评论

学校读者我要写书评

暂无评论

Sensitivity Reduction of Adaptive Repetitive Control System with Asymptotical Rejection against Uncertain Periodic Disturbance

Sensitivity Reduction of Adaptive Repetitive Control System ...

引用

IEEE International Conference on Control Applications Part of 2010 IEEE Multi-Conference on Systems and Control

作者： Yamada, Manabu Funahashi, Yasuyuki Nagoya Inst Technol Res Ctr Nano Device & Syst Showa Ku Nagoya Aichi 4668555 Japan Chukyo Univ Life Syst Sci & Technol Toyota Aichi Japan

ISBN: (纸本)9781424453634

This paper deals with a repetitive control problem for the cases where the period of periodic disturbances to be rejected is uncertain but is within known lower and upper bound. A new adaptive repetitive control system with on-line estimation of the period is proposed not only to guarantee stability of the overall system but also both to reject any periodic disturbances with the uncertain period and to reduce sensitivity against any disturbances, for example, non-periodic persistent ones. The design problem is reduced to a simple and feasible l(1) norm minimization problem. The controller can be obtained easily by solving a simple linear programming problem. Simulations show the effectiveness of the proposed controller for rejection of periodic disturbances and sensitivity reduction.

关键词： adaptive control adaptive repetitive control system asymptotical rejection linear programming linear programming problem minimisation minimization problem period online estimation sensitivity sensitivity reduction stability stability uncertain periodic disturbance uncertain systems

来源：评论

学校读者我要写书评

暂无评论

Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

Minimization of Storage Cost in Distributed Storage Systems ...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Yu, Quan Shum, Kenneth W. Sung, Chi Wan City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China City Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424492688

In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the feasible region of the storage capacities of the nodes can be determined. The storage cost minimization can then be reduced to a linear programming problem, which can be readily solved. Moreover, the tradeoff between storage cost and repair-bandwidth is established.

关键词： Distributed databases linear programming Maintenance engineering Minimization Network coding Peer to peer computing Resource management coding scheme data storage cost distributed storage systems flow graphs information flow graph linear programming linear programming problem network coding protocol repair consideration repair-bandwidth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：