Algorithms - Science topic

In general, the system of 2nd-order partial differential equations made of the Euler–Lagrange equations of classical field theories are not compatible for singular Lagrangians. This is the so-called second-order problem . The first aim of this work is to develop a fully geometric constraint algorithm which allows us to find a submanifold where the...

In this chapter, we consider constant-time algorithms for continuous optimization problems. Specifically, we consider quadratic function minimization and tensor decomposition, both of which have numerous applications in machine learning and data mining. The key component in our analysis is graph limit theory , which was originally developed to stud...

Motivated by evacuation planning, several problems regarding dynamic flow networks have been studied in recent years. A dynamic flow network consists of an undirected graph with positive edge lengths, positive edge capacities, and positive vertex weights. The road network in an area can be treated as a graph where the edge lengths are the distances...

This chapter details MPC algorithms for processes described by state-space Wiener models. At first, the simple MPC method based on the inverse static model is recalled and the rudimentary MPC-NO algorithm is described. Next, the computationally efficient MPC methods with on-line model linearisation are characterised: the MPC-SSL and the MPC-NPSL on...

This chapter takes stock through a literature review of the knowledge accumulated so far on employment relations within app-based food delivery. It argues that food delivery platforms are facing increasing pressure from various actors exposing their (economic) vulnerability in labour and product markets. The organisational work model of food delive...

This Chapter thoroughly discusses implementation details and simulation results of various MPC algorithms introduced in the previous Chapter applied to state-space benchmark processes. One SISO process and two MIMO ones are considered: the first MIMO benchmark has two inputs and two outputs, the second one has as many as ten inputs and two outputs....

This Chapter details MPC algorithms for processes described by input-output Wiener models. At first, the simple MPC-inv method based on the inverse static model is recalled. The rudimentary MPC algorithm with Nonlinear Optimisation (MPC-NO) repeated at each sampling instant is described. Next, two computationally efficient MPC methods with on-line...

This Chapter thoroughly discusses implementation details and simulation results of various MPC algorithms introduced in the previous Chapter applied to input-output benchmark processes. Two SISO processes are considered, the second one has complex dynamics and Laguerre parameterisation turns out to be beneficial. Next, three MIMO benchmarks are con...

Packing and covering semidefinite programs (SDPs) appear in natural relaxations of many combinatorial optimization problems as well as a number of other applications. Recently, several techniques have been proposed that utilize the particular structure of this class of problems in order to obtain more efficient algorithms than those offered by gene...

By reformulating and extending results of Elkies, we prove some results on \({{\mathbb {Q}}}\)-curves over number fields of odd degree. We show that, over such fields, the only prime isogeny degrees \(\ell \) that a \({{\mathbb {Q}}}\)-curve without CM may have are those degrees that are already possible over \({{\mathbb {Q}}}\) itself (in particul...

Full description at https://www.mdpi.com/journal/sensors/special_issues/ANA

Wu & Tsai’s one directional pixel value differencing (PVD), and Khodaei & Faez’s two directional PVD are detected by one directional pixel difference histogram (PDH) analysis. Researchers proposed three directional PVD using 2 × 2 size blocks, five directional PVD using 2 × 3 or 3 × 2 size pixel blocks, and 8 directional PVD utilizing 3 × 3 size pi...

Two-grid methods are popular and efficient discretization techniques for solving nonlinear problems. In this paper, we propose a new two-grid binary level set method for eigenvalue optimization. An efficient yet effective two-grid finite element method is used to solve the nonlinear eigenvalue problem in two topology optimization models. By the bin...

Let H be a real Hilbert space. Let $F:H\rightarrow 2^{H}$ F : H → 2 H and $K:H\rightarrow 2^{H}$ K : H → 2 H be two maximal monotone and bounded operators. Suppose the Hammerstein inclusion $0\in u+KFu$ 0 ∈ u + K F u has a solution. We construct an inertial-type algorithm and show its strong convergence to a solution of the inclusion. As far as we...

This paper analyzes the key issues of resource integration, and proposes a method for solving the problem of achieving efficient resource integration for convenience service platforms that adopt dynamic service modes. This method considers both the service level of collaborative resources under dynamic service modes, and collaborative resources’ sa...

Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic queries when the number of triangles on any edge in the graph is polylogarithmically bounded. Our query oracle Tr...

Biconvex programming is nonconvex optimization describing many practical problems. The existing research shows that the difficulty in solving biconvex programming makes it a very valuable subject to find new theories and solution methods. This paper first obtains two important theoretical results about partial optimum of biconvex programming by the...

Given a finite set of primes S and an m-tuple (a1,…,am)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(a_1,\ldots ,a_m)$$\end{document} of positive, distinct integers...

In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually. The key tool in the development of this framework is the notion of the “strengthening” of a set-valued operator, which can be viewed as a type of regularisation that pre...

In the sequel, we outline necessary and sufficient condition to the existence of extremas of a function on a self-similar set, and we describe discrete gradient algorithm to find the extrema.

We extend the theory of tautological classes on moduli spaces of stable curves to the more general setting of moduli spaces of admissible Galois covers of curves, introducing the so-called $${\mathcal {H}}$$ H -tautological ring. The main new feature is the existence of restriction-corestriction morphisms remembering intermediate quotients of Galoi...

Banjac et al. (J Optim Theory Appl 183(2):490–519, 2019) recently showed that the Douglas–Rachford algorithm provides certificates of infeasibility for a class of convex optimization problems. In particular, they showed that the difference between consecutive iterates generated by the algorithm converges to certificates of primal and dual strong in...

We present algorithms based on answer set programming (ASP) encodings for solving the problem of determining inconsistency degrees in propositional knowledge bases. For that, we consider the contension inconsistency measure, the forgetting-based inconsistency measure, and the hitting set inconsistency measure. Our experimental evaluation shows that...

In this paper, we propose and analyze a second-order decoupled algorithm with different subdomain time steps for the non-stationary Stokes/Darcy model. It is based on the second-order spectral deferred correction method in time and the finite element method in space. We provide the stability and convergence results of our decoupled scheme. Last, so...

We apply the t-linearization technique to the maximum diversity problem (MDP) and compare its performance with other well-known linearizations. We lift the t-constraints based on the cardinality restriction, derive valid inequalities for MDP, and show their usefulness to solve the problem within the t-linearization framework. We propose and computa...

This paper presents two new bidirectional heuristic search algorithms for solving the shortest path problem on graphs: consistent-heuristic bucket-based bidirectional search (CBBS) and front-to-front GPU bidirectional search (FFGBS). CBBS uses a consistent heuristic and groups nodes into buckets that organize nodes based on estimated path cost and...

In this paper, we provide a new application of the Douglas–Rachford splitting method for finding a zero of the sum of two maximal monotone operators where one of them depends implicitly on the state variable. Our proposed algorithms are much simpler with better rate of convergence than existing results and can be implemented under general condition...

We refine necessary and sufficient conditions for the generating series of a weighted model of a quarter plane walk to be differentially algebraic. In addition, we give algorithms based on the theory of Mordell–Weil lattices, that, for each weighted model, yield polynomial conditions on the weights determining this property of the associated genera...

We construct an algorithm for the reduction of a regular matrix pencil to the canonical form.

We propose a variance reduced algorithm for solving monotone variational inequalities. Without assuming strong monotonicity, cocoercivity, or boundedness of the domain, we prove almost sure convergence of the iterates generated by the algorithm to a solution. In the monotone case, the ergodic average converges with the optimal O (1/ k ) rate of con...

We introduce the class of enriched Chatterjea contractions, obtain fixed point theorems and prove a convergence theorem for the Krasnoselskij iteration used to approximate fixed points of enriched Chatterjea mappings in Banach spaces. Then we further extend these mappings to the class of enriched Chatterjea type mappings. Examples to illustrate the...

The class of reduction-based algorithms was introduced recently as a new approach towards creative telescoping. Starting with Hermite reduction of rational functions, various reductions have been introduced for increasingly large classes of holonomic functions. In this paper we show how to construct reductions for general holonomic functions, in th...

We present algorithms for testing if a (0,1)-matrix M has Boolean/binary rank at most d, or is 𝜖-far from having Boolean/binary rank at most d (i.e., at least an 𝜖-fraction of the entries in M must be modified so that it has rank at most d). For the Boolean rank we present a non-adaptive testing algorithm whose query complexity is \(\tilde {O}\left...

We introduce an algorithm based on posets and tiled orders to generate emerging images. Experimental results allow concluding that images obtained with these kinds of tools are easy to detect by human beings. It is worth pointing out that the emergence phenomenon is a Gestalt grouping law associated with AI open problems. For this reason, emerging...

When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for almost 60 years. The main result of this paper proves that if it is decidable for a finite semigroup or finite aut...

The quickest contraflow in a single-source-single-sink network is a dynamic flow that minimizes the time horizon of a given flow value at the source to be sent to the sink allowing arc reversals. Because of the arc reversals, for a sufficiently large value of the flow, the residual capacity of all or most of the paths towards the source, from a giv...

Report topic: Research on SOC estimation of Lithium-ion battery based on Particle Filtering algorithm Reporter: Liang Yawen Report time: 21:00-21:10 Oct 20，2021 (Beijing time) Venue: Tencent conference Meeting link: https://meeting.tencent.com/dm/q9EeWzuz8Eb3 Meeting number: 692 1749 2131 Members of the ministerial organizations are requested to at...

We give a proof of the convergence of an algorithm for the construction of lower dimensional elliptic tori in nearly integrable Hamiltonian systems. The existence of such invariant tori is proved by leading the Hamiltonian to a suitable normal form. In particular, we adapt the procedure described in a previous work by Giorgilli and co-workers, wher...

SNHC (Synthetic Natural Hybrid Coding) je podskupinou MPEG-4, ktorá sa špecializuje na kódovanie grafických modelov reálnych alebo virtuálnych 3R objektov. Štandardizácia tohoto kódovania rozširuje rozsah pôvodných aplikácií MPEG-4, pretože umožňuje kombinovať reálne a syntetické objekty vo virtuálnom prostredi. Takýmto 3R objektom je aj reálna ľud...

Persistent pain after spinal surgery can be successfully addressed by spinal cord stimulation (SCS). International guidelines strongly recommend that a lead trial be performed before any permanent implantation. Recent clinical data highlight some major limitations of this approach. First, it appears that patient outco mes, with or without lead tria...

In this paper, a second-order hyperbolic equation is solved by a two-grid algorithm combined with the expanded mixed finite element method. The error estimate of the expanded mixed finite element method with discrete-time scheme is demonstrated. Moreover, we present a two-grid method and analyze its convergence. It is shown that the algorithm can a...

We study a fair allocation problem of indivisible items under additive externalities in which each agent also receives values from items that are assigned to other agents. We propose several new fairness concepts. We extend the well-studied envy-freeness up to one item (EF1) and envy-freeness up to any item (EFX) to this setting, and we propose a n...

This article describes the optimization of processing parameters for the surface roughness of AISI316 austenitic stainless steel. While experimenting, parameters in the process like feed rate (fd), speed (vc), and depth of cut (DoC) were used to study the outcome on the surface roughness (Ra) of the workpiece. The experiment was carried out using t...

Report topic: The ABP-UKF algorithm based on the second-order RC model to estimate the state of charge of lithium-ion batteries Reporter: Wang Yangtao Report time: 21:00-21:10 Oct 18，2021 (Beijing time) Venue: Tencent conference Meeting link: https://meeting.tencent.com/dm/q9EeWzuz8Eb3 Meeting number: 692 1749 2131 Members of the ministerial organi...

We develop an adaptive algorithm for large SDE systems, which automatically selects (quasi-)deterministic time steps for the semi-implicit Euler method, based on an a posteriori weak error estimate. Main tools to construct the a posteriori estimator are the representation of the weak approximation error via Kolmogorov’s backward equation, a priori...

Lifted inference allows to perform inference in polynomial time w.r.t. domain sizes. For a lifted algorithm, completeness investigates model classes for which the algorithm is guaranteed to compute a lifted solution. We contribute, to the best of our knowledge, the first completeness and complexity analysis for a temporal lifted algorithm, the so-c...

We study the problem of fair and efficient allocation of a set of indivisible chores to agents with additive cost functions. We consider the popular fairness notion of envy-freeness up to one good (EF1) with the efficiency notion of Pareto-optimality (PO). While it is known that an EF1+PO allocation exists and can be computed in pseudo-polynomial t...

Familiar coding-based tools are compared as golden hammers alongside domain-specific languages. The tool-based approach is extended to include a golden cheater bar. Flexibility and optimization are compared as problem solving techniques. The difference between algorithms, heuristics, and metaheuristics is discussed. Simulation and its various types...

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining non-zero solutions of systems of homogeneous polynomials, which we present from a modern algebro-geometric per...

The paper studies the progressive decoupling algorithm (PDA) of Rockafellar and focuses on the elicited version of the algorithm. Based on a generalized Yosida-regularization of Spingarn's partial inverse of an elicitable operator, it is shown that the elicited progressive decoupling algorithm (EPDA), in a particular nonmonotone setting, linearly c...

Presento un algoritmo que define una función generadora de secuencias eventualmente periódicas, con los valores del ciclo elegibles y empezadas con cualquier número entero.

We consider a number of parallel-machine scheduling problems in which jobs have variable processing times. The actual processing time of each job is described by an arbitrary positive function of the position it holds on a machine. However, the function itself may additionally depend on the job or a machine this job was assigned to. Our aim is to f...

In the following paper we introduce new adaptive algorithms endowed with momentum terms for stochastic non-convex optimization problems. We investigate the almost sure convergence to stationary points, along with a finite-time horizon analysis with respect to a chosen final iteration, and we also inspect the worst-case iteration complexity. An esti...

Niu Yitong, Белорусcко-Российский университет, Могилев, Республика Беларусь. Аннотация: Приведены преимущества использования солнечной энергии. Представлены формулы расчета азимутальных и высотных углов Солнца. Выбраны формулы для расчета солнечного экваториального хвостового угла и разницы во времени Солнца. Ключевые слова: солнечная энергия, азим...

This article presents the results obtained by an interdisciplinary research team including researchers from the field of engineering and specialists in epigraphic studies. The digital treatment methodology shown is based on image processing algorithms and has been developed in the visible spectral range (400nm-700nm).

This article is devoted to the features that were under development between RoboCup 2019 Sydney and RoboCup 2021 Worldwide. These features include vision-related matters, such as detection and localization, mechanical and algorithmic novelties. Since the competition was held virtually, the simulation-specific features are also considered in the art...

This paper highlights a practical research of the possibility of forming quantum circuits for training neural networks. The demonstrated quantum circuits were based on the principles of Grover's Search Algorithm. The perceptron was chosen as the architecture for the example neural network. The multilayer perceptron is a popular neural network archi...

QUEUES OCCUR WHENEVER THE DEMAND FOR A SERVICE EXCEEDS THE SERVICE CAPACITY AT SOME POINT. THE QUEUEING THEORY AREA IS CONCERNED WITH QUEUEING MODELS, WHICH ARE VERY REASONABLE APPROXIMATIONS FOR REAL SITUATIONS. A VERY IMPORTANT ASPECT IN QUEUEING THEORY IS THEIR COMPUTATIONAL SIMULATION. THIS ARTICLE DEALS WITH THE PRESENTATION OF AN ALGORITHM F...

We propose a variant of an algorithm introduced by Schewe and also studied by Luttenberger for solving parity or mean-payoff games. We present it over energy games and call our variant the ESL algorithm (for Energy-Schewe-Luttenberger). We find that using potential reductions as introduced by Gurvich, Karzanov and Khachiyan allows for a simple and...

In this paper, we establish the convergence theorems for two projection algorithms for finding a null point of the sum of two monotone operators in Hilbert spaces. Our algorithms are the combination of the inertial forward-backward with the shrinking of hybrid projection methods. To clarify the acceleration, effectiveness, and performance of propos...

Multi-objective optimization (MOO) aims at finding a set of optimal configurations for a given set of objectives. A recent line of work applies MOO methods to the typical Machine Learning (ML) setting, which becomes multi-objective if a model should optimize more than one objective, for instance in fair machine learning. These works also use Multi-...

The cultivation of strategic emerging industries is strategic to the economic transformation and upgrading in Fujian, a southeastern province of China. It is of great significance to study its selection model. In this paper, according to the characteristics of strategic emerging industries, drawing on the double helix model, this paper sets up an e...

The all-at-once technique has attracted many researchers’ interest in recent years. In this paper, we combine this technique with a classical symplectic and symmetric method for solving Hamiltonian systems. The solutions at all time steps are obtained at one-shot. In order to reduce the computational cost of solving the all-at-once system, a fast a...

A shortening method for large polarization kernels is presented, which results in shortened kernels with the highest error exponent if applied to kernels of size up to 32. It uses lower and upper bounds on partial distances for quick elimination of unsuitable shortening patterns. The proposed algorithm is applied to some kernels of sizes 16 and 32...

For any weighted directed path-cycle graphs, a and b (referred to as structures), and any equal costs of operations (intermergings and duplication), we obtain an algorithm which, by successively applying these operations to a, outputs b if the first structure contains no paralogs (i.e., edges with a repeated name) and the second has no more than tw...

A method is presented for the evaluation of integrals on tetrahedra where the integrand has a singularity at one vertex. The approach uses a transformation to spherical polar coordinates which explicitly eliminates the singularity and facilitates the evaluation of integration limits. The method can also be implemented in an adaptive form which give...

In this paper, we revisit the application of generating trees to the pattern avoidance problem for permutations. In particular, we study this problem for certain general sets of patterns and propose a new procedure leveraging the FinLabel algorithm and exploiting the subregularities in the associated generating trees. We consider some general kinds...

О неполноте аксиоматики Пеано В ходе анализа алгоритмов факторизации длинных чисел, реализованных с использованием эмулятора вычислительного устройства «абсолютной» точности высказано предположение неполноте аксиоматики Пеано. На основе анализа арифметики «Великого счета», существовавшего на Руси до 1700 года н.э. предложено новое прочтение гипоте...

We study a sort of generalized double coset operators, which feature changing the characters of modular forms. For any pair of characters $v_1$ and $v_2$, we describe explicitly those operators mapping modular forms of character $v_1$ to those of $v_2$. We give three applications, concerned with eta-quotients. For the first application, we give man...

This study aims to predict the complaint attributions significantly differing from various hotel classes (i.e. higher star-rating and lower star-rating) of travelers related to their online complaining behavior. For this, Decision Tree Algorithm was conducted. Findings reveal that guests from higher star-rating hotels are most likely to give online...

We present a new approach based on the notion of inertance for the simultaneous collisions without friction of a rigid solid. The calculations are performed using the screw (plückerian) coordinates, while the results are obtained in matrix form, and they may be easily implemented for different practical situations. One calculates the velocities aft...

Neste Trabalho usamos o FAIPA(Feasible Arc Interior Point Algorithms) que é um algoritmo de ponto interior para