Search results
1 – 3 of 3Hao Cao, Rong Mo, Neng Wan, Fang Shang, Chunlei Li and Dongliang Zhang
– The purpose of this paper is to present an automated method for complicated truss structure subassembly identification.
Abstract
Purpose
The purpose of this paper is to present an automated method for complicated truss structure subassembly identification.
Design/methodology/approach
A community-detecting algorithm is introduced and adapted to reach the target. The ratio between oriented bounding boxes of parts is used as the weight to reflect the compact degree of assembly relationships. The authors also propose a method to merge nodes together at cut-vertex in model, by which the solving process could be accelerated.
Findings
This method could identify the subassemblies of complex truss structures according to the specific requirements.
Research limitations/implications
This research area is limited to truss structures. This research offers a new method in assembly sequences planning area. It could identify subassemblies in complex truss structures, with which the existing method is not adequate to deal.
Practical implications
This method could facilitate the complex truss structures assembly planning, lower the human errors and reduce the planning time.
Social implications
The method could inspire general assembly analysis planning.
Originality/value
All authors of this paper confirm that this manuscript is original and has not been submitted or published elsewhere.
Details
Keywords
Petko Kitanov, Odile Marcotte, Wil H.A. Schilders and Suzanne M. Shontz
To simulate large parasitic resistive networks, one must reduce the size of the circuit models through methods that are accurate and preserve terminal connectivity and network…
Abstract
Purpose
To simulate large parasitic resistive networks, one must reduce the size of the circuit models through methods that are accurate and preserve terminal connectivity and network sparsity. The purpose here is to present such a method, which exploits concepts from graph theory in a systematic fashion.
Design/methodology/approach
The model order reduction problem is formulated for parasitic resistive networks through graph theory concepts and algorithms are presented based on the notion of vertex cut in order to reduce the size of electronic circuit models. Four variants of the basic method are proposed and their respective merits discussed.
Findings
The algorithms proposed enable the production of networks that are significantly smaller than those produced by earlier methods, in particular the method described in the report by Lenaers entitled “Model order reduction for large resistive networks”. The reduction in the number of resistors achieved through the algorithms is even more pronounced in the case of large networks.
Originality/value
The paper seems to be the first to make a systematic use of vertex cuts in order to reduce a parasitic resistive network.
Details
Keywords
Joshua R. Muckensturm and Dave C. Longhorn
This paper introduces a new heuristic algorithm that aims to solve the military route vulnerability problem, which involves assessing the vulnerability of military cargo flowing…
Abstract
Purpose
This paper introduces a new heuristic algorithm that aims to solve the military route vulnerability problem, which involves assessing the vulnerability of military cargo flowing over roads and railways subject to enemy interdiction.
Design/methodology/approach
Graph theory, a heuristic and a binary integer program are used in this paper.
Findings
This work allows transportation analysts at the United States Transportation Command to identify a relatively small number of roads or railways that, if interdicted by an enemy, could disrupt the flow of military cargo within any theater of operation.
Research limitations/implications
This research does not capture aspects of time, such as the reality that cargo requirements and enemy threats may fluctuate each day of the contingency.
Practical implications
This work provides military logistics planners and decision-makers with a vulnerability assessment of theater distribution routes, including insights into which specific roads and railways may require protection to ensure the successful delivery of cargo from ports of debarkation to final destinations.
Originality/value
This work merges network connectivity and flow characteristics with enemy threat assessments to identify militarily-useful roads and railways most vulnerable to enemy interdictions. A geographic combatant command recently used this specific research approach to support their request for rapid rail repair capability.
Details