This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

This paper presents an approach to the elastic analysis of beams subjected to Saint-Venant torsion using Green’s theorem and the finite difference method (FDM). The Saint-Venant torsion of beams, also called free torsion or unrestrained torsion, is characterized by the absence of axial stresses due to torsion; only shear stresses are developed. A solution to this torsion problem consists of finding a stress function that satisfies the governing equation and the boundary conditions. The FDM is an approximate method for solving problems described with differential equations; it does not involve solving differential equations, equations are formulated with values at selected nodes of the structure. In this paper, the beam’s cross-section was discretized using a two-dimensional grid and additional nodes were introduced on the boundaries. The introduction of additional nodes allowed us to apply the governing equations at boundary nodes and satisfy the boundary conditions. Beams with solid sections as well as multiply connected cross-sections were analyzed using this model; shear stresses and localized stresses at reentrant corners, torsion constant, and warping displacements were determined. Furthermore, beams with thin-walled closed sections, single-cell or multiple-cell, were analyzed using the Prandtl stress function whereby a linear distribution of the shear stresses over the thickness was considered; closed-form solutions for shear stresses and torsion constant were derived. The results obtained in this study showed good agreement with the exact results for rectangular cross-sections, and the accuracy was increased through a grid refinement. For thin-walled closed sections, the shear stresses obtained at the centerline using the closed-form solutions were in agreement with the values using Bredt’s analysis but the maximal values in the cross-section, which did not necessarily occur at the position with the smallest thickness, were higher; in addition, the results using the closed-form solutions were in good agreement with those using FDM.

Solving Linear equations with large number of variable contains many computations to be performed either iteratively or recursively. Thus it consumes more time when implemented in a sequential manner. There are many ways to solve the linear equations such as Gaussian elimination, Cholesky factorization, LU factorization, QR factorization. But even these methods when implemented on a sequential platform yield slower results as compared to a parallel platform where the time consumption is reduced considerably due to concurrent execution of instructions. The above mentioned linear equation solving methods can be implemented on the parallel platform using the direct approaches such as pipelining or 1D and 2D Partitioning approach. Vedic mathematics is a very ancient approach for solving mathematical problems. These Vedic mathematical approaches are well known for quicker and faster computation of mathematical problems. Vedic Mathematics provides a very different outlook towards the approach of solving linear Equation on parallel platform. It could be considered as a better approach for reducing space consumption and minimizing the number of algebraic operations involved in solving linear equation. In future Vedic Mathematics might serve as a viable solution for solving linear equation on parallel platform.

Despite the increasing role of machine learning in various fields, very few works considered artificial intelligence for frequency estimation (FE). This work presents a comprehensive analysis of deep-learning (DL) approach for frequency estimation of single-tones. It is shown that DL network with two layers having a few nodes can estimate frequency more accurately than well-known classical techniques. The study is comprehensive, filling gaps of existing works, where it analyzes error under different signal-to-noise ratios, numbers of nodes, and numbers of input samples; also, under missing SNR information. It is found that DL-based FE is not significantly affected by SNR bias or number of nodes. DL-based approach can work properly using minimal number of input nodes N at which classical methods fail. It is possible for DL to use as little as two layers with two or three nodes each, with complexity of O{N} versus O{Nlog2 (N)} for DFT-based FE, noting that less N is required for DL. Hence, DL can significantly reduce FE complexity, memory, cost, and power consumption, making DL-based FE attractive for resource-limited systems like some IoT sensor applications. Also, reduced complexity opens the door for hardware-efficient implementation using short word-length (SWL) or time-efficient software-defined radio (SDR) communications.

In the face of the burgeoning electricity demands and the imperative for sustainable development amidst rapid industrialization, this study introduces a dynamic and adaptable framework suitable for policy-makers and renewable energy experts working on integrating and optimizing renewable energy solutions. While using a case study representative model for Sub-Saharan Africa (SSA) to demonstrate the challenges and opportunities present in introducing optimization methods to bridge power supply deficits and the scalability of the model to other regions, this study presents an agile multi-criteria decision tool that pivots on four key development phases, advancing upon established methodologies and pioneering refined computational techniques, to select optimal configurations from a set of Policy Decision Making Metrics (PDM-DPS). Central to this investigation lies a rigorous comparative analysis of variants of three advanced algorithmic approaches: Swarm-Based Multi-objective Particle Swarm Optimization (MOPSO), Decomposition-Based Multi-objective Evolutionary Algorithm (MOEA/D), and Evolutionary-Based Strength Pareto Evolutionary Algorithm (SPEA2). These are applied to a grid-connected hybrid system, evaluated through a comprehensive 8760-hour simulation over a 20-year planning horizon. The evaluation is further enhanced by a set of refined Algorithm Performance Evaluation Metrics (AL-PEM) tailored to the specific constraints. The findings not only underscore the robustness and consistency of the SPEA2 variant over 15 runs of 200 generations each, which ranks first on the AL-PEM scale but also validate the strategic merit of combining multiple technologies and empowering policymakers with a versatile toolkit for informed decision-making.

In this paper, we first define the concepts of r-fuzzy soft α-open (semi-open and δ-open) sets on fuzzy soft topological spaces based on the article Aygunoglu et al. (Hacet. J. Math. Stat., 43 (2014), 193-208), and the relations of these sets with each other are established. In addition, we introduce the concepts of fuzzy soft δ-closure (δ-interior) operators, and study some properties of them. Also, the concept of r-fuzzy soft δ-connected sets is introduced and studied with help of fuzzy soft δ-closure operators. Thereafter, we define the concepts of fuzzy soft α-continuous (β-continuous, semi-continuous, pre-continuous and δ-continuous) functions, which are weaker forms of fuzzy soft continuity, and some properties of these functions along with their mutual relationships are discussed. Moreover, a decomposition of fuzzy soft α-continuity and a decomposition of fuzzy soft semi-continuity is obtained. Finally, as a weaker form of a fuzzy soft continuity, the concepts of fuzzy soft almost (weakly) continuous functions are defined, and some properties are specified. Additionally, we explore the notion of continuity in a very general setting called, fuzzy soft (L, M, N, O)-continuous functions and a historical justification is introduced.

Safety limits application has always been a traditional approach to ensure the safe operation of electro-mechanical systems within many industries including automated vehicles, robotics, aerospace, traditional automotive, railways, manufacturing, etc. In all of these applications, control and safety limits are usually hard-coded into the production firmware and are fixed throughout the entire product life cycle. Currently, due to the evolving needs of automated systems like automated vehicles and robots, this traditional approach does not address all the use cases and scenarios to ensure safe operation. Especially for data-driven machine learning applications that constantly evolve and learn over time, it is important to be able to adjust the safety limits application strategy to be more flexible and adaptable based on different Operational Design Domains (ODDs) and scenarios. Our ITSC conference paper ~\cite{4} introduced the concept of a new safety limits application strategy called the Dynamic Control Limits Application (DCLA) strategy that supports the flexible application of diverse limits profiles based on the parameters involved within the dynamic scenario at different layers of the Autonomy software stack.This paper extends the DCLA strategy to derive the complete methodology for safety limits application based on ODD elements, scenario identification and scenario classification using Decision Making Engines. It leverages the layered architecture introduced in the ITSC conference paper to implement the Decision Making (DM) algorithms. Another important extension is the use of cloud infrastructure that is based on the Vehicle-to-Infrastructure (V2I) technology to store the scenarios and the limits mapping to serve as a ground truth and/or a backup mechanism in case of errors or failures associated with the main Decision Making (DM) Engine. There is also a focus on providing a more comprehensive list of scenarios and a custom built experimental dataset to cover the maximum ODD elements, and multiple tables of safety limits to be chosen from, which eventually helps in creating different safety limits application profiles. These distinct safety limits application profiles are based on the scenario parameters that are perceived by the system upon which the Decision Making algorithms are applied or trained. This systematic approach can be used within the industry for any of the future automated vehicles and systems until Level 5 Autonomy.

Smart grid software interconnects multiple Engineering disciplines (power systems, communication, software and hardware technology, instrumentation, big data, etc.). The software architecture is an evolving concept in smart grid systems in which systematic architecture development is a challenging process. The architecture has to realize the complex legacy power grid systems and cope up with current Information and Communication Technologies (ICT). The distributed generation in smart grid environment expects the software architecture to be distributed and to enable local control. Smart grid architecture should also be modular, flexible and adaptable to technology upgrades. In this paper, the authors have made a comprehensive review on architecture for smart grids. An in depth analysis of layered and agent based architectures is presented and compared under various domains.

Background: Transcription factors (TFs) are main regulators of eukaryotic gene expression. The cooperative binding to genomic DNA of at least two TFs is the widespread mechanism of transcription regulation. Cooperating TFs can be revealed through the analysis of co-occurrence of their motifs. Methods: We applied Motifs Co-Occurrence Tool (MCOT) that predicted pairs of spaced or overlapped motifs (composite elements, CEs) for a single ChIP-seq dataset. We improved MCOT capability for prediction of asymmetric CEs with one of participating motifs possessing higher conservation than another does. Results: Analysis of 119 ChIP-seq datasets for 45 human TFs revealed that almost for all families of TFs the co-occurrence with an overlap between motifs of target TFs and more conserved partner motifs was significantly higher than that for less conserved partner motifs. The asymmetry toward partner TFs was the most clear for partner motifs of TFs from ETS family. Conclusion: Co-occurrence with an overlap of less conserved motif of a target TF and more conserved motifs of partner TFs explained a substantial portion of ChIP-seq data lacking conserved motifs of target TFs. Among other TF families, conservative motifs of TFs from ETS family were the most prone to mediate interaction of target TFs with its weak motifs in ChIP-seq.