Engineering Rules-Based Orthogonal and Variable-Steps Pipe Routing Algorithm for Aero-Engines

2012 ◽  
Vol 442 ◽  
pp. 104-108
Author(s):  
Xiao Lan Bai ◽  
Yu Zhang
Keyword(s):  
Routing Algorithm ◽  
Specific Flow ◽  
Memory Space ◽  
Fast Search ◽  
3D Space ◽  
Cylindrical Coordinate ◽  
Pipe Routing ◽  
Search Speed ◽  
Aero Engines

Pipe routing is to design the routes for pipes in 3D space, meeting various constraints and engineering rules. This paper proposes the engineering rules-based orthogonal and variable-steps pipe routing algorithm. Firstly, the cylindrical coordinate system was adopted to describe the layout space and obstacles. In view of two endpoints of the pipe and obstacles in between, the local searching space was built. Then, the searching algorithm was given according to engineering rules, which was involved with the orthogonal searching directions and their order, the searching variable-steps. Moreover, the specific flow of this algorithm was described. The algorithm requires less memory space and has a fast search speed. The case study shows it is feasible and effective.

Research on the Automatic and Optimized Pipe Routing Layout for Aero-Engines Based on Improved Artificial Fish Swarm Algorithm

2013 ◽  
Vol 437 ◽  
pp. 275-280 ◽  
Author(s):  
Yu Zhang ◽  
Xiao Lan Bai
Keyword(s):  
Rapid Development ◽  
Local Optimum ◽  
Artificial Fish Swarm Algorithm ◽  
Pipe Routing ◽  
Aero Engine ◽  
Artificial Fish Swarm ◽  
Swarm Algorithm ◽  
Aero Engines ◽  
The Mathematical Model

With the rapid development of aerospace industries, how to realize the automatic and optimized pipe-routing layout for the aero-engine has become a hot issue to be urgently solved. For the issue, a novel automatic and optimized pipe-routing layout method based on the improved artificial fish swarm algorithm was put forward in this paper. First, the mathematical model of the pipe-routing layout problem was established. Then, in view of the deficiencies of the artificial fish swarm algorithm,chaos mutation was used to carry out easy and rapid searching as well as robust escape from the local optimum,and gradient setting was used to raise the convergence speed and the solving accuracy.Further, the improved artificial fish swarm algorithm was applied to the pipe-routing layout for the aero-engine. At the end, the effectiveness and feasibility of the proposed method was proved by a case study.

Research on Information Extraction in Pipe-Routing Layout Space for Complex Products

2012 ◽  
Vol 155-156 ◽  
pp. 250-254
Author(s):  
Xiao Lan Bai ◽  
Yu Zhang
Keyword(s):  
Information Extraction ◽  
Free Space ◽  
Extraction Method ◽  
Spatial Information ◽  
The State ◽  
Complex Products ◽  
Pipe Routing ◽  
Aero Engines ◽  
Flow Of Information

The extraction of information in the layout space is a basis and key to realize automatic pipe-routing layout for complex products such as aero-engines. This paper proposes the filling-surrounding spatial information extraction method. The layout space was first divided into several regions according to the location of accessories, which resulted in the parallel extraction of information in the layout space. Then by means of the filling idea, accessories in each region were filled one by one. After accessories’ rough containing boxes were determined, each accessory and free space was represented with discrete points by using grids to divide the rough containing box. Finally, the outside-in surrounding scanning was used for the rough containing box to identify the state of spatial points. In addition, the flow of information extraction and the storage mode of the extracted information were given. The case study illustrates its feasibility and effectiveness.

scholarly journals Information processing for Similar Source code using LSH Algorithm

2021 ◽  
Vol 23 (07) ◽  
pp. 23-34
Author(s):  
Mrs. Vani Dave ◽  
◽  
Mr Sanjeev Kumar shukla ◽  
Keyword(s):  
Information Processing ◽  
Execution Time ◽  
Source Code ◽  
Locality Sensitive Hashing ◽  
Source File ◽  
C Language ◽  
Fast Search

In this study, we propose a method to quickly search for similar source files for a given source file as a method to examine the origin of reused code. By outputting not only the same contents but also similar contents, it corresponds to the source file that has been changed during reuse. In addition, locality-sensitive hashing is used to search from a large number of source files, enabling fast search. By this method, it is possible to know the origin of the reused code. A case study was conducted on a library that is being reused written in C language. Some of the changes were unique to the project, and some were no longer consistent with the source files. As a result, it was possible to detect the source files that were reused from among the 200 projects with 92% accuracy. In addition, when we measured the execution time of the search using 4 files, the search was completed within 1 second for each file.

Cluster-Based Online Routing Protocols for Ad Hoc Network

2014 ◽  
Vol 9 (4) ◽  
pp. 54-66
Author(s):  
Alaa E. Abdallah ◽  
Mohammad Bsoul ◽  
Emad E. Abdallah ◽  
Ibrahim Al–Oqily ◽  
George Kao
Keyword(s):  
Ad Hoc ◽  
Dominating Set ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Greedy Routing ◽  
Mobile Nodes ◽  
3D Space ◽  
Geographical Position ◽  
2D Space ◽  
New Algorithms

In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cylinder routing, the nodes are locally projected on the inner surface of a cylinder, perimeter routing is executed after that. Greedy-Cylinder starts with Greedy routing algorithm until a local minimum is reached. The algorithm then switches to Cylinder routing. Cluster-Cylinder elects a dominating set for all nodes and then uses this set for projection and routing. The fourth algorithm Greedy-cluster-Cylinder is a combination between Greedy-Cylinder and Cluster-Cylinder. The authors evaluate their new algorithms and compare them with many classical known algorithms. The simulation outcomes show the substantial enhancement in delivery rate over other algorithms.

scholarly journals Gradient-Based Pipe Routing Tool for Aero-Engines

2020 ◽  
Author(s):  
Daniel Krsikapa ◽  
Luke Crispo ◽  
Kee Seung Oh ◽  
Il Yong Kim
Keyword(s):  
Pipe Routing ◽  
Gradient Based ◽  
Aero Engines

Case Study: Opening Up Memory Space: The Challenges of Audiovisual History

2012 ◽  
Author(s):  
Albert Lichtblau
Keyword(s):  
Oral History ◽  
Paradigm Shift ◽  
Technical Development ◽  
Primary Sources ◽  
Memory Space ◽  
New Methods ◽  
Written Form ◽  
Opening Up ◽  
Recording Techniques

The emergence of oral history was connected with a technical development—namely the possibility of recording human voices. The recording techniques developed rapidly. This article discusses the challenges faced while recording audiovisual history. In the 1980s expensive filmmaking began to be replaced by more affordable video formats, which took the technical development of oral history to a new audiovisual level. The paradigm shift generated by oral history in which historians began to generate their own primary sources announced another transformation of the way historians worked: taking leave of the written form and communicating scholarly results in audiovisual form. This article seeks to describe what the integration of the visual aspect means for oral historians in generating documents of remembrance. It elaborates on a few concrete examples of how integrating the camera's eye has shaped audiovisual history. A discussion on negotiation of remembrance followed by new methods and issues of videohistory concludes this article.

Sign in / Sign up

Export Citation Format

Share Document