Utilizing unmanned aerial vehicles (UAVs) to facilitate wireless communication has emerged as a viable and promising strategy aimed at enhancing both current and prospective wireless systems. This approach offers many advantages by establishing line-of-sight connections, optimizing operational efficiency, and enabling flexible deployment capabilities in various terrains. Thus, in this paper, we investigate UAV communication in a relaying network in which a UAV helps communication between a source and two destination users while flying to a location. To have a complete view of our proposed system, we consider both orthogonal multiple access as OFDM and non-orthogonal multiple access (NOMA) scenarios. Moreover, we apply successive convex optimization (SCO) and the Block-coordinate gradient descent (BCGD) for the sum-rate optimization problems to improve the system performance under constraints of total bandwidth and total power at the ground base station and UAV. The experimental results validate that the achievable secrecy rates are notably enhanced by using our proposed algorithms and show optimal trends for critical parameters, such as transmit powers, the flight trajectory and speed of UAV, and resource allocation of OFDM and NOMA.

The structures of Ag complexes with dimethyl amino phenyl substituted phtalocyanine m[dmaphPcAg]q of various charges q and in two lowest spin states m were optimized using the B3LYP method within the D4h symmetry group and its subgroups. The most stable reaction intermediate in the supposed photoinitiation reaction is 3[dmaphPcAg]-. Group-theoretical analysis of the optimized structures and of their electron states reveals two symmetry-descent mechanisms. Stable structures of maximal symmetry of complexes 1[dmaphPcAg]+, 3[dmaphPcAg]+, 2[dmaphPcAg]0 and 4[dmaphPcAg]2- correspond to the D4 group as a consequence of the pseudo-Jahn-Teller effect within unstable D4h structure. Complexes 4[dmaphPcAg]0, 1[dmaphPcAg]-, 3[dmaphPcAg]- and 2[dmaphPcAg]2- with double degenerate electron ground states in D4h symmetry structures undergo a symmetry descent to stable structures corresponding to maximal D2 symmetry not because of a simple Jahn-Teller effect but due to hidden pseudo-Jahn-Teller effect (strong vibronic interaction between excited electron states). The reduction of the neutral photoinitiator causes symmetry descent to its anionic intermediate because of vibronic interactions that must significantly affect the polymerization reactions.

Although cooperative social networks are considered key to human evolution, emphasis has usually been placed on the functions of men’s cooperative networks. What do women's networks look like? Do they resemble or differ from men's and what does this suggest about evolutionarily inherited gender differences in reproductive and social strategies? In this paper, we test the ‘universal gender differences’ hypothesis positing gender-specific network structures against the ‘gender reversal’ hypothesis that posits women's networks looking more 'masculine' under matriliny. Specifically, we ask whether men's friendship networks are always larger than women's and we investigate measures of centrality by gender and descent system. To do so, we use tools from social network analysis and data on men’s and women’s friendship ties in matrilineal and patrilineal Mosuo communities. In tentative support of the gender reversal hypothesis, we find that women's friendship networks in matriliny are relatively large. Measures of centrality and generalized linear models otherwise reveal greater differences between communities than between men and women. The data and analyses we present are primarily descriptive given limitations of sample size and sampling strategy. Nonetheless, our results provide support for the flexible application of social relationships across genders and clearly challenge the predominant narrative of universal gender differences across space and time.

In automated manufacturing systems, most of the manufacturing processes including machining are automated. Automatic tool change is one of the important parameters for reducing manufacturing lead time. Ceramic cutting tools are used to machine hard materials. Ti[C,N] mixed alumina ceramic cutting tools are widely used to machine hardened steel and Stainless Steel due to its superior mechanical properties. Martensitic stainless steel has wide applications in screws, bolts, nuts and other engineering applications. Machining studies on Martensitic Stainless Steel was conducted using Ti[C,N] mixed alumina ceramic cutting tool. Tool life was evaluated using flank wear criterion. The tool life obtained from experimental machining process was taken as training dataset and test dataset for machine learning. Using the dataset obtained from experimental machining tool life model has been developed using Gradient Descent algorithm. The model was validated using co-efficient of determination. The accuracy of the machine learning model was tested using the test data and 99.83% accuracy was obtained. Tool life model based on Gradient Descent Algorithm was successfully implemented for the tool life of Ti[C,N] mixed alumina ceramic cutting tool.Keywords: keyword 1; keyword 2; keyword 3 (List three to ten pertinent keywords specific to the article; yet reasonably common within the subject discipline.)

Modern companies accumulate a vast amount of customer data that can be used for creating a personalized experience. Analyzing this data is difficult and most business intelligence tools cannot cope with the volume of the data. One example is churn prediction, where the cost of retaining existing customers is less than acquiring new ones. Several data mining and machine learning approaches can be used, but there is still little information about the different algorithm settings to be used when the dataset doesn't fit into a single computer memory. Because of the difficulties of applying feature selection techniques at a large scale, Incremental Probabilistic Component Analysis (IPCA) is proposed as a data preprocessing technique. Also, we present a new approach to large scale churn prediction problems based on the mini-batch Stochastic Gradient Decent (SGD) algorithm. Compared to other techniques, the new method facilitates training with large data volumes using a small memory footprint while achieving good prediction results.

The Steepest Descent (or Ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool is neither taught nor even mentioned in K12 education. We study whether it is feasible for elementary school students to learn this algorithm, while also aligning with the standard school curriculum. We also look at whether it can be used to create enriching activities connected to children’s real-life experiences, thus enhancing the integration of STEM and fostering Computational Thinking. To address these questions, we conducted an empirical study in two phases. In the first phase, we tested the feasibility with teachers. In a face-to-face professional development work-shop with 457 mathematics teachers actively participating using an online platform, we found that after a 10-minute introduction they could successfully apply the algorithm and use it in a couple of models. They were also able to complete two complex and novel tasks: selecting models and adjusting the parameters of a model that uses the steepest descent algorithm. In a second phase, we tested the feasibility with 90 fourth graders from 3 low Socioeconomic Status (SES) schools. Using the same introduction and posing the same questions, we found that they were able to understand the algorithm and successfully complete the tasks on the online platform. Additionally, we found that close to 75% of the students completed the two complex modeling tasks and performed similarly to the teachers.

The Steepest Descent (or Ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool is neither taught nor even mentioned in K12 education. We study whether it is feasible for elementary school students to learn this algorithm, while also aligning with the standard school curriculum. We also look at whether it can be used to create enriching activities connected to children’s real-life experiences, thus enhancing the integration of STEM and fostering Computational Thinking. To address these questions, we conducted an empirical study in two phases. In the first phase, we tested the feasibility with teachers. In a face-to-face professional development work-shop with 457 mathematics teachers actively participating using an online platform, we found that after a 10-minute introduction they could successfully apply the algorithm and use it in a couple of models. They were also able to complete two complex and novel tasks: selecting models and adjusting the parameters of a model that uses the steepest descent algorithm. In a second phase, we tested the feasibility with 90 fourth graders from 3 low Socioeconomic Status (SES) schools. Using the same introduction and posing the same questions, we found that they were able to understand the algorithm and successfully complete the tasks on the online platform. Additionally, we found that close to 75% of the students completed the two complex modeling tasks and performed similarly to the teachers.

A single Information security is of pivotal concern for consistently streaming information over the widespread internetwork. The bottleneck flow of incoming and outgoing data traffic introduces the issue of malicious activities taken place by intruders, hackers and attackers in the form of authenticity desecration, gridlocking data traffic, vandalizing data and crashing the established network. The issue of emerging suspicious activities is managed by the domain of Intrusion Detection Systems (IDS). The IDS consistently monitors the network for identifica-tion of suspicious activities and generates alarm and indication in presence of malicious threats and worms. The performance of IDS is improved by using different signature based machine learning algorithms. In this paper, the performance of IDS model is determined using hybridization of nestrov-accelerated adaptive moment estimation –stochastic gradient descent (HNADAM-SDG) algorithm. The performance of the algorithm is compared with other classi-fication algorithms as logistic regression, ridge classifier and ensemble algorithm by adapting feature selection and optimization techniques

A class of controlled plants, whose dynamics is governed by a vector system of ordinary differential equations with a partially known right-hand side, is considered. The state variables and their velocities are assumed to be measurable. The aim is to design a controller which minimizes a loss function under certain constraints which arguments is the current state of the controlled plant. The designed control action is admitted to be a function of the current sub-gradient only, which supposed to be measurable on-line. The control design is based on ASG (Average Sub-Gradient method) — version of Integral Sliding Mode (ISM) concept, aimed to minimize on average a given convex (not obligatory strongly convex) cost function of the current state under a set of given constraints. An optimization type algorithm is developed and analyzed using ideas of SDM technique. The main results consist in proving the reachability of the "desired regime" (nonstationary analogue of sliding surface) from the beginning of the process and obtaining an explicit upper bound for the averaged loss function decrement, that is, the averaged in time functional convergence is proven and the rate of such convergence is estimated.

Fleets of drones have attracted a lot of attention from the research community in recent years. One of the biggest challenges in deploying such systems is localization. While GNSS localization systems can only be effective in open outdoor environments, new solutions based on radio sensors (e.g., ultra-wideband) are increasingly being used for localization in various situations and environments. However, self-localization without prior knowledge of anchor positions remains an open problem which, for example, makes it impossible to track a moving target. In this article, we provide a comparison of different variants of gradient descent-based algorithms, with a new improved variant, for solving the localization problem using relative distance measurements and multilateration. It is applied to self-localization of anchors and tracking targets using ultra-wideband distance sensors. A realistic simulation of drone tracking and anchors’ localization is performed to demonstrate the robustness and accuracy of the proposed approach.

In this work, we explore the extreme searching of multidimensional functions by natural gradient descent based on Dirichlet and generalized Dirichlet distributions. The natural gradient is based on describing multidimensional surface with probability distributions, which allows us to reduce changing the accuracy of gradient and step-size. In this article, we propose an algorithm of natural gradient descent based on Dirichlet and generalized Dirichlet distributions. We demonstrate that the natural gradient descent with step-size adaptation with Dirichlet and generalized Dirichlet distributions has higher accuracy and does not take a large number of iterations for minimizing test functions than gradient descent and Adam.

Artificial Intelligence is dominated by Artificial Neural Networks (ANNs). Currently, the Batch Gradient Descent (BGD) is the only solution to train ANN weights when dealing with large datasets. In this article, a modification to the BGD is proposed which significantly reduces the training time and improves the convergence. The modification, called Instance Eliminating Back Propagation (IEBP), eliminates correctly-predicted-instances from the Back Propagation. The speedup is due to the elimination of unnecessary matrix multiplication operations from the Back Propagation. The proposed modification does not add any training hyperparameter to the existing ones and reduces the memory consumption during the training.

We present a new penalized method for estimation in sparse logistic regression models with group structure. Group sparsity suggests us to consider the Group Lasso penalty. Being different from penalized log-likelihood estimation, our method can be viewed as a penalized weighted score function method. Under some mild conditions, we provide non-asymptotic oracle inequalities promoting group sparsity of predictors. A modified block coordinate descent algorithm based on a weighted score function is also employed. The net advantage of our algorithm over the existing Group Lasso-type procedures is that the tuning parameter can be pre-specified. The simulations show that this algorithm is considerably faster and more stable than competing methods. Finally, we illustrate our methodology with two real data sets.

A new layout optimization method for offshore wind farms is proposed to minimize power deficits due to wake effect. The main engine of the algorithm is a gradient-descent method, in which an analogy is established between power deficit and repulsive electrostatic potential energy. To achieve a maximum dispersion in the initial solution, throughout the optimization process, new turbines are included in the centre of the concession area, and quickly expand outward looking for areas with less potential, in turn pushing the previous ones. When the optimization process ends, to avoid local maximums, it enters into a process of suppression of the set of locations that cause the greatest potential (power deficit). Then, a potential map of the entire area is created and a greedy algorithm includes new turbines to complete the layout with the final number of turbines. To speed up the search process and the creation of the potential map, two simplifications have been validated and added: the spatial distribution of velocities has been converted into its equivalent with point symmetry; and, for turbines affected by multiple wakes, the power deficit has been calculated by using a linear aggregation of powers, instead of the usual linear (or quadratic) aggregation of speeds. Owing to this type of aggregation, the process is accelerated in a factor of 90.

The narrow parking space will result in difficulties in path planning and spot turning caused by sudden changes and discontinuities in path curvature. To address the problem, this paper investigates the performance of three path planning algorithms and proposes a path optimization algorithm. First, the narrow parking space is defined based on single-step parking of the arc-line combination parking algorithm. Second, to compare the arc-line combination algorithm, Hybrid A* algorithm, and particle swarm optimization parking algorithm under different narrow parking spaces, a multi-objective evaluation function is proposed, including three evaluation indicators, namely, the path length, the number of positive and negative conversions of vehicle speed, and the smoothness of the path. Their performance is compared by simulation conducted in MATLAB, the results show that the Hybrid A* algorithm is the better than others for narrow parking spaces. Third, to smooth the planning path, a path optimization algorithm based on the cubic B-spline curve and gradient descent is proposed. Finally, the simulation is conducted between the proposed algorithm and Hybrid A* algorithm, the result shows that the proposal can effectively eliminate the curvature mutation point and constrain the path curvature to meet the requirements of a smooth path.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

Proteins are the workhorses of the cell that perform biological functions by interacting with other proteins. Many statistical methods for protein-protein interaction (PPI) have been studied without considering time-dependent changes in networks and the functionalities. I introduced a novel method that models PPI networks as being dynamic in nature and evolving time-varying multivariate distribution with Conditional Random Fields (CRF). This research is directed towards implementing this new combinatorial algorithm on massively parallel architectures such as Graphics Processing Units (GPUs) for efficient computations for large scale bioinformatics datasets. I compared Conditional Random Fields (CRF) and the proposed novel method using CRF combined with the Block Coordinate Descent algorithm for human protein-protein interaction data set. Both are implemented on GPU-Accelerated Computing Architecture and the proposed novel method showed the advantages in predicting protein-protein interaction sites. I also show that the proposed approach is more efficient in 6.13% than standalone CRF++ in predicting protein-protein interaction sites.

In recent times, with the increase of Artificial Neural Network (ANN), deep learning has brought a dramatic twist in the field of machine learning by making it more Artificial Intelligence (AI). Deep learning is used remarkably used in vast ranges of fields because of its diverse range of applications such as surveillance, health, medicine, sports, robotics, drones etc. In deep learning, Convolutional Neural Network (CNN) is at the center of spectacular advances that mixes Artificial Neural Network (ANN) and up to date deep learning strategies. It has been used broadly in pattern recognition, sentence classification, speech recognition, face recognition, text categorization, document analysis, scene, and handwritten digit recognition. The goal of this paper is to observe the variation of accuracies of CNN to classify handwritten digits using various numbers of hidden layer and epochs and to make the comparison between the accuracies. For this performance evaluation of CNN, we performed our experiment using Modified National Institute of Standards and Technology (MNIST) dataset. Further, the network is trained using stochastic gradient descent and the backpropagation algorithm.

This article presents a description of a new method for solving the factorization problem, based on the gradient descent algorithm. This approach demonstrates significant improvements in efficiency compared to traditional methods proposed in previous research. This article describes a new method for solving the factorization problem, based on the gradient descent algorithm, and demonstrates the transition from algebraic methods to approaches based on functional analysis. The proposed approach not only improves the efficiency of solving the problem but also allows the application of computational algorithms of functional analysis, opening new possibilities for research and optimization.

The realization of a BRST cohomology of the 4D topological gauge-affine gravity is established in terms of a superconnection formalism. Identification of fields in the quantized theory is occurred directly as usual in terms of superconnection and its supercurvature components with the double covering of the general affine group GA¯(4,R). Then, by means of an appropriate decomposition of the metalinear double-covering group SL¯(5,R) with respect to the general linear double-covering group GL¯(4,R) one can easily obtain the enlargements of the fields while remaining consistent with the BRST algebra. This leads to the descent equations allowing us to build the observables of the theory by means of the BRST algebra constructed using a sa¯(5,R) algebra-valued superconnection. In particular, we discuss the construction of topological invariants with torsion.

Breast cancer is the most common cause of death for women worldwide. Thus, the ability of artificial intelligence systems to predict and classify breast cancer is very important. In this paper, a hybrid ensemble method classification mechanism is proposed based on a majority voting mechanism. First, the performance of different state-of-the-art machine learning classification algorithms for the Wisconsin Breast Cancer Dataset (WBCD) were evaluated. The three best classifiers were then selected based on their F3 score. F3 score is used to emphasize the importance of false negatives (recall) in breast cancer classification. Then, these three classifiers, simple logistic Regression learning, stochastic gradient descent learning and multilayer perceptron network, are used for ensemble classification using a voting mechanism. We also evaluated the performance of hard and soft voting mechanism. For hard voting, majority-based voting mechanism was used and for soft voting we used average of probabilities, product of probabilities, maximum of probabilities and minimum of probabilities-based voting methods. The hard voting (majority-based voting) mechanism shows better performance with 99.42% as compared to the state-of-the-art algorithm for WBCD.