With the increase in system complexity, the intelligent heuristic optimization methods have received more and more attention on system reliability analysis. However, the objective functions and ... algorithm and bacterial foraging algorithm, to solve the problem of system reliability and redundancy allocation. First, random grouping strategy was added to maintain the diversity of the population. Then
description of edge-clique graphs of threshold graphs is presented and a linear time algorithm for l-coloring the edge-clique graph of a threshold graph is provided. A survey on the l-coloring problem, when ... -clique graph Ke(G) of a threshold graph G, and then we study the l-coloring problem on Ke(G), providing a linear time algorithm that l-colors Ke(G). Let us consider the edge-clique graph Ke(G) = (V', E
retrosynthetic analysis method and demonstrate its capabilities in an attempt to identify synthetic routes for a collection of approved drugs. Our results indicate that the method, leveraging on reaction ... . While traditionally finding solutions to this problem has been the domain of human experts, several computational approaches, aided by the algorithmic advances and the availability of large reaction
Abstract The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the identity, and simple operators near ... from the identity, and simple operators near. By restricting our attention to a finite subgroup of the unitary group, we observe that this idea can be made rigorous: the complexity geometry becomes what
wormholes. We also compute the binding complexity of general coherent states in perturbation theory, and show that for “double-trace deformations” of the Hamiltonian the effects resemble expansion of a ... on graphs with wormhole-like structure. We compute the binding complexity of our states by adapting the Euler-Arnold approach to Nielsen’s geometrization of gate counting, and find a scaling with
near-linear complexity. By introducing the partition technique, we introduce a very simple approximation algorithm with arbitrary accuracy ε and a complexity of O(N + ε−1 log ε−1) for the cases that all ... them, with a lower bound of complexity O(N log N) [1?4]. In the science of big data, this classical problem encounters new challenges. For big data, the number of points N can be huge, and one usually
We study sketching and streaming algorithms for the Longest Common Subsequence problem (LCS) on strings of small alphabet size |Sigma|. For the problem of deciding whether the LCS of strings x,y has ... complexity, Theory of computation ? Design and analysis of algorithms In the Longest Common Subsequence problem (LCS) we are given strings x and y and the task is to compute a longest string z that is a
-snake model and P-M model is introduced. Secondly, the recursive HOSVD dimensionality reduction algorithm based on tensor product model is used to further process the image. The center of the Hartmann ... huge need for prevention, management, and treatment. This understanding, from low-level image processing to advanced analysis, is evolving. So, Zhang et al. [2] introduced a special problem to prove the
Computational Biology as natural generalizations of recognition problems. We contribute to the study of the complexity of graph sandwich problems by considering the Helly property and complementary graph classes ... problems focus on properties that are neither hereditary nor ancestral on subgraphs, in which case the complexity of the recognition problem and of the corresponding sandwich problem coincide. The graph
dominating set if every vertex in V(G) has at least one and at most j neighbors in D. In the [1,j]-(Total) Dominating Set problem we are given a graph G and a positive integer k. The objective is to test ... solving the [1, 2]-Total Dominating Set problem parameterized by pathwidth. 2012 ACM Subject Classification Mathematics of computing ? Graph algorithms, Theory of computation ? Design and analysis of
different connected components. Furthermore, our analysis can be extended to the more general (unit cost) b-Matching problem. On the way, we introduce new tools for b-Matching and dynamic programming over ... with application to the diametral pair problem . Discrete Applied Mathematics , 98 ( 3 ): 191 - 207 , 2000 . G. Ducoffe and A. Popa . A quasi linear-time b-Matching algorithm on distance-hereditary
, in the form and frequency of cooperation and in their competitive regime, creating a diversity of socially complex societies. However, there is an ongoing debate about whether social complexity is a ... of different societies. A fundamental problem is that social complexity has proved difficult to define and operationalize (Freeberg et al. 2012; Bergman and Beehner 2015; Fischer et al. 2017). In some
-wise maxima of the four vectors in the quad. The problem is to partition the given 4k vectors into k quads with minimum total cost. We analyze a straightforward matching-based algorithm and prove that ... where each cluster is isomorphic to a tree consisting of 4 edges. 2 2.1 Preliminaries About problem PQ: special cases and complexity We first observe that, for the analysis of algorithm A, we can
In this paper, K-means algorithm has been applied for distributed large data using hybrid clustering techniques. K-means is a simple and scalable algorithm which can be applied on large datasets. It ... powers. During the data distribution process in the P2P environments, accuracy, computation complexity and distributed clustering accuracy are the important issues as they reduce the entire system
This article looks at writing tasks as a methodology to support learners' mathematical problem-solving strategies in the South African Foundation Phase context. It is a qualitative case study and ... implemented by them while they were engaged in mathematical problem solving. Data were gathered from a sample of eight learners of different abilities and included written work, interviews, field notes and
analysis aims to focus on the similarities and differences such as the objective used, the methodology used and the findings of the study. The study article was selected through a database of various types ... cartoon; Comic; Systematic literature review analysis; Problem-based learning; Teaching strategy - 1. Introduction In the 21st century, the education system within the country and abroad really emphasizes
An instance of the maximum weight strongly stable matching problem with incomplete lists and ties is an undirected bipartite graph G = (A cup B, E), with an adjacency list being a linearly ordered ... [23] to solve the maximum flow problem and obtain O(m2 log n) complexity. A faster maximum flow algorithm would lead to the improvement in their algorithm. Feder [2] showed that if K = O((m/ log2 m)2
variable and a truth value for it. - For the version where the set of variables is partitioned into two halves and each player may only pick variables from his/her half, we prove that the problem is PSPACE ... problem is to determine who has a winning strategy in a game played on a given CNF formula, where the two players alternate turns picking truth values for the variables in a given order, and the winner is
In this paper, we describe new complexity results and approximation algorithms for single-machine scheduling problems with non-renewable resource constraints and the total weighted completion time ... Sect. 5, we present complexity results and a 2-approximation algorithm for the special case with \(p_j = a_j = w_j\). Finally, in Sect. 6 we devise a PTAS for \(1|nr=1,p_j = w_j, q=const.| \sum w_j C_j
A new dynamic mode decomposition (DMD) method is introduced for simultaneous system identification and denoising in conjunction with the adoption of an extended Kalman filter algorithm. The present ... A = (aij), x = (xi), y = (yi), v = (vi), and w = (wi). Then, the Kalman filter algorithm is considered. In this problem, we would like to simultaneously conduct the online system identification and