AUT Journal of Mathematics and Computing
https://ajmc.aut.ac.ir/
AUT Journal of Mathematics and Computingendaily1Wed, 01 Mar 2023 00:00:00 +0330Wed, 01 Mar 2023 00:00:00 +0330On general (α,β)-metrics with Cartan torsion, mean Cartan torsion and Landsberg curvature
https://ajmc.aut.ac.ir/article_4794.html
In this paper, we derive a formula for the (mean) Cartan torsion of a class of general (&alpha;,&beta;)-metrics. Also, we study weak Landsberg general (&alpha;,&beta;)-metrics under a certain condition.Computation of µ-symmetry and µ-conservation law for the Camassa-Holm and Hunter-Saxton equations
https://ajmc.aut.ac.ir/article_4946.html
This work is intended to compute the &micro;-symmetry and &micro;-conservation laws for the Cammasa-Holm (CH) equation and the Hunter-Saxton (HS) equation. In other words, &micro;-symmetry, &micro;-symmetry reduction, variational problem, and &micro;-conservation laws for the CH equation and the HS equation are provided. Since the CH equation and the HS equation are of odd order, they do not admit a variational problem. First we obtain &micro;-conservation laws for both of them in potential form because they admit a variational problem and then using them, we obtain &micro;-conservation laws for the CH equation and the HS equation.On m-th root metrics of isotropic projective Ricci curvature
https://ajmc.aut.ac.ir/article_4984.html
The Ricci curvature is introduced by spray on Mn. Sprays are deformed to projective sprays with a volume form dV on Mn. The projective Ricci curvature is defined as the expression of Ricci curvature with sprays. With this paper, we use the new notion that is called weakly isotropic projective Ricci curvature. We have introduced the idea of weakly isotropic projective Ricci curvature in [3]. Then we study and characterize m-th root metrics of weakly isotropic projective Ricci curvature. We obtain that every m-th root metric of weakly isotropic projective Ricci curvature is projectively Ricci-flat.Biamenability of Banach algebras and its applications
https://ajmc.aut.ac.ir/article_4952.html
In this paper, we introduce the concept of biamenability of Banach algebras and we show that despite the apparent similarities between amenability and biamenability of Banach algebras, they lead to very different, and somewhat opposed, theories. In this regard, we show that commutative Banach algebras and the group algebra L1(G) for each locally compact group G, tend to lack biamenability, while they may be amenable and highly non-commutative Banach algebras such as B(H) for an infinite-dimensional Hilbert space H tend to be biamenable, while they are not amenable. Also, we show that although the unconditional unitization of an amenable Banach algebra is amenable but in general unconditional unitization of a Banach algebra is not biamenable. This concept may be applied for studying the character space of some Banach algebras and also for studying some spansion or density problems.Detecting semi-referees in the Plackett-Luce model
https://ajmc.aut.ac.ir/article_5001.html
In this paper, we use the Plackett-Luce model for detecting some referees judge arbitrariness with inaccuracy or without paying enough attention which is called semi-referees. We will investigate our method by simulation and sample of real data.Predicting content-based political inclinations of Iranian twitter users using BERT and deep learning
https://ajmc.aut.ac.ir/article_5023.html
Along with the advent of social networks such as Twitter; Politicians, social media, and ordinary citizens regularly turn to them to share their thoughts and feelings, such as political views. This article analyzes the political ideology of Iranian Twitter users using deep learning and combining the deep layers of LSTM and CNN with BERT, enabling us to target groups of sympathizers and opponents of the Islamic Republic of Iran that are also of particular interest to political scientists. We trained a model for predicting whether a tweet is a sympathizer or opponent, using a novel dataset from Twitter, including tweets from sympathizers and opponent people. Then, using the trained model, the people's ideology can be identified. The results show that using the proposed model, tweets can be categorized with a 75.68\% F1-Score, and the classification of individuals based on political orientation to a 93.18\% F1-Score can be done correctlyBergman and Dirichlet spaces in the unit ball and symmetric lifting operator
https://ajmc.aut.ac.ir/article_5005.html
Let Bn be the open unit ball in Cn and Bn&times;Bn. The symmetric lifting operator which lifts analytic functions from H(Bn) to H(Bn2) is defined as follow&lrm;&lrm;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;L(f)(z,w) = f(z)-f(w)/z-w.&lrm;&lrm;In this paper we investigate the action of symmetric lifting operator on the Bergman space in the unit ball&lrm;. &lrm;Also&lrm;, &lrm;we state a characterization for Dirichlet space and consider symmetric lifting operator on the Dirichlet space in the unit ball&lrm;.Betterment for estimates of the numerical radii of Hilbert space operators
https://ajmc.aut.ac.ir/article_5016.html
We give several inequalities involving numerical radii $\omega \left( \cdot \right)$ and the usual operator norm $\left\| \cdot \right\|$ of Hilbert space operators. These inequalities lead to a considerable improvement in the well-known inequalities&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &frac12;||T||&le;&omega;(T)&le;||T||A bi-level formulation for a sequential stochastic attacker-defender game via conditional value at risk
https://ajmc.aut.ac.ir/article_4891.html
In this study, we present a bi-level formulation for a sequential stochastic attacker-defender game with multiple targets. In this game, the vulnerability of targets is a stochastic parameter, and the attacker has only one attack type. Thedefender&rsquo;s aim is to find the optimal allocation of the budget to minimize the conditional value at risk of damage. In response to the defender&rsquo;s decisions, the attacker seeks an optimal allocation of its budget to maximize the expected damage. By using Karush-Kuhn-Tucker transformations, we reduce the proposed bi-level formulation to a single-level one. We also explore some important relationships between the solutions of the single-level and bi-level problems. Finally, by means of numerical experiments, we apply our formulation to several stochastic attacker-defender games to show the efficiency of our formulation in practice.The warped generalized Lagrange space and its application in physics
https://ajmc.aut.ac.ir/article_4783.html
In this paper, we define the warped generalized Lagrangian (WGL) spaces and then examine some of their properties. In the following, we generalize the Tavakol-van den Bergh" condition in the theory of relativity (see [9]) in this space, which is an example of the application of the warped generalized Lagrangian spaces in relativity (Theorem 4.6). We show that condition EPS in these spaces holds provided that the warped function f satisfies the condition&nbsp;(e^2f)^i=0.Non-classical symmetry and new exact solutions of the Kudryashov-Sinelshchikov and modified KdV-ZK equations
https://ajmc.aut.ac.ir/article_5010.html
&lrm;In this paper&lrm;, &lrm;by applying the non-classical symmetry method&lrm;, &lrm;non-classical symmetries of the Kodryashov-Sinleschikov (K-S) and&lrm; &lrm;modified Korteweg-de Vries-Zaharov-Kuznetsov (mKdV-ZK) equations are&lrm; &lrm;obtained&lrm;. &lrm;Apart from classical symmetries&lrm;, &lrm;this theory can be&lrm; &lrm;effective in finding a few other solutions for a system of PDEs and&lrm; &lrm;ODEs&lrm;. &lrm;Also&lrm;, &lrm;non-classical symmetries of a system of PDEs can be&lrm; &lrm;applied to reduce the number of independent variables&lrm;. &lrm;By adding the&lrm;&lrm;invariance surface condition to the assumed equations and applying&lrm; &lrm;the classical symmetry method for them&lrm;, &lrm;non-classical symmetries are&lrm; &lrm;calculated&lrm;. &lrm;Finally&lrm;, &lrm;some of the group invariant solutions and the&lrm; &lrm;similarity reduced equations associated to non-classical symmetry&lrm; &lrm;are obtained&lrm;.A new MILP model for vehicle routing-loading problem under fragility, LIFO, and rotation constraints
https://ajmc.aut.ac.ir/article_4876.html
Simultaneous optimization of vehicle routing and loading decisions in three-dimensional case is one of the important problems in logistics and has received great attention from researchers. To the best of our knowledge, optimization models presented in the literature for this problem either are too complicated or do not include important loading assumptions such as item fragility, last-in-first-out arrangement, and the possibility of rotation. To overcome the shortcoming of the existing models, in this paper, we present a novel mixed-integer linear programming (MILP) model which not only involves important loading assumptions, but also does not have the complexity of previous models. Moreover, we provide valid inequalities to strengthen the LP relaxation bound and accelerate the solution process. Further, we show that how a restricted version of our model can be incorporated in loading procedures of meta-heuristic algorithms to improve their efficiency. Computational results over instances, taken from the literature, show the performance of the proposed approach.On binary decision hypertree (hyperdiagram)
https://ajmc.aut.ac.ir/article_5045.html
In computer science, a binary decision diagram is a data structure that is used to represent a Boolean function and to consider a compressed representation of relations. This paper considers the notation of T.B.T (total binary truth table), and introduces a novel concept of binary decision (hyper)tree and binary decision (hyper)diagram, directly and in as little time as possible, unlike previous methods. This study proves that every T.B.T corresponds to a binary decision (hyper)tree via minimum Boolean expression and presents some conditions on any given T.B.T for isomorphic binary decision (hyper)trees. Finally, for faster calculations and more complex functions, we offer an algorithm and so Python programming codes such that for any given T.B.T, it introduces a binary decision (hyper)tree.Classification of gyrogroups of orders at most 31
https://ajmc.aut.ac.ir/article_5063.html
A gyrogroup is defined as having a binary operation &lowast; containing an identity element such that each element has an inverse. Furthermore, for each pair (a,b) of elements of this structure, there exists an automorphism $\gyr{a,b}{}$ with this property that left associativity and left loop property are satisfied. Since each gyrogroup is a left Bol loop, some results of Burn imply that all gyrogroups of orders p, 2p, and p2 are groups. This paper aims to classify gyrogroups of orders 8, 12, 15, 18, 20, 21, and 28.Approximate left φ-biprojectivity of θ-Lau product algebras
https://ajmc.aut.ac.ir/article_4896.html
We continue \cite{sp1 glas} and we discuss approximately left &phi;-biprojectivity for &theta;-Lau product algebras. We give some Banach algebras among the category of &theta;-Lau product algebras which are not approximately left &phi;-biprojective. In fact, some class of matrix algebras under the notion of approximate left &phi;-biprojectivity is also discussed here.On the tree-number of the power graph associated with a finite groups
https://ajmc.aut.ac.ir/article_5064.html
Given a group G, we define the power graph &Rho;(G) as follows: the vertices are the elements of G and two vertices x and y are joined by an edge if &lang;x&rang;&sube;&lang;y&rang; or &lang;y&rang;&sube;&lang;x&rang;. Obviously the power graph of any group is always connected, because the identity element of the group is adjacent to all other vertices. We consider &kappa;(G), the number of spanning trees of the power graph associated with a finite group G. In this paper, for a finite group G, first we represent some properties of P(G), then we are going to find some divisors of &kappa;(G), and finally we prove that the simple group A6&cong;L2(9) is uniquely determined by tree-number of its power graph among all finite simple groups.Unsupervised feature selection by integration of regularized self-representation and sparse coding
https://ajmc.aut.ac.ir/article_5066.html
Due to the development of social networks and the Internet of things, we recently have faced with large datasets. High-dimensional data is mixed with redundant and irrelevant features, so the performance of machine learning methods is reduced. Feature selection is a common way to tackle this issue with aiming of choosing a small subset of relevant and non-redundant features. Most of the existing feature selection works are for supervised applications, which assume that the information of class labels is available. While in many real-world applications, it is not possible to provide complete knowledge of class labels. To overcome this shortcoming, an unsupervised feature selection method is proposed in this paper. The proposed method uses the matrix factorization-based regularized self-representation model to weight features based on their importance. Here, we initialize the weights of features based on the correlation among features. Several experiments are performed to evaluate the effectiveness of the proposed method. Then the results are compared with several baselines and state-of-the-art methods, which show the superiority of the proposed method in most cases.On l-reconstructibility of degree list of graphs
https://ajmc.aut.ac.ir/article_5091.html
The k-deck of a graph is the multiset of its subgraphs induced by k vertices which is denoted by Dk(G). A graph or graph property is l-reconstructible if it is determined by the deck of subgraphs obtained by deleting l vertices. Manval proved that from the (n &minus; l)-deck of a graph and the numbers of vertices with degree i for all i, n&minus;l &le; i &le; n&minus;1, the degree list of the graph is determined. In this paper, we extend this result and prove that if G is a graph on n vertices, then from the (n &minus; l)-deck of G and the numbers of vertices with degree i for all i, n &minus; l &le; i &le; n &minus; 3 where n &ge; l + 6, the degree list of the graph is determined.Generalized η-Ricci solitons on f-Kenmotsu 3-manifolds associated to the Schouten-van Kampen connection
https://ajmc.aut.ac.ir/article_5092.html
In this paper, we investigate f-Kenmotsu 3-dimensional manifolds admitting generalized &eta;-Ricci solitons with respect to the Schouten-van Kampen connection. We provide an example of generalized &eta;-Ricci solitons with respect to the Schouten-van Kampen connection on an f-Kenmotsu 3-dimensional manifold to prove our results.A combined Bernoulli collocation method and imperialist competitive algorithm for optimal control of sediment in the dam reservoirs
https://ajmc.aut.ac.ir/article_5097.html
Reservoir sedimentation increases economic cost and overflow of dam water. An optimal control problem (OCP) with singularly perturbed equations of motion is perused in the ﬁelds of sediment management during a ﬁnite lifespan. Subsequently the OCP is transformed to a nonlinear programming problem by utilizing a collocation approach, and then we employed the imperialist competitive algorithm to improve the execution time and decision. So, the solutions of the optimal control and fast state as well as the maximization of net present value of dam operations are obtained. An illustrative practical study demonstrated that sedimentation management is economically favourable for volume of confined water and total amount in remaining storage and effectiveness of the propounded approach.Simulating mixture of sub-Gaussian spatial data
https://ajmc.aut.ac.ir/article_5104.html
Spatial datasets may contain extreme values and exhibit heavy tails. So, the Gaussianity assumption for the corresponding random field is not reasonable. A sub-Gaussian &alpha;-stable (SG&alpha;S) random field may be more suitable as a model for heavy-tailed spatial data in these cases. This paper focuses on geostatistical data and presents an algorithm for simulating SG&alpha;S random fields.Difference potentials method based on LOD splitting technique for nonlinear convection–diffusion equations with interfaces
https://ajmc.aut.ac.ir/article_5105.html
In this paper, we construct a difference potentials method (DPM) based on the locally one-dimensional (LOD) technique to solve the two-dimensional nonlinear convection-diffusion interface problems. The advantage of using the LOD scheme is that the linear system resulting from the auxiliary problem has a simpler structure and can be solved efficiently and accurately with less central processor (CPU) time. Numerical results validate the robustness, accuracy, and efficiency of the proposed method.Generalized Ricci solitons on homogeneous Siklos space-times
https://ajmc.aut.ac.ir/article_5106.html
The class of homogeneous Siklos space-times is considered from algebraic point of view and the generalized Ricci solitons are completely classified.Adverse drug reaction prediction using voting ensemble training approach
https://ajmc.aut.ac.ir/article_5122.html
Identifying and controlling adverse drug reactions (ADRs) is a challenging problem in the pharmacological field. For instance, the drug Rosiglitazone has been associated with adverse reactions that were only recognized after its release.Due to such experiences, pharmacists are now more interested in using computational methods to predict ADRs. The performance of computational methods is contingent upon the defined dataset. In some studies, the known drug-adverse reaction associations are regarded as positive while the unknown drug-adverse reaction associations are regarded as negative data. This consequently creates an unbalanced dataset, which can lead to inaccurate predictions from models and cause the classifiers to be flawed. We propose a framework named Adverse Drug Reaction using the Voting Ensemble Training Approach (ADRP-VETA) for ADR problem to overcome unbalanced dataset challenges. We construct the similarity vector of each drug with other drugs based on chemical structure as a drug feature. Also, the similarity vector of each ADR with other ADRs is computed based on the Unified Medical Language System (UMLS) as adverse reaction feature. With this approach, we can leverage the similarity of the features to more accurately capture the intricate relationships between drugs and adverse reactions. We compare ADRP-VETA to three state-of-the-art models and find that it outperforms them, achieving an AUC-ROC of 91% and an AUC-PR of 89.8%. Furthermore, we assess ADRP-VETA&rsquo;s ability to predict rare adverse reactions, and find that its AUC-ROC and AUC-PR are 83.3% and 92.2%, respectively. As a case study, we focus on the associations between liver-injury adverse reactions and three drugs.The novel Self-Organizing Map combined with Fuzzy C-Means and K-means convolution for a soft and hard natural digital image segmentation
https://ajmc.aut.ac.ir/article_5127.html
Digital image segmentation plays an important role in noise reduction and pixel clustering for pre-processing of deep learning or feature extraction. The classic Self-Organizing Map (SOM) algorithm is a well-known unsupervised clustering neural network model. This classic method works on continuous data instead of discrete data sets with a widely scattered distribution. The novel SOM(SOM2) modelling solved this problem for the classic, simple tabular discrete data set but not for the digital image data. As the essence of digital image pixels data are different from tabular datasets, we have to look at them differently. This paper proposes exploiting the novel SOM method with a hybrid combination of the fuzzy C-Means and K-means convolution filter as image segmentation and noise reduction with soft and hard segmentation as entropy reduction for natural digital images. The main approach of this paper is the segmentation of image contents for the reduction of noises and saturation pixels by entropy criteria. Based on the resulting paper, the combination of SOM2 with FCM for soft segmentation 47%-and the combination of SOM2 with k-means convolution for hard segmentation 33% can reduce the entropy of the original image on average.A modification of Hardy-Littlewood maximal-function on Lie groups
https://ajmc.aut.ac.ir/article_5157.html
For a real-valued function f on a metric measure space (X,d,&mu;) the Hardy-Littlewood centered-ball maximal-function of f is given by the following `supremum-norm':
$$Mf(x):=\sup_{r&gt;0}\frac{1}{\mu(\mathcal{B}_{x,r})}\int_{\mathcal{B}_{x,r}}|f|d\mu.$$
In this note, we replace the supremum-norm on parameters r by Lp-norm with weight &omega;&nbsp;on parameters r and define Hardy-Littlewood integral-function Ip,&omega; f. It is shown that Ip,&omega; f converges pointwise to Mf as p&rarr;&infin;. Boundedness of the sublinear operator Ip,&omega; and continuity of the function Ip,&omega; f in case that X is a Lie group, d is a left-invariant metric, and &mu; is a left Haar-measure (resp. right Haar-measure) are studied.On biprojectivity and Connes biprojectivity of a dual Banach algebra with respect to a $w^{*}$-closed ideal
https://ajmc.aut.ac.ir/article_5164.html
In this paper, we introduce a notion of Connes biprojectivity for a dual Banach algebra A with respect to its &omega;*-closed ideal I, say I-Connes biprojectivity. Some matrix algebras and Banach sequence algebras are studied under this new notion. Also with some mild assumptions, the relation between I-Connes biprojectivity and left &phi;-contractibility is given, where &phi; is a &omega;*-continuous multiplicative linear functional on A. As an application, we characterize Connes biprojectivity of some Lipschitz algebras.Existence and convergence of fixed point results for noncyclic φ-contractions
https://ajmc.aut.ac.ir/article_5171.html
In the paper, we introduce a new class of noncyclic &phi;-contractions as a generalization of the class of noncyclic contractions which was first introduced in the paper [R. Esp&iacute;nola, M. Gabeleh, On the structure of minimal sets of relatively nonexpansive mappings, Numerical Functional Analysis and Optimization 34 (8), 845-860, 2013] and study the existence, uniqueness and convergence of a fixed point for such class of noncyclic mapping in the framework of uniformly convex Banach spaces. We obtain existence results of the best proximity points for cyclic &phi;-contractions as a consequence of our main theorems.Text steganography by changing the black color
https://ajmc.aut.ac.ir/article_5177.html
Recently, a serious problem in communications is security. Hiding data is one of the most important security techniques. Steganography is the art and science of hiding information in a cover media. Texts are the most usual method of communication and so they are very suitable for cover objects. In this paper, we give a new technique for text steganography. There exist different models, such as RGB, HSL, HSV to determine a color. The main goal of the proposed algorithm is the fact that some different but very similar colors in RGB have the same code in HSL. We use this fact to hide data. For this purpose, first we find a color $B'$ in RGB, which is very similar to black in such a way that they have the same code in HSL. Then, by changing the color of each character of the text to black or $B'$, we conceal the information. We will show that the capacity of this method is better than some other methods of text steganography, and then we show that the invisibility of this algorithm is very high, which is the most prominent feature of the proposed technique.On a group of the form 2^11:M_24
https://ajmc.aut.ac.ir/article_5189.html
The Conway Group Co1 is one of the 26 sporadic simple groups. It is the largest of the three Conway groups with order 4157776806543360000=221.39.54.72.11.13.23 and has 22 conjugacy classes of maximal subgroups. In this paper, we discuss a group of the form G&oline;=N:G, where N=211 and G=M24. This group G&oline;=N:G=211:M24 is a split extension of an elementary abelian group N=211 by a Mathieu group G=M24. Using the computed Fischer matrices for each class representative g of G and ordinary character tables of the inertia factor groups of G, we obtain the full character table of G&oline;. The complete fusion of G&oline; into its mother group Co1 is also determined using the permutation character of Co1.&nbsp;Almost Ricci soliton in Q^{m^∗}
https://ajmc.aut.ac.ir/article_5190.html
In this paper, we will focus our attention on the structure of h-almost Ricci solitons on complex hyperbolic quadric. We will prove non-existence a contact real hypersurface in the complex hyperbolic quadric Qm*, m&ge;3, admitting the gradient almost Ricci soliton. Moreover, the gradient almost Ricci soliton function f is trivial.&nbsp;Generalized Lorentz Ricci solitons on 3-dimensional Lie groups associated to Bott Connection
https://ajmc.aut.ac.ir/article_5195.html
&lrm;In this paper&lrm;, &lrm;we investigate which one of the non-isometric left-invariant Lorentz metrics g&lrm; &lrm;on 3-dimensional Lie groups satisfies the generalized Ricci soliton equation&lrm; &lrm;a RicB[g]&lrm; + b/2 LXB g&lrm; +&lrm;cXb&otimes;Xb = &lambda;g associated to the Bott connection &nabla;B&lrm;, &lrm;here X is a vector field and &lambda;&lrm;, &lrm;a&lrm;, &lrm;b&lrm;, &lrm;c are real constants and c&ne;0&lrm;. &lrm;A complete classification of this structure on 3-dimensional Lorentzian Lie groups will be presented&lrm;.Variational problem, Lagrangian and µ-conservation law of the generalized Rosenau-type equation
https://ajmc.aut.ac.ir/article_5197.html
The goal of this article is to compute conservation law, Lagrangian and &micro;-conservation law of the generalized Rosenau-type equation using the homotopy operator, the &micro;-symmetry method and the variational problem method. The generalized Rosenau-type equation includes the generalized Rosenau equation, the generalized Rosenau-RLW equation and the generalized Rosenau-KdV equation, which admits the third-order Lagrangian. The article also compares the conservation law and the &micro;-conservation law of these three equation.Strong domination number of a modified graph
https://ajmc.aut.ac.ir/article_5207.html
Let G=(V,E) be a simple graph. A set D&sube;V is a strong dominating set of G, if for every vertex x&isin;V\D there is a vertex y&isin;D with xy&isin;E(G) and deg(x)&le;deg(y). The strong domination number &gamma;st(G)&nbsp;is defined as the minimum cardinality of a strong dominating set. In this paper, we study the effects on &gamma;st(G) when G is modified by operations on vertices and edges of G.Composition operators from Zygmund spaces into Besov Zygmund-type spaces
https://ajmc.aut.ac.ir/article_5211.html
&lrm;In this paper first&lrm;, &lrm;the boundedness and compactness of a composition operator from Zygmund space to Besov Zygmund-type space are studied&lrm;. &lrm;Then we study this concepts for this operator by using the hyperbolic-type analytic Besov Zygmund-type class&lrm;. &lrm;Finally&lrm;, &lrm;we show the relation between the hyperbolic-type analytic Besov Zygmund-type class and the meromorphic (or spherical) Besov Zygmund-type class&lrm;.Lipschitzness effect of a loss function on generalization performance of deep neural networks trained by Adam and AdamW optimizers
https://ajmc.aut.ac.ir/article_5213.html
The generalization performance of deep neural networks with regard to the optimization algorithm is one of the major concerns in machine learning. This performance can be affected by various factors. In this paper, we theoretically prove that the Lipschitz constant of a loss function is an important factor to diminish the generalization error of the output model obtained by Adam or AdamW. The results can be used as a guideline for choosing the loss function when the optimization algorithm is Adam or AdamW. In addition, to evaluate the theoretical bound in a practical setting, we choose the human age estimation problem in computer vision. For assessing the generalization better, the training and test datasets are drawn from different distributions. Our experimental evaluation shows that the loss function with a lower Lipschitz constant and maximum value improves the generalization of the model trained by Adam or AdamW.Driver cellphone usage detection using wavelet scattering and convolutional neural networks
https://ajmc.aut.ac.ir/article_5229.html
This paper provides an automated system based on machine learning and computer vision to detect cellphone usage during driving. We used Wavelet Scattering Networks, which is a simple and efficient type of architecture. The presented model is straightforward and compact and requires little hyper-parameter tuning. The speed of this model is similar to the Convolutional Neural Networks. We monitored the driver from two viewpoints: a frontal view of the driver&rsquo;s face and a side view of the driver&rsquo;s whole body. We created a new dataset for the first viewpoint, and used a publicly available dataset for the second viewpoint. Our model achieved the test accuracy of 91% for our new dataset and 99% for the publicly available one.A survey on usage of smartphone accelerometer sensor in intelligent transportation systems
https://ajmc.aut.ac.ir/article_5238.html
The numerous capabilities of smartphones have made them suitable alternative to expensive tools and methods in intelligent transportation systems. This study surveys the literature on the role of the accelerometer of smartphones in intelligent transportation applications. At first, the opportunities and challenges of using the accelerometer are stated. Then, the architecture of using this sensor including preprocessing, feature extraction, mode detection, reorientation and applications are explained. Finally, different applications that have used the accelerometer of mobile phones in the intelligent transportation systems have been investigated.Interpolatory four-parametric adaptive method with memory for solving nonlinear equations
https://ajmc.aut.ac.ir/article_5248.html
The adaptive technique enables us to achieve the highest efficiency index theoretically and practically. The idea of introducing an adaptive self-accelerator (via all the old infor-mation for Steffensen-type methods) is new and efficient to obtain the highest efficiency index.In this work,we have used four self-accelerating parameters and have increased the order of convergence from 8 to 16.I.e.any new function evaluations the convergence order improve up to 100%. The numerical results are compared without and with memorymethods and confirm that the proposed methods have more efficiency index than other methods.