Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “direction-optimizing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.

97 MATHEMATICS AND COMPUTING↗

Design for steering accuracy in antenna arrays using shared optical phase shifters

Uniform linear phased arrays where many radiating elements share a relatively small number of phase shifters are investigated. Such architectures arise in arrays which derive the time delays in the signal paths from a small group of independent phase shifters. In particular, a true time-delay device which has been suggested recently for optically controlled arrays is used as the basic phase shifter. Different architectures, viz. alternative procedures of deriving the necessary time delay for each antenna in the face of phase-shifter inaccuracies, are examined. The variance of the steered beam's direction is used as the performance criterion. The direction-optimal architecture is obtained by means of quadratic programming, and is shown not to be unique. The nonuniqueness of the optimal architecture is exploited to improve other characteristics of the array's beam shape, and the optimal solution is shown to compare favorably with a suboptimal interleaved solution which is easier to implement.

Kam, Moshe↗