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

Conference on Privacy in Statistical Databases 2010

作者： Castro, Jordi Gonzalez, Jose A. Univ Politecn Cataluna Dept Stat & Operat Res ES-08034 Barcelona Catalonia Spain

ISBN: (纸本)9783642158377

Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be protected, the purpose of RCTA is to find the closest table that guarantees protection levels for the sensitive cells. This is achieved by adding slight adjustments to the remaining cells, possibly excluding a subset of them (usually, the total cells) which preserve their original values. If either protection levels are large, or the bounds for cell deviations are tight, or too many cell values have to be preserved, the resulting mixed integer linear problem may be reported as infeasible. This work describes a tool developed for analyzing infeasible instances. The tool is based on a general elastic programming approach, which considers an artificial problem obtained by relaxing constraints and bounds through the addition of extra elastic variables. The tool allows selecting the subset of constraints and bounds to be relaxed, such that an elastic filter method can be applied for isolating a subset of infeasible table relations, protection levels, and cell bounds. Some computational experiments are reported using real-world instances.

关键词： statistical disclosure control controlled tabular adjustment mixed integer linear programming infeasibility in optimization elastic constraints elastic filter

来源：评论

学校读者我要写书评

暂无评论

Efficient Partitioning of Parameterized 45-Degree Polygons with mixed ILP

Efficient Partitioning of Parameterized 45-Degree Polygons w...

引用

IEEE Region 10 Conference on TENCON 2010

作者： Tseng, I-Lun Lee, Che-I Chen, Huan-Wen Yuan Ze Univ Dept Comp Sci & Engn Chungli Taiwan

ISBN: (纸本)9781424468904

Partitioning parameterized polygons is an essential process in a proposed layout-aware analog integrated circuit design flow. To deal with constraints associated with parameterized polygons, constraint programming (CP) technologies have been used in a previous partitioning algorithm. Although CP solvers are capable of coping with complex constraints, CP-based partitioning processes can be very time-consuming. In this paper, we propose the use of mixed integer linear programming (MILP) solvers in the partitioning of parameterized 45-degree polygons. Experimental results show that more than 150X speedup can be achieved for partitioning parameterized polygons containing very complex constraints.

关键词： parameterized polygons partitioning mixed integer linear programming VLSI physical design parasitics estimation

来源：评论

学校读者我要写书评

暂无评论

Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Single Regional Failures

Survivable Virtual Infrastructure Mapping in a Federated Com...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Yu, Hongfang Qiao, Chunming Anand, Vishal Liu, Xin Di, Hao Sun, Gang Univ Elect Sci & Technol China Sch Commun & Informat Engn Chengdu Peoples R China SUNY Buffalo Dept Comp Sci & Engn Buffalo NY USA SUNY Coll Brockport Dept Comp Sci Brockport NY USA Brookhaven Natl Lab Upton NY USA

ISBN: (纸本)9781424456383

As virtualization becomes more and more popular, how to guarantee survivability of a virtual infrastructure (VI) over a wide-area optical network is increasingly important. In this paper, we approach the problem of survivable VI mapping (SVIM) from a few unique perspectives. One of the most distinguishing perspectives is that a large-scale regional failure could destroy one or more facility nodes to which some VI nodes are mapped. Accordingly, redundant facility nodes at different geographical locations and redundant optical connections have to be provisioned such that the VI can still be mapped after the failure. Another distinguishing perspective is that with failure-dependent protection, the SVIM problem can be decomposed into several instances of the basic non-survivable VI mapping (NSVIM) problem, whose solution permits effective sharing of the redundant resources among all failures. In this paper, we first formulate the minimum-cost SVIM problem using mixed integer linear programming (MILP). We then propose an efficient heuristic solution to NSVIM, based on which two novel heuristic SVIM algorithms called Separate Optimization with Unconstrained Mapping (SOUM) and Incremental Optimization with Constrained Mapping (IOCM). Simulations are performed to study and compare the performance of the MILP and heuristics.

关键词： SVIM distributed processing fault tolerance federated computing incremental optimization with constrained mapping integer programming linear programming mixed integer linear programming networking system redundant facility nodes separate optimization with

来源：评论

学校读者我要写书评

暂无评论

Analytical Conditions for Determining Feasible Commitment States of SCUC Problems

Analytical Conditions for Determining Feasible Commitment St...

引用

IEEE-Power-and-Energy-Society General Meeting

作者： Zhai, Qiaozhu Wu, Hongyu Guan, Xiaohong Xi An Jiao Tong Univ SKLMS Lab Syst Engn Inst Xian 710049 Peoples R China

ISBN: (纸本)9781424483570

Security constrained unit commitment (SCUC) is one of the most important daily tasks that independent system operators (ISOs) or regional transmission organizations (RTOs) must accomplish in daily electric power market. Identifying the feasibility of the unit commitment state with security constraints is crucial for solving SCUC problems. If the feasibility of unit commitment state can be identified quickly, the efficiency of SCUC problem-solving methods can be greatly improved. In this paper, a group of analytical conditions for a commitment state to be feasible is established. More importantly, most of the commitment states can be quickly identified as feasible/infeasible by using these conditions. Numerical testing is performed for 2 power grids and the preliminary results shows that over 95% of infeasible commitment states are identified analytically by one of the necessary conditions, and over 74% of feasible commitment states are identified by the analytical sufficient conditions. Also, these conditions provide useful information for obtaining feasible SCUC solutions.

关键词： Unit Commitment Security Constraints Feasibility Conditions mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Prolonging Network Lifetime via A Controlled Mobile Sink in Wireless Sensor Networks

Prolonging Network Lifetime via A Controlled Mobile Sink in ...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Liang, Weifa Luo, Jun Xu, Xu Australian Natl Univ Sch Comp Sci GPO Box 4 Canberra ACT 0200 Australia Natl Univ Defense Tech Changsha Hunan Peoples R China

ISBN: (纸本)9781424456383

In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by petrol and/or electricity, the total travel distance of the mobile sink should be bounded. To minimize the data loss during the transition of the mobile sink from its current location to its next location, its moving distance must be restricted. Also, considering the overhead on a routing tree construction at each sojourn location of the mobile sink, it is required that the mobile sink sojourns for at least a certain amount of time at each of its sojourn locations. The distance constrained mobile sink problem in a WSN is to find an optimal sojourn tour for the mobile sink such that the sum of sojourn times in the tour is maximized, subject to the above mentioned constraints. In this paper we first formulate the problem as a mixed integer linear programming (MILP). Due to its NP-hardness, we then devise a novel heuristic for it. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of network lifetime. The experimental results demonstrate that the solution delivered by the proposed heuristic is nearly optimal which is comparable with the one by solving the MILP formulation but with much shorter running time.

关键词： WSN controlled mobile sink integer programming linear programming mixed integer linear programming mobile radio routing tree construction telecommunication network routing wireless sensor networks wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

MLD-Based Modeling and MPC of Discrete-Time Hybrid Systems with Stochastic Mode Transitions

MLD-Based Modeling and MPC of Discrete-Time Hybrid Systems w...

引用

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

作者： Kobayashi, Koichi Hiraishi, Kunihiko Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa Japan

ISBN: (纸本)9781424453634

Stochastic hybrid systems have several applications such as biological systems and communication networks, but it is difficult to consider analysis and control of general stochastic hybrid systems. In this paper, discrete-time hybrid systems with stochastic mode transitions (called here discrete-stochastic hybrid systems) are considered as a class of stochastic hybrid systems. For this system, a modeling method and a model predictive control algorithm are proposed. In the proposed method, based on time sequences of modes, a given system is modeled by a time-varying mixed logical dynamical model. Furthermore, the control input is generated by solving a mixed integer linear programming problem at each time.

关键词： discrete time systems discrete-stochastic hybrid systems discrete-time hybrid systems integer programming linear programming mixed integer linear programming model predictive control predictive control stochastic mode transition stochastic systems time-varying mixed logical dynamical model

来源：评论

学校读者我要写书评

暂无评论

mixed-integer linear programming for transition-independent decentralized MDPs 06

Mixed-integer linear programming for transition-independent ...

引用

Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

作者： Jianhui, Wu Durfee, Edmund H. EECS Department University of Michigan Ann Arbor MI 48109 United States

No abstract available

ISBN: (纸本)1595933034

No abstract available

关键词： mixed integer linear programming transition-independent decentralized MDP MDP piecewise linear approximation

来源：评论

学校读者我要写书评

暂无评论

Constraint-based modelling of Chlamydomonas reinhardtii photoautotrophic metabolism

引用

IFAC Proceedings Volumes 2010年第6期43卷 389-394页

作者： G. Cogne M. Rügen A. Bockmayr M. Titica C.-G. Dussap J. Legrand GEPEA Université de Nantes CNRS UMR 6144 Bd de l'Université CRTT - BP 406 F-44602 Saint-Nazaire Cedex France (Tel: +33-240-172-611 DFG Research Center Matheon Freie Universität Berlin Arnimallee 6 D-14195 Berlin Germany LGCB Université Blaise Pascal CUST 24 avenue des Landais BP 206 F-63174 Aubière Cedex France

A constraint-based modelling approach was developed to investigate the metabolic response of the eukaryotic microalgae Chlamydomonas reinhardtii under photoautotrophic conditions. The model explicitly includes thermodynamic and energetic constraints on the functioning metabolism. A mixed integer linear programming method was used to determine the optimal flux distributions with regard to this set of constraints. It enabled us in particular to highlight the existence of a light-driven respiration depending on the incident photon flux density in photobioreactors.

关键词： Systems biology constraint-based modelling mixed integer linear programming thermodynamics

来源：评论

学校读者我要写书评

暂无评论

Genome-scale metabolic reconstruction and in silico analysis of methylotrophic yeast Pichia pastoris for strain improvement

引用

MICROBIAL CELL FACTORIES 2010年第1期9卷 50-50页

作者： Chung, Bevan K. S. Selvarasu, Suresh Andrea, Camattari Ryu, Jimyoung Lee, Hyeokweon Ahn, Jungoh Lee, Hongweon Lee, Dong-Yup Natl Univ Singapore NUS Grad Sch Integrat Sci & Engn Singapore 117456 Singapore ASTAR Bioproc Technol Inst Centros 138668 Singapore KRIBB Biotechnol Proc Engn Ctr Taejon 305806 South Korea Natl Univ Singapore Dept Chem & Biomol Engn Singapore 117576 Singapore

Background: Pichia pastoris has been recognized as an effective host for recombinant protein production. A number of studies have been reported for improving this expression system. However, its physiology and cellular metabolism still remained largely uncharacterized. Thus, it is highly desirable to establish a systems biotechnological framework, in which a comprehensive in silico model of P. pastoris can be employed together with high throughput experimental data analysis, for better understanding of the methylotrophic yeast's metabolism. Results: A fully compartmentalized metabolic model of P. pastoris (iPP668), composed of 1,361 reactions and 1,177 metabolites, was reconstructed based on its genome annotation and biochemical information. The constraints-based flux analysis was then used to predict achievable growth rate which is consistent with the cellular phenotype of P. pastoris observed during chemostat experiments. Subsequent in silico analysis further explored the effect of various carbon sources on cell growth, revealing sorbitol as a promising candidate for culturing recombinant P. pastoris strains producing heterologous proteins. Interestingly, methanol consumption yields a high regeneration rate of reducing equivalents which is substantial for the synthesis of valuable pharmaceutical precursors. Hence, as a case study, we examined the applicability of P. pastoris system to whole-cell biotransformation and also identified relevant metabolic engineering targets that have been experimentally verified. Conclusion: The genome-scale metabolic model characterizes the cellular physiology of P. pastoris, thus allowing us to gain valuable insights into the metabolism of methylotrophic yeast and devise possible strategies for strain improvement through in silico simulations. This computational approach, combined with synthetic biology techniques, potentially forms a basis for rational analysis and design of P. pastoris metabolic network to enhance humanized glyco

关键词： mixed integer linear programming Acetoin Recombinant Protein Production Chemostat Culture Methylotrophic Yeast

来源：评论

学校读者我要写书评

暂无评论

Efficient partitioning of parameterized 45-degree polygons with mixed ILP

Efficient partitioning of parameterized 45-degree polygons w...

引用

IEEE Region 10 International Conference TENCON

作者： I-Lun Tseng Che-I Lee Huan-Wen Chen Department of Computer Science and Engineering Yuan-Ze University Chungli Taiwan

关键词： Partitioning algorithms Algorithm design and analysis Layout Design automation Very large scale integration mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：