<abstract><title style='display:none'>Abstract</title> The bandwidth, average bandwidth, envelope, profile and antibandwidth of the matrices have been the subjects of study for at least 45 years. These problems have generated considerable interest over the years because of them practical relevance in areas like: solving the system of equations, finite element methods, circuit design, hypertext layout, chemical kinetics, numerical geophysics etc. In this paper a brief description of these problems are made in terms of their definitions, followed by a comparative study of them, using both approaches: matrix geometry and graph theory. Time evolution of the corresponding algorithms as well as a short description of them are made. The work also contains concrete real applications for which a large part of presented algorithms were developed. </abstract>

The Bandwidths of a Matrix. A Survey of Algorithms

<abstract><title style='display:none'>Abstract</title> We present two computational approaches for the purpose of point compression and decompression on Edwards curves over the finite field Fp where p is an odd prime. The proposed algorithms allow compression and decompression for the x or y affine coordinates. We also present a x-coordinate recovery algorithm that can be used at any stage of a differential addition chain during the scalar multiplication of a point on the Edwards curve. </abstract>

Point Compression and Coordinate Recovery for Edwards Curves over Finite Field

<abstract><title style='display:none'>Abstract</title> In recent years significant work has been done to use Neural Networks in game AI, and harness the advantages of such a technique. This paper would like to show that it is possible using neuroevolution to evolve a neural network topology optimized for a given task and avoiding over or under complexification by human hands. In order to illustrate this we implement two agents capable of playing simple zero sum perfect information games with the help of the genetic algorithm Neuroevolution of augmenting topologies. To illustrate this optimization we load the resulting topologies onto an Android OS game app. </abstract>

Neuro-evolution in Zero-Sum Perfect Information Games on the Android OS

<abstract><title style='display:none'>Abstract</title> In this paper, we classify two types ruled surfaces in the three dimensional simply isotropic space I13 under the condition ∆xi= λixi where ∆ is the Laplace operator with respect to the first fundamental form and λ is a real number. We also give explicit forms of these surfaces. </abstract>

Classification of Some Special Types Ruled Surfaces in Simply Isotropic 3-Space

<abstract><title style='display:none'>Abstract</title> In this work, we are interested in a class of problems of great importance in many areas of industry and engineering. It is the invese problem for the biharmonic equation. It consists to complete the missing data on the inaccessible part from the measured data on the accessible part of the boundary. To solve this ill-posed problem, we opted for the alternative iterative method developed by Kozlov, Mazya and Fomin which is a convergent method for the elliptical Cauchy problems in general. The numerical implementation of the iterative algorithm is based on the application of the boundary element method (BEM) for a sequence of mixed well-posed direct problems. Numerical results are performed for a square domain showing the effectiveness of the algorithm by BEM to produce accurate and stable numerical results.</abstract>

Iterative Method to Solve a Data Completion Problem for Biharmonic Equation for Rectangular Domain

<abstract><title style='display:none'>Abstract</title> Let G = (V,E) be a simple connected molecular graph. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by V = V (G) and E = E(G), respectively. If d(u, ν) be the notation of distance between vertices u, ν ∈ V and is defined as the length of a shortest path connecting them. Then, Eccentricity connectivity polynomial of a molecular graph G is defined as ECP(G, x) = ∑ν∈V dG(ν)xecc(ν), where ecc(ν) is defined as the length of a maximal path connecting to another vertex of v. dG(ν) (or simply dv) is degree of a vertex ν ∈ V (G), and is defined as the number of adjacent vertices with v. In this paper, we focus on the structure of molecular graph circumcoronene series of benzenoid Hk (k ≥ 2) and counting the eccentricity connectivity polynomial ECP(Hk) and eccentricity connectivity index ξ(Hk), by new method (called Ring-cut Method). </abstract>

Computing Eccentricity Connectivity Polynomial of Circumcoronene Series of Benzenoid Hk by Ring-Cut Method

<abstract>
<title style='display:none'>Abstract</title>
This paper discusses the global convergence of successive approximations methods for solving integro-differential equation via resolvent operators in Banach spaces. We prove a theorem on the global convergence of successive approximations to the unique solution of the problems. An example is given to show the application of our result.
</abstract>

Existence and Successive Approximations of Mild Solution for Integro-differential Equations in Banach Spaces

<abstract>
<title style='display:none'>Abstract</title>
The aim of this paper is to give sufficient conditions for Ψ − conditional asymptotic stability of the Ψ − bounded solutions of a nonlinear Lyapunov matrix differential equation with integral term as right side.
</abstract>

On the Ψ − Conditional Asymptotic Stability of a Nonlinear Lyapunov Matrix Differential Equation with Integral Term as Right Side

<abstract>
<title style='display:none'>Abstract</title>
The assembly of billions of short sequencing reads into a contiguous genome is a daunting task. The foundation knowledge of current DNA assembly models is concentrated among a select group, where the solution to the genome assembly challenge lies in proper ordering the genomic data. This contribution’s objective is to provide an overview of the original graph models used in DNA sequencing by hybridization. With the updated analytical approach based on the bidirectional bipartite graph class, the theoretical basic structure of the DNA assembly model has been described in new perspective by incorporating few short hypothetical DNA sequences. On the Galaxy platform, by using Spades assembler and Velvet assembler, the comparative outcomes of an experiment are presented, and we also identify their working schemes. Here, the working principle of de Bruijn graph has been discussed in broader point of view.
</abstract>

A Study of Computational Genome Assembly by Graph Theory

<abstract>
<title style='display:none'>Abstract</title>
Along this paper, we study an evolution inclusion governed by the so-called sweeping process. The right side of the inclusion contains a set-valued perturbation, supposed to be the external forces exercised on the system. We prove existence and relaxation results under weak assumptions on the perturbation by taking a truncated Lipschitz condition. These perturbations have non-convex and unbounded values without any compactness condition; we just assume a linear growth assumption on the element of minimal norm. The approach is based on the construction of approximate solutions. The relaxation is obtained by proving the density of the solution set of the original problem in a closure of the solution set of the relaxed one.
</abstract>

Non-convex perturbation to evolution problems involving Moreau’s sweeping process

<abstract>
<title style='display:none'>Abstract</title>
The paper studies a Cournot game involving <italic>n</italic> private firms, where the firms’ interactions are analyzed in a discrete-time setting with time delay. The past production levels of other private firms have an impact on the production levels of each private firm. We performed a local stability analysis on the nonlinear system associated with the model and found that it has only one equilibrium point, which is asymptotically stable if and only if some conditions involving the number of firms, the degree of product di erentiation and the time delay are fulfilled. In addition, numerical examples are presented in this paper, which illustrate the theoretical results obtained.
</abstract>

Stability properties of a Cournot-type oligopoly model with time delay

<abstract>
<title style='display:none'>Abstract</title>
This paper deals with the existence and uniqueness of common fixed points in metric and dislocated metric spaces. In addition, an application and some illustrative examples are given in order to justify the validity and credibility of our results, also, their superiority over some similar theorems existing in unique common fixed points theory’s domain.
</abstract>

Fixed Point Results in Incomplete Metric and Dislocated Metric Spaces

Open Access License

Instructions for Authors

Guidelines for Reviewers

Template

Annals of West University of Timisoara - Mathematics and Computer Science

The Journal of West University of Timisoara

 Annals of West University of Timisoara - Mathematics and Computer Science, first issued in 1963, publishes peer-reviewed original and quality papers in all branches of Mathematics and...

 Annals of West University of Timisoara - Mathematics and Computer Science, first issued in 1963, publishes peer-reviewed original and quality...