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

Generation of an equipment module database - A maximum coverage problem

CHEMICAL ENGINEERING RESEARCH & DESIGN 2019年 148卷 164-168页

作者： Eilermann, Martin Schach, Constantin Sander, Peer Bramsiepe, Christian Schembecker, Gerhard TU Dortmund Univ Dept Biochem & Chem Engn Lab Plant & Proc Design Emil Figge Str 70 D-44227 Dortmund Germany Evonik Technol & Infrastruct GmbH Paul Baumann Str 1 D-45772 Marl Germany

Current challenges for (bio-)chemical industry require shorter project lead times. To reduce the lead time, the concept of module-based plant design was developed. Suitable equipment modules are selected from an equipment module database instead of time-consuming tailor-made equipment design. The quality of module-based plant design strongly depends on the quality of the equipment module database. An equipment module database should contain the least number of equipment modules covering as many industrial applications as possible. Hence, the generation of an equipment module database is a maximum coverage problem known from other disciplines, such as facility location. Within this work, the corresponding maximum coverage problem is formulated and solved by a randomized greedy algorithm. The approach for the generation of an equipment module database presented is exemplarily applied for liquid/liquid heat transfer applications provided by Evonik. It is shown, that less equipment modules are required for the same coverage of applications if the equipment module database is generated based on the maximum coverage problem than based on the existing methodology presented by Eilermann et al. (2017). Additionally, less computational effort is required. (C) 2019 Published by Elsevier B.V. on behalf of Institution of Chemical Engineers.

关键词： Module-based plant design Equipment module database maximum coverage problem Greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

The Robust maximum-coverage problem

The Robust Maximum-Coverage Problem

引用

IEEE Systems and Information Engineering Design Symposium (SIEDS)

作者： Sturdy, Ian Kincaid, Rex Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA Coll William & Mary Dept Math Williamsburg VA 23187 USA

ISBN: (纸本)9781479948369

The maximum coverage problem is a staple of facility location theory, and has more recently been extended to the covering facility interdiction problem, in which covering facilities are chosen for interdiction so as to minimize the resultant coverage. This paper considers the opposite to the interdiction problem, selecting facilities to maximize coverage after the worst-case interdiction. Solutions to this problem would inform facility placement when intentional disruption is feared, or when guaranteeing minimum coverages in the presence of random facility outages. Several approaches to the problem are considered, primarily derivatives of approaches to the structurally similar maximum coverage problem. An integer linear program formulation proves infeasible for problems of even modest size, despite exclusion of many non-binding constraints, but heuristic approaches (again adaptations of maximum coverage heuristics) show promise in both efficiency and solutions quality.

关键词： Facility Location Interdiction problem maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

Hybrid Data Selection With Context and Content Features for Visual Crowdsensing

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY

引用

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY 2022年 3卷 426-440页

作者： Song, Wei Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada

Visual crowdsensing (VCS) is becoming predominant in mobile crowdsensing, but there still exist various unique challenges, including large sizes of visual data, multidimensional requirements, and intensive processing demands. As a key research problem in VCS, data selection filters out redundant data and only retains most representative samples, which can effectively reduce the complexity and cost for VCS. In this paper, we study a phase-by-phase data selection approach, in which metadata are first used to pre-select collected photos and then only selected ones are sent to a backend server for further processing based on content features. As such, the initial selection can be completed on nearby edge servers in mobile edge computing (MEC), while more intensive content processing can be done in a remote cloud. We evaluate different initial data selection algorithms using traditional performance measures as well as adapted clustering indices as quality metrics. Moreover, we formulate an integer linear program (ILP) problem for the final data selection based on the scale-invariant feature transform (SIFT) feature. This content-based selection can complement the initial data selection based on contextual metadata. The simulation results show the differences of these selection algorithms and provide guidance on how to choose an appropriate one according to application needs.

关键词： Visualization Metadata Feature extraction Crowdsensing Servers Task analysis Costs Mobile crowdsensing visual crowdsensing edge computing data selection hierarchical clustering maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

Simulation-Based maximum coverage Hazard Detection and Elimination Analysis, Supporting Combinational Logic Loops 30

Simulation-Based Maximum Coverage Hazard Detection and Elimi...

引用

30th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)

作者： Chatzivangelis, Nikolaos Valiantzas, Dimitris Sotiriou, Christos Lilitsis, Iordanis Univ Thessaly Dept Elect & Comp Engn Volos Greece

ISBN: (数字)9781665490054

ISBN: (纸本)9781665490054

We demonstrate an iterative simulation-based maximum coverage detection and elimination analysis of logic-hazards for combinational logic loops. Although the focus is on asynchronous circuits with such feedbacks, it is apparent that the proposed approach can be practiced for every digital circuit with combinational loops. In regard to hazard detection, a simulation-based semi-modular analysis is presented, by extending the provided library technology behavioral Verilog files. For hazard elimination, only the standard cells within the paths causing a hazard have been included for analysis. The circuit becomes hazard-free by inserting buffers of the minimum required delay. We develop three path-based buffer insertion approaches;the more advanced ones model each logic gate and their relative timing constraints as a maximum set covering problem. The main characteristic of comparison is the count of inserted buffers and their total delay. The aforementioned hazard analysis is an iterative process, because the overall timing constraints of the circuit alter after each delay insertion. Experimental results indicate that the three hazard elimination approaches have various area penalties and their success rate ranges from 68.7% to 100%. Moreover, not all hazards can be resolved, mainly due to opposing constraints of sensitized hazard paths, and Boolean logic re-synthesis may be required.

关键词： combinational logic circuits asynchronous circuits logic hazards semi-modular maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

Learning ensembles of priority rules for online scheduling by hybrid evolutionary algorithms

引用

INTEGRATED COMPUTER-AIDED ENGINEERING 2021年第1期28卷 65-80页

作者： Gil-Gala, Francisco J. Mencia, Carlos Sierra, Maria R. Varela, Ramiro Univ Oviedo Dept Comp Sci Gijon 33204 Spain

This paper studies the computation of ensembles of priority rules for the One Machine Scheduling problem with variable capacity and total tardiness minimization Concretely, we address the problem of building optimal ensembles of priority rules, starting from a pool of rules evolved by a Genetic Programming approach. Building on earlier work, we propose a number of new algorithms. These include an iterated greedy search method, a local search algorithm and a memetic algorithm. Experimental results show the potential of the proposed approaches.

关键词： Online scheduling one machine scheduling hyper-heuristic priority rules ensemble learning maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

Medical Support Vehicle Location and Deployment at Mass Casualty Incidents

引用

INFORMATION 2024年第5期15卷 260-260页

作者： Medina-Perez, Miguel Guzman, Giovanni Saldana-Perez, Magdalena Legaria-Santiago, Valeria Karina Inst Politecn Nacl IPN Ctr Invest Comp CIC Unidad Profes Adolfo Lopez Mateos UPALM Zacatenco Mexico City 07320 Mexico

Anticipating and planning for the urgent response to large-scale disasters is critical to increase the probability of survival at these events. These incidents present various challenges that complicate the response, such as unfavorable weather conditions, difficulties in accessing affected areas, and the geographical spread of the victims. Furthermore, local socioeconomic factors, such as inadequate prevention education, limited disaster resources, and insufficient coordination between public and private emergency services, can complicate these situations. In large-scale emergencies, multiple demand points (DPs) are generally observed, which requires efforts to coordinate the strategic allocation of human and material resources in different geographical areas. Therefore, the precise management of these resources based on the specific needs of each area becomes fundamental. To address these complexities, this paper proposes a methodology that models these scenarios as a multi-objective optimization problem, focusing on the location-allocation problem of resources in Mass Casualty Incidents (MCIs). The proposed case study is Mexico City in a earthquake post-disaster scenario, using voluntary geographic information, open government data, and historical data from the 19 September 2017 earthquake. It is assumed that the resources that require optimal location and allocation are ambulances, which focus on medical issues that affect the survival of victims. The designed solution involves the use of a metaheuristic optimization technique, along with a parameter tuning technique, to find configurations that perform at different instances of the problem, i.e., different hypothetical scenarios that can be used as a reference for future possible situations. Finally, the objective is to present the different solutions graphically, accompanied by relevant information to facilitate the decision-making process of the authorities responsible for the practical implementation of thes

关键词： multi-objective optimization mass casualty incidents location-allocation problem p-median problem maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

A GIS-based Optimal Facility Location Framework for Fast Electric Vehicle Charging Stations 30

A GIS-based Optimal Facility Location Framework for Fast Ele...

引用

30th IEEE International Symposium on Industrial Electronics (ISIE)

作者： Zafar, Usman Bayram, I. Safak Bayhan, Sertac Hamad Bin Khalifa Univ Qatar Environm & Energy Res Inst POB 34110 Doha Qatar Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XQ Lanark Scotland

ISBN: (数字)9781728190235

ISBN: (纸本)9781728190235

Deeper decarbonization of the transport sector requires building a wide coverage electric vehicle charging network that can meet driver's mobility patterns and refueling habits in a seamless manner. Currently, major market players mainly deploy chargers at existing public parking spaces at hotels, shopping centers, etc. On the other hand, gas/petroleum retail business is a century-old industry and "optimized" to serve the refueling needs of the drivers and they come to the forefront as "good" locations to site chargers. To that end, this paper addresses the fast charging station location problem in an urban environment. The optimization problem is formulated as a maximum coverage location problem (MCLP) and existing locations of petrol/fuel stations are considered as candidate locations. Using QGIS software, a geographic information system (GIS) based platform is developed and integrated with a linear-programming relaxation based MCLP algorithm developed in Python. The city of Raleigh, North Carolina with actual geo-spatial data is chosen as a case study. Both census population and highway traffic data are considered as demand metrics to mimic drivers without dedicated chargers and vehicles on highways who need a recharge. A number of evaluations are performed to explore the trade-off between the number of locations and the physical coverage space. Furthermore, comparative analysis show that locating fast chargers in existing petrol stations improve demand coverage by more than 50% when compared to existing fast charging station locations.

关键词： electric vehicles petrol stations facility location fast chargers maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

Sequential pattern mining for ICT risk assessment and management

引用

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING 2019年 102卷 1-16页

作者： D'Andreagiovanni, Michele Baiardi, Fabrizio Lipilini, Jacopo Ruggieri, Salvatore Tonelli, Federico Univ Pisa Dipartimento Informat Largo B Pontecorvo 3 I-56127 Pisa Italy Haruspex SRL Via Vittorio Veneto 126 I-19124 La Spezia Italy

ICT risk assessment and management relies on the analysis of data on the joint behavior of a target system and its attackers. The tools in the Haruspex suite model intelligent, goal-oriented attackers that reach their goals through sequences of attacks. The tools synthetically generate these sequences through a Monte Carlo method that runs multiple simulations of the attacker behavior. This paper presents a sequential pattern mining analysis of the attack sequence database to extract a high-level and succinct understanding of the attacker strategies against the system to assess. Such an understanding is expressed as a set of sequential patterns that cover, and possibly partition, the attack sequences. This set can be extracted in isolation, or in contrast with the behavior of other attackers. In the latter case, the patterns represent a signature of the behavior of an attacker. The dynamic tools of the suite use this signature to deploy dynamic counter-measures that reduce the security risk. We formally motivate the need for using the class of maximal sequential patterns in covering attack sequences, instead of frequent or closed sequential patterns. When contrasting the behavior of different attackers, we resort to distinguishing sequential patterns. We report an extensive experimentation on a system with 36 nodes, 6 attackers, and 600K attack sequences. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Security risk assessment Attack sequences Sequential pattern mining maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

The maximum Visibility Facility Selection Query in Spatial Databases 19

The Maximum Visibility Facility Selection Query in Spatial D...

引用

27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS)

作者： Rabban, Ishat E. Ali, Mohammed E. Cheema, Muhammad A. Hashem, Tanzima BUET Dhaka 1000 Bangladesh Monash Univ Clayton Vic Australia

ISBN: (纸本)9781450369091

Given a set of obstacles in 2D or 3D space, a set of n candidate locations where facilities can be established, the maximum Visibility Facility Selection (MVFS) query finds k out of the n locations, that yield the maximum visibility coverage of the data space. Though the MVFS problem has been extensively studied in visual sensor networks, computational geometry, and computer vision in the form of optimal camera placement problem, existing solutions are designed for discretized space and only work for MVFS instances having a few hundred facilities. In this paper, we revisit the MVFS problem to support new spatial database applications like "where to place security cameras to ensure better surveillance of a building complex?" or "where to place billboards in the city to maximize visibility from the surrounding space?". We introduce the concept of equivisibility triangulation to devise the first approach to accurately determine the visibility coverage of continuous data space from a subset of the facility locations, which avoids the limitations of discretizing the data space. Then, we propose an efficient graph-theoretic approach that exploits the idea of vertex separators for efficient exact in-memory solution of the MVFS problem. Finally, we propose the first external-memory based approximation algorithm (with a guaranteed approximation ratio of 1 - 1/e) that is scalable for a large number of obstacles and facility locations. We conduct extensive experimental study to show the effectiveness and efficiency of our proposed algorithms.

关键词： Visibility maximum coverage problem Triangulation Graph Partitioning Greedy Approximation

来源：评论

学校读者我要写书评

暂无评论

Local Feature Reliability Measure Consistent with Match Conditions for Mobile Visual Search

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2018年第12期E101D卷 3170-3180页

作者： Matsuzaki, Kohei Tasaka, Kazuyuki Yanagihara, Hiromasa KDDI Res Inc Media Recognit Lab Fujimino 3568502 Japan KDDI Res Inc Fujimino 3568502 Japan KDDI Res Inc Media ICT Div Fujimino 3568502 Japan

We propose a feature design method for a mobile visual search based on binary features and a bag-of-visual words framework. In mobile visual search, detection error and quantization error are unavoidable due to viewpoint changes and cause performance degradation. Typical approaches to visual search extract features from a single view of reference images, though such features are insufficient to manage detection and quantization errors. In this paper, we extract features from multiview synthetic images. These features are selected according to our novel reliability measure which enables robust recognition against various viewpoint changes. We regard feature selection as a maximum coverage problem. That is, we find a finite set of features maximizing an objective function under certain constraints. As this problem is NP-hard and thus computationally infeasible, we explore approximate solutions based on a greedy algorithm. For this purpose, we propose novel constraint functions which are designed to be consistent with the match conditions in the visual search method. Experiments show that the proposed method improves retrieval accuracy by 12.7 percentage points without increasing the database size or changing the search procedure. In other words, the proposed method enables more accurate search without adversely affecting the database size, computational cost, and memory requirement.

关键词： mobile visual search binary feature feature selection maximum coverage problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：