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

Optimized Operation Management With Predicted Filling Levels of the Litter Bins for a Fleet of Autonomous Urban Service Robots

引用

IEEE ACCESS 2024年 12卷 7689-7703页

作者： Pollak, Anton Gupta, Abhishek Goehlich, Dietmar Tech Univ Berlin Chair Methods Prod Dev & Mechatron D-10623 Berlin Germany

Autonomous smart waste management services are becoming an essential component of sustainable urbanization. However, the lack of data and insights from current service-providers impedes a reliable transition from labor-intensive to autonomous services. Deploying information gathering devices makes services expensive and resource-demanding. In project MARBLE (Mobile Autonomous RoBot for Litter Emptying) we are currently investigating the implementation of a fleet of service robots. In this framework, we could show that the absence of filling data of litter bins (LBs) hinders the possibility of providing an energy-efficient and time-effective service. Hence, we introduce an approach where machine learning-based predictions for filling levels of LBs, derived from our extensive data gathering, are used to effectively manage the autonomous emptying process. The novel Simulated Rebalancing approach in route-planning combined with the knapsack algorithm ensures efficient service in comparison to the Nearest Neighbor algorithm. A promising 82% filling level prediction accuracy was achieved with the XGBoost binary classifier, as compared to the 59% baseline accuracy. Through incorporating the predicted filling level data in the Simulated Rebalancing approach, a reduction of 26% in operational time and 31% in energy consumption was achieved for our simulated tests for service-event-area (SEA) James-Simon-Monbijoupark in Berlin with 49 LBs.

关键词： Robots Prediction algorithms Planning Meteorology Service robots Predictive models Machine learning Energy consumption Smart cities Waste management Sustainable development Autonomous robots knapsack algorithm litter bin filling-level prediction machine learning responsible energy consumption robot-fleets route planning smart cities sustainable waste management urban service robots XGBoost

来源：评论

学校读者我要写书评

暂无评论

A New Method for the Techno-Economic Analysis and the Identification of Expansion Strategies of Neutral-Temperature District Heating and Cooling Systems

引用

ENERGIES 2024年第9期17卷 2159页

作者： Calixto, Selva Cozzini, Marco Fedrizzi, Roberto Manzolini, Giampaolo Eurac Res Inst Renewable Energy Viale Druso 1 I-39100 Bolzano Italy Politecn Milan Dept Energy Via Lambruschini 4 I-20156 Milan Italy

Neutral-temperature district heating and cooling (NT-DHC) is a recent concept in the district heating sector. The current literature does not directly address the ability to create comprehensive master plans for NT-DHC systems and reliably model their performance. This research presents a new approach for the evaluation and planning of NT-DHC systems. The methodology involves the use of a knapsack optimization algorithm to perform a comprehensive analysis of the conditions that make the NT-DHC solution competitive against individual heating and cooling technologies. The algorithm determines the optimal combination of potential extensions that maximizes overall economic value. The results of a case study, which was conducted in Italy, show that NT-DHC is more suitable in dense urban areas, while air-to-water heat pumps are better suited for low heat density zones. This methodology aims to reduce the risks associated with energy demand and provide more certainty about which areas a network can expand into to be competitive. It is targeted at energy planners, utilities experts, energy engineers, and district heating experts who require assistance and guidance in the planning and early stages of designing a NT-DHC system. This method might enable pre-feasibility studies and preliminary design to determine the opportunities and limitations of a system of this kind from an economic and technological perspective.

关键词： neutral-temperature district heating and cooling techno-economic model knapsack algorithm transition pathways network expansion scenarios energy planning

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic algorithm to maintain road networks using reliability theory

引用

STRUCTURE AND INFRASTRUCTURE ENGINEERING 2023年第6期19卷 810-823页

作者： Altarabsheh, Ahmad Altarabsheh, Ibrahim Ventresca, Mario Yarmouk Univ Hijjawi Fac Engn Technol Dept Construct Engn & Management Irbid Jordan Louisiana Tech Univ Dept Civil Engn Mat & Infrastruct Syst Cconcentrat Fac Engn Ruston LA USA Purdue Univ Sch Ind Engn W Lafayette IN 47907 USA

Maintaining road pavement is a challenging task, due to the vast size of the roads network and the limited maintenance budget available to road agencies. Therefore, most agencies aim at selecting the most deteriorated road segments for maintenance, within their available budget. However, the majority of the current developed asset management tools aim at improving the average performance of the roads network, regardless of the condition of the maintained segments. To overcome this limitation, this study first proposes a novel measure for roads network performance using reliability theory, then it proposes a hybrid optimization approach that is integrated with the proposed performance measure to enable road agencies to focus on the most deteriorated segments in the network while maximizing the network performance. The hybrid optimization approach combines dynamic programming with a traditional genetic algorithm. The proposed algorithm was applied to two major road systems in Jordan and validated by comparing its performance with that of a traditional genetic algorithm. The results show that the proposed algorithm outperforms the traditional genetic algorithm, because of its ability to select the most deteriorated segments in the network, while achieving better network condition at lower cost.

关键词： Roads maintenance genetic algorithms knapsack algorithm dynamic programming linear multi-state consecutively connected system reliability theory

来源：评论

学校读者我要写书评

暂无评论

The MBSFN-based eMBMS using the method of Incremental Allocation of Radio Resource between Unicast and Multicast (IARR-UM)

引用

TELECOMMUNICATION SYSTEMS 2021年第4期77卷 709-730页

作者： Huang, Chung-Ming Li, Meng-Lien Natl Chen Kung Univ Comp Sci & Informat Engn Tainan Taiwan

The evolved Multimedia Broadcast Multicast Service (eMBMS) using the Multicast Broadcast Single Frequency Network (MBSFN) technique was designed for having multimedia streaming services using the multicast/broadcast way over the cellular network. Since (1) the unit of resource allocation in eMBMS-MBSFN is a subframe, (2) the code rate of an eMBMS-MBSFN session is based on the lowest Modulation and Coding Scheme (MCS) among involved User Equipments (UEs) of the eMBMS-MBSFN session and (3) the resource allocation for eMBMS-MBSFN cannot be so instantly and dynamically adjusted based on the status of involved UEs, triggering eMBMS-MBSFN in the inappropriate time and allocating inappropriate resource to eMBMS, for which a framework of how to set the configuration of the allocated resource for eMBMS-MBSFN has been defined in the standard, may cause (1) the radio resources to be wasted and (2) the low streaming quality and code rate. Based on the MBMS operation on Demand (MooD) concept, this work proposed the Incremental Allocation of Radio Resource between Unicast and Multicast (IARR-UM) method to dynamically allocate radio resources to eMBMS based on the current Radio Access Network's (RAN's) congestion situation such that some suitable multimedia streaming services are switched to eMBMS and others still use unicast communication. To effectively use eMBMS to mitigate RAN's congestion, the proposed IARR-UM method (1) dynamically increases/decreases the amount of radio resources allocated to eMBMS, i.e., modifying the configuration of the allocated resource for eMBMS-MBSFN using the standard's framework, based on the situation of RAN's congestion, (2) uses the knapsack algorithm to select a subset of suitable multimedia streaming services to be eMBMS sessions according to the given amount of radio resources allocated to eMBMS, and then (3) design a Common Subframe Allocation (CSA) pattern that can have the lower amount of redundant radio resources allocated to eMBMS. The r

关键词： Evolved multimedia broadcast multicast service (eMBMS) Multicast broadcast single frequency network (MBSFN) MBMS operation on Demand (MooD) Long term evolution (LTE) Common Subframe Allocation (CSA) pattern CSA period knapsack algorithm MCH Subframe Allocation (MSA)

来源：评论

学校读者我要写书评

暂无评论

Modelling spatial dynamics of cropping systems to assess agricultural practices at the catchment scale

引用

COMPUTERS AND ELECTRONICS IN AGRICULTURE 2012年 81卷 1-13页

作者： Salmon-Monviola, Jordy Durand, Patrick Ferchaud, Fabien Oehler, Francois Sorel, Luc INRA UMR1069 F-35000 Rennes France Agrocampus Rennes UMR1069 Sol Agro & Hydrosyst Spatialisat F-35000 Rennes France INRA US1158 F-02000 Laon France Natl Inst Water & Atmospher Res Hamilton New Zealand

Assessing the environmental impacts of agricultural practices at the catchment scale increasingly involves the use of spatially distributed models that include cropping systems as input. Use of these models for diagnosis and evaluation requires large datasets at large spatial and temporal scales. The description of spatial dynamics of cropping systems at a fine resolution (i.e. field level) is particularly needed. As these data are scarce or not available, our objective was to propose a model that first reconstructs spatial dynamics of past cropping systems from available data, and second constructs alternative spatial cropping systems, corresponding to agricultural practice scenarios. Classification systems for farms and fertilisation practices were defined to classify farm-level organisation for crop-succession and crop management strategies, in particular nitrogen fertilisation. Winter cover crops and multiple strategies per crop at the farm level can be represented with this model. Cropping systems are modelled in three steps: we modelled crop cover succession in summer with Markov chains based on empirical data and in winter with rules based on expert agronomic knowledge: lastly a knapsack-based algorithm was used to allocate a crop management system to fields with constraints on several crop management strategies per crop type. Results of a case study performed on the Fremeur catchment (western France) show that this model respects the main constraints for cropping system modelling to assess agricultural practices at the catchment scale. From a scenario discussed with stakeholders and regional authorities characterised by stable areas of summer crops, the decrease in bare soil area in winter and overall reduction in total nitrogen fertilisation for different types of crops and farms we demonstrate the model's ability to simulate coherent cropping systems. Thus, if faced with a lack of data or knowledge about the local factors that drive changes in cropping sys

关键词： Crop succession Crop management system Stochastic modelling knapsack algorithm Nitrogen

来源：评论

学校读者我要写书评

暂无评论

Batch scheduling of consolidated virtual machines based on their workload interference model

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE 2013年第8期29卷 2057-2066页

作者： Salimi, Hadi Sharifi, Mohsen Iran Univ Sci & Technol Distributed Syst Lab Sch Comp Engn Tehran Iran

The use of virtualization technology (VT) has become widespread in modern datacenters and Clouds in recent years. In spite of their many advantages, such as provisioning of isolated execution environments and migration, current implementations of VT do not provide effective performance isolation between virtual machines (VMS) running on a physical machine (PM) due to workload interference of VMs. Generally, this interference is due to contention on physical resources that impacts performance in different workload configurations. To investigate the impacts of this interference, we formalize the concept of interference for a consolidated multi-tenant virtual environment. This formulation, represented as a mathematical model, can be used by schedulers to estimate the interference of a consolidated virtual environment in terms of the processing and networking workloads of running VMs, and the number of consolidated VMs. Based on the proposed model, we present a novel batch scheduler that reduces the interference of running tenant VMs by pausing VMs that have a higher impact on proliferation of the interference. The scheduler achieves this by selecting a set of VMs that produce the least interference using a 0-1 knapsack problem solver. The selected VMs are allowed to run and other VMs are paused. Users are not troubled by the pausing and resumption of VMs for a short time because the scheduler has been designed for the execution of batch type applications such as scientific applications. Evaluation results on the makespan of VMs executed under the control of our scheduler have shown nearly 33% improvement in the best case and 7% improvement in the worst case compared to the case in which all VMs are running concurrently. In addition, the results show that our scheduling algorithm outperforms serial and random scheduling of VMs as well. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Virtualization technology Consolidated multi-tenant virtual environments Batch scheduling Performance isolation Workload interference knapsack algorithm

来源：评论

学校读者我要写书评

暂无评论

Task Packing: Efficient task scheduling in unbalanced parallel programs to maximize CPU utilization

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2019年 134卷 37-49页

作者： Utrera, Gladys Farreras, Montse Fornes, Jordi Univ Politecn Cataluna Comp Architecture Dept C Jordi Girona 1-3 ES-08034 Barcelona Catalunya Spain Univ Cambridge Battcock Ctr Expt Astrophys JJ Thomson Ave Cambridge CB3 0HE England

Load imbalance in parallel systems can be generated by external factors to the currently running applications like operating system noise or the underlying hardware like a heterogeneous cluster. HPC applications working on irregular data structures can also have difficulties to balance their computations across the parallel tasks. In this article we extend, improve and evaluate more deeply the Task Packing mechanism proposed in a previous work. The main idea of the mechanism is to concentrate the idle cycles of unbalanced applications in such a way that one or more CPUs are freed from execution. To achieve this, CPUs are stressed with just useful work of the parallel application tasks, provided performance is not degraded. The packing is solved by an algorithm based on the knapsack problem, in a minimum number of CPUs and using oversubscription. We design and implement a more efficient version of such mechanism. To that end, we perform the Task Packing "in place", taking advantage of idle cycles generated at synchronization points of unbalanced applications. Evaluations are carried out on a heterogeneous platform using FT and miniFE benchmarks. Results showed that our proposal generates low overhead. In addition the amount of freed CPUs are related to a load imbalance metric which can be used as a prediction for it. (C) 2019 Elsevier Inc. All rights reserved.

关键词： MPI HPC Oversubscription Load balancing knapsack algorithm

来源：评论

学校读者我要写书评

暂无评论

A fractional algorithm for optimal cutting of lumber into dimension parts

引用

ANNALS OF OPERATIONS RESEARCH 2000年第P2期95卷 83-92页

作者： Carnieri, C Mendoza, GA Univ Fed Parana Dept Math BR-80060000 Curitiba Parana Brazil Univ Illinois Dept Nat Resources & Environm Sci Urbana IL 61801 USA

A fractional algorithm is described which optimizes the cutting of boards or lumber into dimension parts. The model is an extension of previously developed models and is purposely designed for cutting scenarios where the customer order for the dimension parts can be satisfied within a given range, i.e., flexible rather than exact demand. An illustrative example is presented simply to describe the model and compare results between the standard procedure and the modified procedure proposed in this paper.

关键词： knapsack algorithm furniture manufacturing cutting stock problem

来源：评论

学校读者我要写书评

暂无评论

A new elliptic curve cryptosystem for securing sensitive data applications

引用

INTERNATIONAL JOURNAL OF ELECTRONIC SECURITY AND DIGITAL FORENSICS 2013年第1期5卷 11-24页

作者： Vigila, S. Maria Celestin Muneeswaran, K. Noorul Islam Coll Engn Dept Informat Technol Kumaracoil 629180 Tamil Nadu India Mepco Schlenk Engn Coll Dept Comp Sci & Engn Sivakasi 626005 Tamil Nadu India

Enhancing security is the main intention for public key cryptosystems on the basis of the hardness of the obstinate computational problems. In this paper, the ASCII value depiction of the text message is mapped into a point on elliptic curve and this initiates a few order of complexity yet before the message is encrypted. Next, the process of encryption/decryption of a mapped elliptic curve point is illustrated by enhancing security using comparative linear congruential generator and then subjecting it to the knapsack algorithm. These steps introduce scrupulous confusion and diffusion to smash any attempt at brute force attacks. This paper also discusses the security aspects of the proposed cryptosystem which is secure against all kinds of attacks.

关键词： elliptic curve cryptography ECC discrete logarithm nonce comparative linear congruential generator CLCG knapsack algorithm

来源：评论

学校读者我要写书评

暂无评论

Predictive control and regulation strategies of air-to-water heat pumps 6

Predictive control and regulation strategies of air-to-water...

引用

6th International Building Physics Conference (IBPC)

作者： Kandler, Christian Wimmer, Patrick Honold, Johannes TUM Arcisstr 21 D-80333 Munich Germany

State of the art technologies like air-to-water heat pumps have become popular because of their high efficiencies and their supply by electricity rather than by gas or oil. As a direct result of this supply substitution and due to high load-shifting potential, electricity demand of heat pumps have to be taken into account into energy management strategies of the overall building. In this paper a new controller is discussed, which has predictive and adaptive properties and is able to optimize the running-times of non-modulating heat pumps. (C) 2015 The Authors. Published by Elsevier Ltd.

关键词： heat pump control predictive control knapsack algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：