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

Sixth International Conference on Developments in eSystems Engineering (DeSE)

作者： Baker, Thar Ngoko, Yanik Tolosana-Calasanz, Rafael Rana, Omer F. Randles, Martin Liverpool John Moores Univ Sch Comp & Math Sci Liverpool Merseyside England Paris Nord Inst Gallillee Lab Informat Paris France Univ Zaragoza Dept Informat & Ingn Sistemas Zaragoza Spain Cardiff Univ Sch Comp Sci & Informat Cardiff S Glam Wales

ISBN: (纸本)9781479952649

The ever-increasing density in cloud computing users, services, and data centres has led to significant increases in network traffic and the associated energy consumed by its huge infrastructure, e.g. extra servers, switches, routers, which is required to respond quickly and effectively to users requests. Transferring data, via a high bandwidth connection between data centres and cloud users, consumes even larger amounts of energy than just processing and storing the data on a cloud data centre, and hence producing high carbon dioxide emissions. This power consumption is highly significant when transferring data into a data centre located relatively far from the user's geographical location. Thus, it became high-necessity to locate the lowest energy consumption route between the user and the designated data centre, while making sure the user's requirements, e.g. response time, are met. This paper proposes a high-end autonomic meta-director framework to find the most energy efficient route to the green data centre by utilising the linear programming approach. The framework is, first, formalised by the situation calculus, and then evaluated against shortest path algorithm with minimum number of nodes traversed.

关键词： cloud computing computer centres energy conservation green computing linear programming power aware computing power consumption autonomic metadirector framework carbon dioxide emissions cloud data centres data transfer energy consumption route energy efficient cloud computing environment green data centre linear programming approach shortest path algorithm situation calculus Cloud computing Data models Educational institutions Energy consumption Green products Logic gates Power demand Cloud Computing Energy Efficiency Routing algorithms Cloud Computing data center Power consumption shortest path algorithms power aware computing linear programming Energy efficiency Green products Routing algorithms Power demand data models Educational institutions data transmission Logic gates energy consumption

来源：评论

学校读者我要写书评

暂无评论

Analyzing and Modeling Spatial Factors for Pre-decided Route Selection Behavior: A Case Study of Fire Emergency Vehicles of Allahabad City 4th

Analyzing and Modeling Spatial Factors for Pre-decided Route...

引用

4th International Conference on Frontiers in Intelligent Computing - Theory and Applications (FICTA)

作者： Bandyopadhyay, Mainak Singh, Varun MNNIT Allahabad GIS Cell Allahabad Uttar Pradesh India MNNIT Allahabad Dept Civil Engn Allahabad Uttar Pradesh India

ISBN: (纸本)9788132226956;9788132226932

Developing countries like India seriously lack computing infrastructure for evaluating the performance of emergency response services. Most of the time it is assumed that drivers take the shortest distance route to reach the incident location. In this paper a model is proposed for the pre-decided route selection behavior of Fire Emergency Vehicle drivers. The characteristics of routes selected by Fire Emergency Vehicle drivers of Allahabad City are analyzed spatially to comprehend the influence of proximity area of road segments on pre-decided route selection. A model using shortest path algorithm and spatial factors, i.e., length, width, land use of the proximity, and population density of the area are developed and compared with shortest Distance assumption.

关键词： Fire emergency vehicle Emergency response GPS trajectory shortest path algorithm Land-use type Population density GIS

来源：评论

学校读者我要写书评

暂无评论

MISSION ANALYSIS AND OPERATIONAL OPTIMIZATION OF ADAPTIVE CYCLE MICRO-TURBOFAN ENGINE IN SURVEILLANCE AND FIREFIGHTING SCENARIOS

MISSION ANALYSIS AND OPERATIONAL OPTIMIZATION OF ADAPTIVE CY...

引用

ASME Turbo Expo: Turbomachinery Technical Conference and Exposition

作者： Palman, M. Leizeronok, B. Cukurel, B. Technion Israel Inst Technol IL-3200003 Haifa Israel

ISBN: (纸本)9780791851043

The current work focuses on mission based evaluation of a novel engine architecture arising from the conversion of a micro turbojet to a micro turbofan via introduction of a variable speed fan and bypass nozzle. The solution significantly improves maximum thrust by 260%, reduces fuel consumption by as much as 60% through maintaining the core independently running at its optimum, and enables a wider operational range, all the meanwhile preserving a simple single spool configuration. Particularly, the introduction of a variable speed fan, enables real-time optimization for both high speed cruise and low speed loitering. In order to characterize the performance of the adaptive cycle engine with increased number of controls (engine speed, gear ratio, bypass opening), a component map based thermodynamic study is used to contrast it against other similar propulsion systems with incrementally reduced input variables. In following, a shortest path based optimization is conducted over the locally minimum fuel consumption operating points, based on a set of gradient driven connectivity constraints for changes in gear ratio and bypass nozzle area. The resultant state transition graphs provide global optimum for fuel consumption at a thrust range in a given altitude and Mach flight envelope. Then, the engine model is coupled to a flight mechanics solver supplied with a conceptual design for a representative multipurpose UAV. Lastly, the associated mission benefits are demonstrated in surveillance and firefighting scenarios.

关键词： variable cycle engine continuously variable transmission variable bypass nozzle area turbojet-turbofan conversion multivariable engine optimization state transition graph and connectivity shortest path algorithm flight mechanics simulation mission analysis

来源：评论

学校读者我要写书评

暂无评论

Inclusion of Socio-Economic Indicators in the Cost Modeling of a WAN Network 6

Inclusion of Socio-Economic Indicators in the Cost Modeling ...

引用

International Conference on Computational Intelligence, Communication Systems and Networks

作者： Ahmedi, Basri Mitrevski, Pece State Univ Tetovo Fac Math & Nat Sci Tetovo North Macedonia Univ St Clement Ohridski Fac Tech Sci Bitola North Macedonia

ISBN: (纸本)9781479950768

The most important stages in designing a computer network in a wider geographical area include: definition of requirements, topological description, identification and calculation of relevant parameters (i.e. traffic matrix), determining the shortest paths between nodes, quantification of the effect of various levels of technical and technological development of urban areas involved, the cost of technology, and the cost of services. These parameters differ for WAN networks in different regions - their calculation depends directly on the data "on the ground": number of inhabitants, distance between populated areas, density of network traffic, as well as available bandwidth. However, behavioral interactions of individuals and groups play a significant role and have to be taken into consideration by employing either simple or composite indicators of socioeconomic status. In this paper, we propose the inclusion of a composite socioeconomic indicator in the cost-modeling of a WAN network, as a linear sum of products of weights and several measures of labor status and/or education.

关键词： Wide Area Network traffic matrix shortest path algorithm traffic density network bandwidth socioeconomic indicators

来源：评论

学校读者我要写书评

暂无评论

Optimum Support Structure Generation for Additive Manufacturing Using Unit Cell Structures and Support Removal Constraint

引用

Procedia Manufacturing 2016年 5卷 1043-1059页

作者： Vaidya R. Anand S. Department of Mechanical Materials Engineering Center for Global Design Manufacturing University of Cincinnati Cincinnati OH 45221 United States

Additive Manufacturing (AM) is the process in which a part is built using a layer by layer approach. Due to the inherent nature of the process, support structures are required to support overhanging features while building a part by AM. Support Structures increase the build time and cost of manufacturing and also have an adverse effect on the surface finish of the part. This paper presents a new approach for minimizing support structures using space filling cellular structures in conjunction with Dijkstra's shortest path algorithm to generate optimized support structures. Further, additional support accessibility constraints are applied to the support generation algorithm to ensure the ease of removal of the supports after manufacturing the part. The algorithm is validated by simulating the supports for two test parts while performing FEA analysis to test whether the generated structures are capable of supporting the weight of the part. A third test case is presented to verify the results of the algorithm using the support accessibility constraint. © 2016 The Authors

关键词： Additive Manufacturing Optimization shortest path algorithm Support Accessibility. Support Structures Unit cells

来源：评论

学校读者我要写书评

暂无评论

A New Method for Measuring the Semantic Similarity on Gene Ontology

A New Method for Measuring the Semantic Similarity on Gene O...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Shen, Ying Zhang, Shaohong Wong, Hau-San City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424483075

Semantic similarity defined on Gene Ontology (GO) aims to provide the functional relationship between different biological processes, molecular functions, or cellular components. In this paper, a novel method, namely the shortest path (SP) algorithm, for measuring the semantic similarity on GO is proposed based on both the GO structure information and the term's property. The proposed algorithm searches for the shortest path that connects two terms and uses the sum of weights on the shortest path to compute the semantic similarity for GO terms. A method for evaluating the nonlinear correlation between two variables is also introduced for validation. Extensive experiments conducted on two public gene expression datasets demonstrate the overall superiority of SP method over the other state-of-the-art methods evaluated.

关键词： bioinformatics biological processes cellular biophysics cellular components gene ontology genetics molecular biophysics molecular functions ontologies (artificial intelligence) public gene expression datasets semantic similarity shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Assessment and possible solution to increase the resilience of Terni distribution Grid: the ice sleeves formation threat 110

Assessment and possible solution to increase the resilience ...

引用

110th AEIT International Annual Conference

作者： Bragatto, T. Cresta, M. Gatta, F. M. Geri, A. Maccioni, M. Paulucci, M. Sapienza Univ Rome Dept Astronaut Elect & Energy Engn DIAEE Rome Italy ASM Terni SpA Terni Distribuz Elettr Prod Unit Terni Italy

ISBN: (纸本)9788887237405

The paper proposes a procedure to assess the resilience of an electricity distribution grid against possible threats and, in particular, with respect to extreme weather events (e.g. water bombs, heat waves, ice sleeves). This procedure, which implements the exploration of the network graph based on the "shortest path" algorithm, calculates the performance indices by evaluating the number and magnitude of interruptions produced by the considered threat. The procedure also identifies the defensive actions to be implemented in order to minimize the impact. Referring to a case study, the application of the simulation model has highlighted the effectiveness of the proposed indices, and the efficiency of the countermeasure detection algorithm to reduce the impact of the ice sleeves and, more generally, the effects of other threats.

关键词： electric grid resilience heat waves ice sleeves shortest path algorithm water bombs

来源：评论

学校读者我要写书评

暂无评论

Graph4Edge: A Graph-based Computation Offloading Strategy for Mobile-Edge Workflow Applications 18

Graph4Edge: A Graph-based Computation Offloading Strategy fo...

引用

IEEE International Conference on Pervasive Computing and Communications (PerCom)

作者： Fan, Lingmin Liu, Xiao Li, Xuejun Yuan, Dong Xu, Jia Anhui Univ Sch Comp Sci & Technol Hefei Peoples R China Deakin Univ Sch Informat Technol Geelong Vic Australia Univ Sydney Sch Elect & Informat Engn Sydney NSW Australia

ISBN: (纸本)9781728147161

Mobile Edge Computing (MEC) expands the capability of mobile devices so that users can run complicated and computation-intensive applications such as workflow and machine learning tasks. Computation offloading is the key technology for MEC and has attracted a lot of research efforts in recent years. However, most of the existing studies employed optimisation algorithms such as GA and PSO which have significant computation overhead. Meanwhile, the computation tasks are often assumed to be independent of each other, which is not applicable to workflow applications with strong task dependencies. To address these issues, we propose Graph4Edge which is a graph-based computation offloading strategy for mobile-edge workflow applications. In this paper, firstly, we formulate the computation offloading problem in MEC using a DAG (Directed Acyclic Graph) based model;secondly, we propose the shortest-path-based algorithm to find the optimal computation offloading plan;finally, preliminary experiments with real-world workflow traces are conducted to evaluate the performance of our proposed strategy. Given the promosing results demonstrated in this paper, we have also presented some important research directions for our future work.

关键词： Mobile Edge Computing Computation Offloading Workflow Directed Acyclic Graph shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Multiple repair scheduling of Markovian deteriorated concrete structure

引用

Asian Journal of Civil Engineering 2021年第6期22卷 1033-1043页

作者： Shafiqul, Islam Md. Dept. of Civil Engineering Rajshahi University of Engineering & Technology Kazla 6204 Bangladesh

Choice of suitable repair method at proper time can extend lifetime of infrastructure and can reduce overall cost, saves revenue of the government. Maintenance optimization is the most cost-effective solution for infrastructure management system, used by bridge management system (BMS) of several countries. In this paper, deterioration of bridge deck by chloride diffusion is considered as a cause of failure. Monte Carlo simulation was used to develop transition probability matrix that was further used to predict future state through Markov process. This paper attempts to tabulate a schedule of multiple repair required by a Markov-deteriorated concrete structure. Challenges of incorporating different levels of cost and improvements to the facilities, imposed by the multiple repair at different age, were solved by the shortest path algorithm. Recursive equations, in excel solver platform, were used to update failure state of the facility to visualize the necessity of the repair actions. Sensitivity on unequal capacity of failure reduction and non-identical cost incurred by multiple repair methods are presented to estimate maintenance schedule. However, the model, described in this paper may be used as an efficient tool for infrastructure asset management. © 2021, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

关键词： Failure reduction Markov process Multiple repair Scheduling repair shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

NPASA : A NOBLE path SELECTION algorithm

NPASA : A NOBLE PATH SELECTION ALGORITHM

引用

International Symposium on Computer Science and Its Applications

作者： Newton, P. Calduwel Raj, E. George Dharma Prakash Arockiam, L. Prasath, R. Hari Kim, Tai-hoon Bishop Heber Coll Autonomous Dept Comp Sci & Applicat Tiruchirappalli 620017 Tamil Nadu India St Josephs Coll Autonomous Lecturer SG Comp Sci Tiruchirappalli 620002 Tamil Nadu India Hannam Univ Dept Multimedia Taejon South Korea

ISBN: (纸本)9780769534282

As the network is growing exponentially, challenges and issues also increases. They affect the performance of the network. Many factors contribute improve the performance of the network.. One such factor is finding the path quickly. In this paper, we ore,going to find a shortest bath faster compared to Dijkstra's shortest path algorithm. We have introduced new ideas in building end-to-end path. various Steps involved ill finding the shortest path ore: refined. The simulated algorithm shows better results than the existing algorithm. We are sure that, the outcome of this paper reduces computation overhead and processing overload.

关键词： Computation Processing overhead shortest path algorithm End-to-End path

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：