scholarly journals On the node reliability of Harary graphs: an analysis through real-world topologies

Author(s):  
Leonardo de Lima

The literature on network reliability shows that Harary networks are designed so that the link reliability is maximum in many cases. The following question: ``what are the best topology networks in maximizing node reliability?'' is still open. In this paper, we performed computational experiments with eleven real-world networks and their corresponding Harary graphs. The node reliability of both sets of networks was computed. Computational results point out that the Harary network has a topology with high node reliability if compared to the real-world networks studied.

2021 ◽  
Author(s):  
Leonardo de Lima

The literature on network reliability shows that Harary networks are designed so that the link reliability is maximum in many cases. The following question: ``what are the best topology networks in maximizing node reliability?'' is still open. In this paper, we performed computational experiments with eleven real-world networks and their corresponding Harary graphs. The node reliability of both sets of networks was computed. Computational results point out that the Harary network has a topology with high node reliability if compared to the real-world networks studied.


2012 ◽  
Vol 178-181 ◽  
pp. 2854-2858
Author(s):  
Ming Yu Zhao ◽  
Zhen Yu Wang ◽  
Qiong Liu

Crew rostering is one of the most important scheduling problems for large airlines. In this study, a LP resolving algorithm in the B&B tree context and a heuristic for the IP solution of the crew rostering problem were proposed. The efficiency mainly comes from the special structure of the crew rostering problem. The computational experiments on the real-world problems showed that the time of the proposed resolving algorithm doesn't exceed 30% of that solves from scratch although the problem has largely changed, and the heuristic for the IP solution can rapidly get a sufficiently good scheme for all crew.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Ilkyeong Moon ◽  
Dong Kyoon Yoo ◽  
Subrata Saha

Most papers on the newsboy problem assume that excess inventory is either sold after discount or discarded. In the real world, overstocks are handled with multiple discounts, upgrades, or a combination of these measures. For example, a seller may offer a series of progressively increasing discounts for units that remain on the shelf, or the seller may use incrementally applied innovations aimed at stimulating greater product sophistication. Moreover, the normal distribution does not provide better protection than other distributions with the same mean and variance. In this paper, we find the differences between normal distribution approaches and distribution-free approaches in four scenarios with mean and variance of demand as the only available data to decision-makers. First, we solve the newsboy problem by considering multiple discounts. Second, we formulate and solve the newsboy problem by considering multiple upgrades. Third, we formulate and solve a mixed newsboy problem characterized with multiple discounts and upgrades. Finally, we extend the model to solve a multiproduct newsboy problem with a storage or a budget constraint and develop an algorithm to find the solutions of the models. Concavity of the models is proved analytically. Extensive computational experiments are presented to verify the robustness of the distribution-free approach. The results show that the distribution-free approach is robust.


2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Jong-Hyun Lee ◽  
Chang Wook Ahn ◽  
Jinung An

In recent days, self-assembling swarm robots have been studied by a number of researchers due to their advantages such as high efficiency, stability, and scalability. However, there are still critical issues in applying them to practical problems in the real world. The main objective of this study is to develop a novel self-assembling swarm robot algorithm that overcomes the limitations of existing approaches. To this end, multitree genetic programming is newly designed to efficiently discover a set of patterns necessary to carry out the mission of the self-assembling swarm robots. The obtained patterns are then incorporated into their corresponding robot modules. The computational experiments prove the effectiveness of the proposed approach.


2010 ◽  
Vol 20 (3) ◽  
pp. 100-105 ◽  
Author(s):  
Anne K. Bothe

This article presents some streamlined and intentionally oversimplified ideas about educating future communication disorders professionals to use some of the most basic principles of evidence-based practice. Working from a popular five-step approach, modifications are suggested that may make the ideas more accessible, and therefore more useful, for university faculty, other supervisors, and future professionals in speech-language pathology, audiology, and related fields.


2006 ◽  
Vol 40 (7) ◽  
pp. 47
Author(s):  
LEE SAVIO BEERS
Keyword(s):  

2016 ◽  
Author(s):  
Lawrence A. Cunningham
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document