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

28th International Conference on Engineering of Complex Computer Systems (ICECCS)

作者： Zheng, Fei Xu, Qingguo Lei, Zhou Miao, Huaikou Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China Shanghai Key Lab Comp Software Evaluating & Testi Shanghai Peoples R China

ISBN: (纸本)9783031664557;9783031664564

Deep Neural Networks (DNNs) have found successful applications in various non-safety-critical domains. However, given the inherent lack of interpretability in DNNs, ensuring their prediction accuracy through robustness verification becomes imperative before deploying them in safety-critical applications. Neural Network Verification (NNV) approaches can broadly be categorized into exact and approximate solutions. Exact solutions are complete but time-consuming, making them unsuitable for large network architectures. In contrast, approximate solutions, aided by abstraction techniques, can handle larger networks, although they may be incomplete. This paper introduces AccMILP, an approach that leverages abstraction to transform NNV problems into mixed integer linear programming (MILP) problems. AccMILP considers the impact of individual neurons on target labels in DNNs and combines various relaxation methods to reduce the size of NNV models while ensuring verification accuracy. The experimental results indicate that AccMILP can reduce the size of the verification model by approximately 30% and decrease the solution time by at least 80% while maintaining performance equal to or greater than 60% of MIPVerify. In other words, AccMILP is well-suited for the verification of large-scale DNNs.

关键词： Neural network Formal verification mixed integer linear programming Neuron importance

来源：评论

学校读者我要写书评

暂无评论

A Practical Feeder Planning Model for Urban Distribution System

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2023年第2期38卷 1297-1308页

作者： Wang, Mingqiang Yang, Ming Fang, Zhen Wang, Mengxia Wu, Qiuwei Shandong Univ Key Lab Power Syst Intelligent Dispatch & Control Minist Educ Jinan 250002 Shandong Peoples R China Tech Univ Denmark Dept Elect Engn Lyngby 2800 Denmark

There is a significant gap between academic research and practical application for power distribution system planning (PDSP). For most of the existing PDSP models in academic research, cost is used as the objective function, and the most common constraints are power flow equality constraints, bus voltage or voltage drop limits, substation and feeder capacity limits, etc. Although various advanced models and methods have been proposed, they are rarely used in real distribution system companies. This paper proposes a new feeder planning model for the urban distribution network considering various practical requirements. According to field investigation, "supply electricity to loads using nearby power sources " is used as the objective, and it is analytically expressed by load moment. Block loads, practical street layout, meshed network configuration, connection mode of feeders, non-crossing requirement of feeders, power supply radius, etc., are all respected and embedded in the model. The proposed model is recast as a mixed integer linear programming (MILP) problem, and it can be solved by the state-of-art commercial solver. The effectiveness and validity of the proposed model are illustrated on a 9-block test system and a real 22-block district distribution system.

关键词： Planning Costs Layout Load modeling Junctions Substations Distribution networks Block loads connection mode mixed integer linear programming street layout urban distribution network planning

来源：评论

学校读者我要写书评

暂无评论

Bandgap optimization in combinatorial graphs with tailored ground states: application in quantum annealing

引用

OPTIMIZATION AND ENGINEERING 2023年第3期24卷 1931-1949页

作者： Srivastava, Siddhartha Sundararaghavan, Veera Univ Michigan Dept Aerosp Engn Ann Arbor MI 48109 USA

A mixed-integer linear programming (MILP) formulation is presented for parameter estimation of the Potts model. Two algorithms are developed;the first method estimates the parameters such that the set of ground states replicate the user-prescribed data set;the second method allows the user to prescribe the ground states multiplicity. In both instances, the optimization process ensures that the bandgap is maximized. Consequently, the model parameter efficiently describes the user data for a broad range of temperatures. This is useful in the development of energy-based graph models to be simulated on Quantum annealing hardware where the exact simulation temperature is unknown. Computationally, the memory requirement in this method grows exponentially with the graph size. Therefore, this method can only be practically applied to small graphs. Such applications include learning of small generative classifiers and spin-lattice model with energy described by Ising hamiltonian. Learning large data sets poses no extra cost to this method;however, applications involving the learning of high dimensional data are out of scope.

关键词： Potts model Ising model Parameter estimation mixed integer linear programming Boltzmann machines

来源：评论

学校读者我要写书评

暂无评论

HRFF: Hierarchical and Recursive Floorplanning Framework for NoC-Based Scalable Multi-Die FPGAs

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2023年第11期70卷 4295-4308页

作者： Luo, Jianwen Liu, Xinzhe Chen, Fupeng Ha, Yajun ShanghaiTech Univ Sch Informat Sci & Technol Shanghai 201210 Peoples R China Chinese Acad Sci Shanghai Inst Microsyst & Informat Technol Shanghai 200050 Peoples R China Univ Chinese Acad Sci Sch Elect Elect & Commun Engn Beijing 101408 Peoples R China Synopsys VCS Constraint Team Shanghai 200065 Peoples R China Shanghai Engn Res Ctr Energy Efficient & Custom AI Shanghai 201210 Peoples R China

Emerging applications are calling for significantly larger FPGAs with multi-dies. However, the interconnection architecture of existing FPGAs lacks scalability. The execution time and failure probability of their RTL-to-Silicon process increase dramatically with the growth of design and the number of dies. To address this issue, we propose both an NoC-based scalable multi-die FPGA architecture and a corresponding floorplanning framework, namely Hierarchical and Recursive Floorplanning Framework (HRFF). First, from the architecture side, we introduce an interconnection architecture with a class of scalable hierarchical topology. Second, for the algorithm side, we formulate the generic floorplanning problem for NoC-based architectures as a multi-objective mixed integer linear programming (MILP) problem, balancing the design timing and interconnection workload. Third, we develop a novel recursive approximate method to efficiently solve the multi-objective MILP formulation over the proposed architecture, with a configurable trade-off between solution quality and solver run time. Experimental results show that the scalability of our proposed technique is at least 1.5x on all and 3x on certain benchmarks as that of the state-of-the-art solutions with no loss of design throughput.

关键词： NoC-Based multi-die FPGA floorplanning framework mixed integer linear programming multi-objective programming convolutional neural network

来源：评论

学校读者我要写书评

暂无评论

Integration of aggressive bound tightening and mixed integer programming for Cost-sensitive feature selection in medical diagnosis

引用

EXPERT SYSTEMS WITH APPLICATIONS 2022年第0期187卷 115902-115902页

作者： Abdulla, Mai Khasawneh, Mohammad T. SUNY Binghamton Dept Syst Sci & Ind Engn 4400 Vestal Pkwy East Binghamton NY 13902 USA

Silent diseases is an umbrella term that captures a spectrum of chronic illnesses that produce no clinically obvious signs and are diagnosed at advanced stages when the damage is irreversible. Current diagnostic strategies of silent diseases depend on self-reported symptoms and observed behavior through extended periods of time, and until now there are no specific clinical tests to diagnose silent diseases. Scientific research suggests the importance of early diagnosis to restore the functionality and reduce diseases-related complications. Previous studies primarily focused on feature selection methods to aid in medical diagnosis. Traditional feature selection methods are primarily focused on correct classification and often ignore features' costs;the cost of clinical tests required to acquire the feature value. However, in medical diagnosis, features have different associated costs. Because ignoring features' costs may result in a high cost diagnostic strategy that cannot be used in practice, developing a low-cost diagnostic strategy remains a subject of much interest. In this paper, new mixed integer programming (MIP) models, namely, Cost-sensitive Support Vector Machine (CS-SVM) and Cost-sensitive Multi-surface Method Tree (CS-MSMT) that allow for simultaneous selection of low-cost and informative features are proposed. The CS-SVM and CS-MSMT are superior because they have the ability to account for shared costs. The CS-SVM and CS-MSMT were modified to embed shared costs across feature groups, and are termed Discounted CS-SVM (dCS-SVM) and Discounted CS-MSMT (dCS-MSMT), respectively. Computationally effective algorithm that integrates aggressive bound tightening with the MIP formulation is proposed. To demonstrate the effectiveness of the proposed models, different analysis paradigms are conducted on six UCI medical datasets;Chronic Kidney Disease, Hepatitis, Heart Disease, Thyroid, Diabetes and Leukemia. The results demonstrate the efficiency and robustness of t

关键词： mixed integer linear programming Aggressive bound tightening Feature selection Shared costs Cost-sensitive Medical diagnosis

来源：评论

学校读者我要写书评

暂无评论

A relax-and-fix method for clothes inventory balancing scheduling problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2023年第20期61卷 7085-7104页

作者： Wang, Shijin Zhang, Hanyu Chu, Feng Yu, Li Tongji Univ Sch Econ & Management Shanghai Peoples R China Univ Paris Saclay Univ Evry Lab IBISC Evry France Fuzhou Univ Sch Econ & Management Fuzhou Peoples R China Shanghai Univ Finance & Econ Shanghai Key Lab Financial Informat Technol Shanghai Peoples R China Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China Shanghai Univ Finance & Econ Shanghai Key Lab Financial Informat Technol Shanghai 200433 Peoples R China

The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.

关键词： Fast-fashion apparel industry clothes inventory balancing scheduling problem lateral transshipment relax-and-fix heuristics mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Biobjective Parallel Disassembly Line Balancing: A Problem Considering Government Benefit Workers

引用

IEEE SYSTEMS MAN AND CYBERNETICS MAGAZINE 2024年第3期10卷 56-63页

作者： Qin, Shujin Wang, Jiacun Qi, Liang Guo, Xiwang Li, Jiawei Shangqiu Normal Univ Logist Management Shangqiu 476000 Peoples R China Monmouth Univ West Long Branch NJ 07728 USA Shandong Univ Sci & Technol Comp Sci & Technol Qingdao 266590 Peoples R China Liaoning Petrochem Univ Coll Comp & Commun Engn Fushun 113001 Peoples R China Liaoning Petrochem Univ Coll Comp Technol Fushun 113001 Peoples R China

Extensive research on the disassembly line balancing problem (DLBP) has helped remanufacturing and enhanced the reuse of discarded products. This article addresses the multiproduct biobjective parallel DLBP (PDLBP) and incorporates the hiring of workers with government benefits (WGBs). A mixed-integer linear programming (MILP) model is formulated to precisely represent the problem and all constraints associated with its solution, where the goal is to optimize disassembly profit and WGB utilization. A multiobjective salp swarm algorithm (SSA) is constructed to search for optimal solutions quickly. A three-stage encoding and decoding procedure is designed to improve the search process. Different types of instances are combined for feasibility testing. To confirm the advantage of the proposed algorithm, four peer algorithms are employed for comparison. The results confirm the validity of the model and the outstanding performance of the newly proposed algorithm.

关键词： mixed integer linear programming Testing Encoding Decoding Biological system modeling Manufacturing processes Algorithm design and analysis Performance evaluation Production facilities Pareto optimization Assembly systems

来源：评论

学校读者我要写书评

暂无评论

DER Control: Harnessing DDPG and MILP for Enhanced Performance in Active Energy Management

DER Control: Harnessing DDPG and MILP for Enhanced Performan...

引用

4th International Workshop on Intelligent Systems (IWIS)

作者： Bauer, Paul Kapfinger, Jonathan Konrad, Maren Leopold, Thomas Wilker, Stefan Sauter, Thilo TU Wien ICT Vienna Austria Univ Continuing Educ Krems Dept Integrated Sensor Syst Krems Austria

ISBN: (纸本)9798350353310;9798350353303

Energy communities (EC) have emerged as a significant approach for enhancing the efficiency of renewable energy use in the low-power private sector. The increasing penetration of decentralized renewable energy resources (DERs), such as battery storage, photovoltaic (PV) systems, and heat pumps, has generated a need for advanced community-wide control mechanisms. Traditional model-based controllers, while effective, often require labor-intensive mathematical modeling and linear approximations, limiting their flexibility and accuracy. This paper introduces a deep reinforcement learning (DRL) approach, specifically the Deep Deterministic Policy Gradient (DDPG) algorithm, for the autonomous and optimal management of DERs within an EC. The algorithm's ability to enhance DER control is demonstrated by comparing its performance against the results of a model-derived optimization task solved by mixed integer linear programming (MILP). The results yielded by both algorithms are found to be comparable in quality in shaving demand peaks and power grid-friendly power consumption curves. The study underscores the potential of EC power consumption optimization and intermediate energy storage, thereby contributing to grid stability and carbon emission reduction.

关键词： mixed integer linear programming Deep Deterministic Policy Gradient Deep Reinforcement Learning Replay Buffer Energy Communities Control

来源：评论

学校读者我要写书评

暂无评论

A note on integrated disassembly line balancing and routing problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2023年第9期61卷 3144-3150页

作者： Feng, Jianguang Che, Ada Northwestern Polytech Univ Sch Management Xian 710072 Peoples R China

This note comments on the study of [Diri Kenger, Zulal, cagri Koc, and Eren ozceylan. 2020. "Integrated Disassembly Line Balancing and Routing Problem." International Journal of Production Research 58 (23): 7250-7268.] which studies an integrated disassembly line balancing and routing problem and develops two mixed integer linear programming (MILP) models and three mixed integer nonlinear programming (MINLP) models to handle five different scenarios, respectively. The purpose is twofold. First, we demonstrate that the two MILP models can be separated into two parallel subproblems whose optimal solutions can be combined to obtain the optimal solution of the original models. Second, we show that the three MINLP models can be linearised and propose two different linearisation techniques to reformulate them as equivalent MILP models. Computational results indicate that the linearised model outperforms the original nonlinear model in most cases.

关键词： Disassembly line balancing vehicle routing problem nonlinear programming linearisation technique mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An interdisciplinary experimental evaluation on the disjunctive temporal problem

引用

CONSTRAINTS 2023年第1期28卷 1-12页

作者： Zavatteri, Matteo Raffaele, Alice Ostuni, Dario Rizzi, Romeo Univ Padua Dept Math Via Trieste 63 I-35121 Padua Italy Univ Verona Dept Comp Sci Str Grazie 15 I-37134 Verona Italy

We report on an extensive experimental evaluation on the Disjunctive Temporal Problem, where we adapted state-of-the-art Satisfiability Modulo Theories (SMT) encodings into the frameworks of mixed integer linear programming (MILP), (Circuit) Satisfiability (SAT), and Constraint programming (CP). We considered 6 SMT solvers, 4 MILP solvers, 3 SAT solvers, and 3 CP solvers, broadly-recognized for their technologies. We compared all of them on several sets of benchmarks. As well as considering 2 random sets in the literature, we generated 3 new industrial and 3 new computationally-hard sets of benchmarks, which we make publicly available online. In particular, we analyzed 9885 instances, each processed on average about 33 times. Overall, SMT is confirmed to be the current best technology, but also MILP can perform very well, for instance on some random instances, on which it can be up to 2x faster than SMT. On a single machine, this experimental evaluation would have taken 598.97 days.

关键词： Disjunctive temporal problem Satisfiability modulo theories mixed integer linear programming Circuit SAT Constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：