Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
2 result(s) for "Disassembly greedy"
Sort by:
Community detection with Greedy Modularity disassembly strategy
Community detection recognizes groups of densely connected nodes across networks, one of the fundamental procedures in network analysis. This research boosts the standard but locally optimized Greedy Modularity algorithm for community detection. We introduce innovative exploration techniques that include a variety of node and community disassembly strategies. These strategies include methods like non-triad creating, feeble, random as well as inadequate embeddedness for nodes, as well as low internal edge density, low triad participation ratio, weak, low conductance as well as random tactics for communities. We present a methodology that showcases the improvement in modularity across the wide variety of real-world and synthetic networks over the standard approaches. A detailed comparison against other well-known community detection algorithms further illustrates the better performance of our improved method. This study not only optimizes the process of community detection but also broadens the scope for a more nuanced and effective network analysis that may pave the way for more insights as to the dynamism and structures of its functioning by effectively addressing and overcoming the limitations that are inherently attached with the existing community detection algorithms.
Matching algorithms to assist in designing with reclaimed building elements
Reuse of building components is one of the recommended circular strategies to reduce the environmental impact of new buildings. However, reclaimed building components are more difficult to design with than new products. While new products can be made to match exact needs, the salvaged components have predefined dimensions and quality limitations. Following the Design Science Research methodology, we attempt to answer how the reuse design can be aided by a digital design tool. The developed matching algorithms suggest the optimal assignment of available elements for the desired configuration, considering user-defined constraints and optimisation criteria. In the test cases, we seek to optimise the global warming potential of timber framing elements, defined by life cycle assessment, though the tool is not limited to this objective. The implementation includes greedy algorithms, bipartite graphs, and mixed integer linear programming. The usefulness of the proposed solution is evaluated on simulated sets of building elements in terms of embodied emission reduction and speed of the calculation. The paper contributes with methodologies, algorithms, and test cases to assess their performance. Practitioners can apply the proposed solution to reduce the time of designing with salvaged materials, which can lead to the popularisation of the circular design.