当前期刊: Theoretical Computer Science Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Interaction-aware Influence Maximization and Iterated Sandwich Method
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-04-06
    Chuangen Gao; Shuyang Gu; Ruiqi Yang; Jiguo Yu; Weili Wu; Dachuan Xu

    Influence maximization problem has been studied extensively with the development of online social networks. Most of the existing works focus on the maximization of influence spread under the assumption that the number of influenced users determines the success of a product promotion. However, the profit of some products such as online game depends on the interactions among users besides the number

    更新日期:2020-04-06
  • Subversion-Resilient Signatures: Definitions, Constructions and Applications
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-31
    Giuseppe Ateniese; Bernardo Magri; Daniele Venturi

    We provide a formal treatment of security of digital signatures against subversion attacks (SAs). Our model of subversion generalizes previous work in several directions, and is inspired by the proliferation of software attacks (e.g., malware and buffer overflow attacks), and by the recent revelations of Edward Snowden about intelligence agencies trying to surreptitiously sabotage cryptographic algorithms

    更新日期:2020-03-31
  • Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-30
    Silvère Gangloff; Alexandre Talon

    In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow to infinity. Moreover, we provide, for each of the variants, an algorithm which computes the growth rate. We also give bounds on these rates provided by a computer program.

    更新日期:2020-03-30
  • Calibration Scheduling with Time Slot Cost
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-30
    Kai Wang

    We study the scheduling problem with calibrations and time slot costs. In this problem, the machine has to be calibrated to run a job and such a calibration only remains valid for a fixed time period of length T, after which it must be recalibrated in order to execute jobs. On the other hand, a certain cost will be incurred when the machine executes a job and such a cost is determined by the time slot

    更新日期:2020-03-30
  • Makespan minimization on unrelated parallel machines with a few bags
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-30
    Daniel R. Page; Roberto Solis-Oba

    Let there be a set M of m parallel machines and a set J of n jobs, where each job j takes pi,j time units on machine Mi. In makespan minimization the goal is to schedule each job non-preemptively on a machine such that the length of the schedule, the makespan, is minimum. We investigate a generalization of makespan minimization on unrelated parallel machines (R||Cmax) where J is partitioned into b

    更新日期:2020-03-30
  • A new algorithm design technique for hard problems
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-27
    András Faragó; Rupei Xu

    Heuristic algorithms have been used for a long time to tackle problems that are known or conjectured intractable. A heuristic algorithm is one that provides a correct decision for most inputs, but may fail on some. We focus on the case when failure means that the algorithm does not return any answer, rather than returning a wrong result. These algorithms are called errorless heuristics. A reasonable

    更新日期:2020-03-27
  • Backward type inference for XML queries
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-27
    Hyeonseung Im; Pierre Genevès; Nils Gesbert; Nabil Layaïda

    Although XQuery is a statically typed, functional query language for XML data, some of its features such as upward and horizontal XPath axes are typed imprecisely. The main reason is that while the XQuery data model allows us to navigate upwards and between siblings from a given XML node, the type model, e.g., regular tree types, can describe only the subtree structure of the given node. To alleviate

    更新日期:2020-03-27
  • Offline and online algorithms for single-minded selling problem
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-26
    Yong Zhang; Francis Y.L. Chin; Sheung-Hung Poon; Hing-Fung Ting; Dachuan Xu; Dongxiao Yu

    Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must assign some amount of bundles to each buyer with respect to the buyer's accepted price. Each buyer bi is associated with a value function vi(⋅) such that vi(x) is the accepted unit bundle price bi is willing to pay for x bundles

    更新日期:2020-03-27
  • Fault-free cycles embedding in folded hypercubes with F4
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-25
    Che-Nan Kuo; Yu-Huei Cheng

    The n-dimensional folded hypercube FQn interconnection network has been shown that it is bipartite for every odd n≥3, and which is non-bipartite for every even n≥2. Let F4={f1,f2,f3,f4} denote the faulty set of extreme vertices from any four cycle in FQn. Then, we show that the fault-free cycles can be embedded in FQn−F4 as follows: 1. For n≥3, FQn−F4 contains a fault-free cycle of every even length

    更新日期:2020-03-26
  • Generic hardness of inversion on ring and its relation to self-bilinear map
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-25
    Takashi Yamakawa; Shota Yamada; Goichiro Hanaoka; Noboru Kunihiro

    In this paper, we study the generic hardness of the inversion problem on a ring, which is a problem to compute the inverse of a given prime c by just using additions, subtractions and multiplications on the ring. If the characteristic of an underlying ring is public and coprime to c, then it is easy to compute the inverse of c by using the extended Euclidean algorithm. On the other hand, if the characteristic

    更新日期:2020-03-26
  • Characterization of interval graphs that are unpaired 2-disjoint path coverable
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-24
    Jung-Heum Park; Hyeong-Seok Lim

    Given disjoint source and sink sets, S={s1,…,sk} and T={t1,…,tk}, in a graph G, an unpaired k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths {P1,…,Pk} that altogether cover every vertex of the graph, in which Pi is a path from source si to some sink tj. In terms of a generalized scattering number, named an r-scattering number, we characterize interval graphs that have

    更新日期:2020-03-26
  • A search game on a hypergraph with booby traps
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-24
    Thomas Lidbetter; Kyle Y. Lin

    A set of n boxes, located on the vertices of a hypergraph G, contain known but different rewards. A Searcher opens all the boxes in some hyperedge of G with the objective of collecting the maximum possible total reward. Some of the boxes, however, are booby trapped. If the Searcher opens a booby trapped box, the search ends and she loses all her collected rewards. We assume the number k of booby traps

    更新日期:2020-03-26
  • Local approximation of the Maximum Cut in regular graphs
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-24
    Étienne Bamas; Louis Esperet

    This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MaxCut) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and achieves an approximation ratio of at least 12 in expectation. When the graph is d-regular and triangle-free, a slightly better approximation

    更新日期:2020-03-24
  • Lift & project systems performing on the partial-vertex-cover polytope
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-20
    Konstantinos Georgiou; Andy (Jia) Jiang; Edward Lee; Astrid A. Olave; Ian Seong; Twesh Upadhyaya

    We study integrality gap (IG) lower bounds on strong LP and SDP relaxations derived by the Sherali-Adams (SA), Lovász-Schrijver-SDP (LS+), Sherali-Adams-SDP (SA+), and Lasserre-SDP (La) lift-and-project (L&P) systems for the t-Partial-Vertex-Cover (t-PVC) problem, a variation of the classic Vertex-Cover problem in which only t edges need to be covered. t-PVC admits a 2-approximation using various algorithmic

    更新日期:2020-03-21
  • Markov Chain Analysis of Evolutionary Algorithms on OneMax Function – From Coupon Collector's Problem to (1 + 1) EA
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-20
    Yu-an Zhang; Xiaofeng Qin; Qinlian Ma; Minghao Zhao; Satoru Hiwa; Tomoyuki Hiroyasu; Hiroshi Furutani

    The theoretical investigation of Evolutionary Algorithms (EAs) has increased our understanding of the computational mechanism of algorithms. OneMax is a test function most frequently and deeply studied in the field of EAs. In this work, a method is presented for describing the runtime properties of (1+1) EA on OneMax. This method is motivated by the work of Erdös and Rényi treating the coupon collector's

    更新日期:2020-03-21
  • Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-19
    Andrzej Lingas

    We consider normalized Boolean circuits that use binary operations of disjunction and conjunction, and unary negation, with the restriction that negation can be only applied to input variables. We derive a lower bound trade-off between the size of normalized Boolean circuits computing Boolean semi-disjoint bilinear forms and their conjunction-depth (i.e., the maximum number of and-gates on a directed

    更新日期:2020-03-20
  • Functional dependency restricted insertion propagation
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2017-04-14
    Dongjing Miao; Zhipeng Cai; Xianmin Liu; Jianzhong Li

    With a rise of research on data provenance and quality, insertion propagation problem has been an important role in data lineage. As an variated version of classic view update problem in relational databases, it is defined on a given database D, a monotonic relational algebraic query Q and its materialized view V on D, insertion propagation aims to find a set ΔD of tuples whose insertion into D guarantees

    更新日期:2020-03-19
  • Skew circuits of small width
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2017-03-21
    Nikhil Balaji; Andreas Krebs; Nutan Limaye

    A celebrated result of Barrington (1985) proved that polynomial size, width-5 branching programs (BP) are equivalent in power to a restricted form of branching programs – polynomial sized width-5 permutation branching programs (PBP), which in turn capture all of NC1. On the other hand it is known that width-3 PBPs require exponential size to compute the AND function. No such lower bound is known for

    更新日期:2020-03-19
  • Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-06-26
    Youhei Akimoto; Anne Auger; Nikolaus Hansen

    Quality gain is the expected relative improvement of the function value in a single step of a search algorithm. Quality gain analysis reveals the dependencies of the quality gain on the parameters of a search algorithm, based on which one can derive the optimal values for the parameters. In this paper, we investigate evolution strategies with weighted recombination on general convex quadratic functions

    更新日期:2020-03-16
  • An improved kernel for Max-Bisection above tight lower bound
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-06-22
    Qilong Feng; Senmin Zhu; Jianxin Wang

    We study kernelizations for Max-Bisection above Tight Lower Bound, which is to decide if a given graph G=(V,E) admits a bisection with at least ⌈|E|/2⌉+k crossing edges. The best known kernel for this problem has 16k vertices. Based on the Gallai–Edmonds decomposition, we divide the vertices of G into several categories and study the roles of vertices in each category for obtaining a larger number

    更新日期:2020-03-16
  • Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-06-19
    Edgar Covantes Osuna; Wanru Gao; Frank Neumann; Dirk Sudholt

    Parent selection in evolutionary algorithms for multi-objective optimisation is usually performed by dominance mechanisms or indicator functions that prefer non-dominated points. We propose to refine the parent selection on evolutionary multi-objective optimisation with diversity-based metrics. The aim is to focus on individuals with a high diversity contribution located in poorly explored areas of

    更新日期:2020-03-16
  • Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-06-06
    Martin S. Krejca; Carsten Witt

    The Univariate Marginal Distribution Algorithm (UMDA) – a popular estimation-of-distribution algorithm – is studied from a run time perspective. On the classical OneMax benchmark function on bit strings of length n, a lower bound of Ω(λ+μn+nlog⁡n), where μ and λ are algorithm-specific parameters, on its expected run time is proved. This is the first direct lower bound on the run time of UMDA. It is

    更新日期:2020-03-16
  • On the steady state analysis of covariance matrix self-adaptation evolution strategies on the noisy ellipsoid model
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-05-18
    Michael Hellwig; Hans-Georg Beyer

    This paper addresses the analysis of covariance matrix self-adaptive Evolution Strategies (CMSA-ES) on a subclass of quadratic functions subject to additive Gaussian noise: the noisy ellipsoid model. To this end, it is demonstrated that the dynamical systems approach from the context of isotropic mutations can be transferred to ES that also control the covariance matrix. Theoretical findings such as

    更新日期:2020-03-16
  • On the modulo degree complexity of Boolean functions
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-05-02
    Qian Li; Xiaoming Sun

    For each integer m≥2, every Boolean function f can be expressed as a unique multilinear polynomial modulo m, and the degree of this multilinear polynomial is called its modulo m degree. In this paper we investigate the modulo degree complexity of total Boolean functions initiated by Parikshit Gopalan et al. [9], in which they asked the following question: whether the degree complexity of a Boolean

    更新日期:2020-03-16
  • Complexity and algorithms for finding a subset of vectors with the longest sum
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-04-17
    Vladimir Shenmaier

    The problem is, given a set of n vectors in a d-dimensional normed space, find a subset with the largest length of the sum vector. We prove that, in the case of the ℓp norm, the problem is APX-complete for any p∈[1,2] and is not in APX if p∈(2,∞). In the case of an arbitrary norm, we propose an algorithm which finds an optimal solution in time O(nd−1(d+log⁡n)), improving previously known algorithms

    更新日期:2020-03-16
  • On scheduling multiple two-stage flowshops
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-04-17
    Guangwei Wu; Jianer Chen; Jianxin Wang

    This paper studies the problem of scheduling n two-stage jobs on m multiple two-stage flowshops, with the objective of minimizing the makespan. The problem is NP-hard even when m is a fixed constant, and becomes strongly NP-hard when m is part of the input. A 2.6-approximation algorithm along with its analysis is presented for an arbitrary m≥2. This is the first approximation algorithm for multiple

    更新日期:2020-03-16
  • Verify heaps via unified model checking
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-04-02
    Xu Lu; Zhenhua Duan; Cong Tian; Hongwei Du

    This paper addresses the problem of verifying heap evolution properties of pointer programs. To this end, a new unified model checking approach with MSVL (Modeling, Simulation and Verification Language) and PPTLSL is presented. The former is an executable subset of PTL (Projection Temporal Logic) while the latter is an extension of PPTL (Propositional Projection Temporal Logic) with separation logic

    更新日期:2020-03-16
  • The existence of universally agreed fairest semi-matchings in any given bipartite graph
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-03-20
    Jian Xu; Soumya Banerjee; Wenjing Rao

    In a bipartite graph G=(U∪V,E) where E⊆U×V, a semi-matching is defined as a set of edges M⊆E, such that each vertex in U is incident with exactly one edge in M. Many previous works focus on the problem of finding the fairest semi-matchings: ones that assign U-vertices with V-vertices as fairly as possible. In these works, fairness is usually measured according to a specific index. In fact, there exist

    更新日期:2020-03-16
  • Linear representation of transversal matroids and gammoids parameterized by rank
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-03-06
    Pranabendu Misra; Fahad Panolan; M.S. Ramanujan; Saket Saurabh

    Given a bipartite graph G=(U⊎V,E), a linear representation of the transversal matroid associated with G on the ground set U, can be constructed in randomized polynomial time. In fact one can get a linear representation deterministically in time 2O(m2n), where m=|U| and n=|V|, by looping through all the choices made in the randomized algorithm. Other important matroids for which one can obtain linear

    更新日期:2020-03-16
  • Corrigendum to “Inductive-data-type systems” [Theoret. Comput. Sci. 272 (1–2) (2002) 41–68]
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-02-12
    Frédéric Blanqui; Jean-Pierre Jouannaud; Mitsuhiro Okada

    In a previous work (Abstract data type systems, Theoret. Comput. Sci. 173 (2) (1997)), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching definitions following a certain format, called the “General Schema”, which generalizes the usual recursor definitions for natural numbers and similar

    更新日期:2020-03-16
  • On the viability of the deterministic consensus hierarchy
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-02-06
    Ammar Qadri

    A recent paper by Afek, Ellen, and Gafni introduced a family of deterministic objects Om,k, for m,k≥2, with consensus numbers m such that, for each k≥2, Om,k is computationally less powerful than Om,k+1 in systems with at least mk+m+k processes. This paper gives a wait-free implementation of Om,k from (m+1)-consensus objects and registers in systems with finitely many processes. In order to do so,

    更新日期:2020-03-16
  • A decision procedure and complete axiomatization for projection temporal logic
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2017-09-28
    Xinfeng Shu; Zhenhua Duan; Hongwei Du

    To specify and verify the concurrent and reactive systems with the theorem proving approach, a complete axiomatization is formalized for first order projection temporal logic (PTL) with both finite and infinite time. To this end, PTL is restricted to a finite domain, and the syntax, semantics as well as the axiomatization of PTL are presented. Further, the techniques of labeled normal form and labeled

    更新日期:2020-03-16
  • Flow shop for dual CPUs in dynamic voltage scaling
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2017-09-22
    Vincent Chau; Xin Chen; Ken C.K. Fong; Minming Li; Kai Wang

    We study the following flow shop scheduling problem on two processors. We are given n jobs with a common deadline D, where each job j has workload pi,j on processor i and a set of processors which can vary their speed dynamically. Job j can be executed on the second processor if the execution of job j is completed on the first processor. Our objective is to find a feasible schedule such that all jobs

    更新日期:2020-03-16
  • Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2017-09-21
    Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy

    The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. We give a polynomial time graph isomorphism algorithm for graphs with clique-width at most three. Our work is independent of the work by Grohe et al. [1] showing that the isomorphism problem for graphs of bounded clique-width

    更新日期:2020-03-16
  • Parameterization of rational translational surfaces
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2017-08-24
    Sonia Pérez-Díaz; Li-Yong Shen

    A rational translational surface is a typical modeling surface used in computer-aided design and the architecture industry. In this study, we determine whether a given algebraic surface implicitly defined as V is a rational translational surface or not. This problem is reduced to finding the rational parameterizations of two space curves. More important, our discussions are constructive, and thus if

    更新日期:2020-03-16
  • On recognising words that are squares for the shuffle product
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2017-04-23
    Romeo Rizzi; Stéphane Vialette

    The shuffle of two words u and v of A⁎ is the language u⧢v consisting of all words u1v1u2v2…ukvk, where k≥0 and the ui and vi are words of A⁎ such that u=u1u2…uk and v=v1v2…vk. In other words, u⧢v is the finite set of all words obtainable from merging the words u and v from left to right, but choosing the next symbol arbitrarily from u or v. A word u∈A⁎ is a square for the shuffle product if it is

    更新日期:2020-03-16
  • Resolution based algorithms for the transversal hypergraph generation problem
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-06
    Stavros Cosmadakis; Dimitris Kavvadias; Lina Panagopoulou

    We study the problem, given a hypergraph H, how to generate its transversal (or dual) hypergraph G, using tools from Boolean resolution. We show how to compute the residual dual of H given a subset E of its minimal transversals. This is the hypergraph whose minimal transversals are exactly those missing from E to become the dual of H. We give a novel algorithm for the problem based on the notion of

    更新日期:2020-03-06
  • Presenting de Groot duality of stably compact spaces
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-06
    Tatsuji Kawai

    We give a constructive account of the de Groot duality of stably compact spaces in the setting of strong proximity lattice, a point-free representation of a stably compact space. To this end, we introduce a notion of strong continuous entailment relation, which can be thought of as a presentation of a strong proximity lattice by generators and relations. The new notion allows us to identify de Groot

    更新日期:2020-03-06
  • Bisimulation Invariant Monadic-Second Order Logic in the Finite
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-04
    Achim Blumensath; Felix Wolf

    We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the modal μ-calculus. Using these characterisations we prove for some simple classes of transition systems that this is indeed the case. In particular, we show that, over

    更新日期:2020-03-05
  • List-coloring – parameterizing from triviality
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-03-04
    Pranav Arora; Aritra Banik; Vijay Kumar Paliwal; Venkatesh Raman

    The classical graph coloring problem is given an undirected graph and the goal is to color the vertices of the graph with the minimum number of colors so that endpoints of each edge gets different colors. In list-coloring, each vertex is given a list of allowed colors with which it can be colored. Most versions of the problems are hard in several paradigms including approximation and parameterized

    更新日期:2020-03-05
  • Dynamic maintenance case base using knowledge discovery techniques for case based reasoning systems
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2019-07-03
    Abir Smiti; Zied Elouedi

    The achievement of a Case Based Reasoning (CBR) system is strongly related to the quality of case data and the rapidity of the retrieval process that depends on the quantity of the cases. This quality can diminish especially when the number of cases gets outsized. To guarantee this quality, maintenance the case base becomes essentially. Much existing maintenance CBR approaches focus on the performance

    更新日期:2020-03-05
  • Improved adaptive genetic algorithm for the vehicle Insurance Fraud Identification Model based on a BP Neural Network
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2019-07-03
    Chun Yan; Meixuan Li; Wei Liu; Man Qi

    With the development of the insurance industry, insurance fraud is increasing rapidly. The existence of insurance fraud considerably hinders the development of the insurance industry. Fraud identification has become the most important part of insurance fraud research. In this paper, an improved adaptive genetic algorithm (NAGA) combined with a BP neural network (BP neural network) is proposed to optimize

    更新日期:2020-03-05
  • List r-dynamic coloring of sparse graphs
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2019-07-02
    Junlei Zhu; Yuehua Bu

    The r-dynamic coloring is a generalization of the L(1,1)-labeling. An r-dynamic k-coloring of a graph G is a proper k-coloring such that every vertex v in V(G) has neighbors in at least min⁡{d(v),r} different classes. The r-dynamic chromatic number of G, written χr(G), is the minimum k such that G has such a coloring. The list r-dynamic chromatic number of G is denoted chr(G). In this paper, we show

    更新日期:2020-03-05
  • Discrete-time formulation, control, solution and verification of pendulum systems with zeroing neural dynamics
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2019-07-02
    Yunong Zhang; Huanchang Huang; Min Yang; Jian Li

    As a typical kind of nonlinear system, pendulum systems have drawn attention of numerous researchers for a very long time. This paper focuses mainly on dealing with the discrete-time tracking control problem of both the simple pendulum system and inverted-pendulum-on-a-cart (IPOAC) system. Based on zeroing neural dynamics (ZND), controllers of z2 type are designed respectively for the effective tracking

    更新日期:2020-03-05
  • Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2019-03-08
    Mojgan Pourhassan; Vahid Roostapour; Frank Neumann

    In this paper, we perform theoretical analyses on the behaviour of an evolutionary algorithm and a randomised search algorithm for the dynamic vertex cover problem based on its dual formulation. The dynamic vertex cover problem has already been theoretically investigated to some extent and it has been shown that using its dual formulation to represent possible solutions can lead to a better approximation

    更新日期:2020-03-05
  • When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2019-03-07
    Dogan Corus; Pietro S. Oliveto; Donya Yazdani

    We present a time complexity analysis of the Opt-IA artificial immune system (AIS). We first highlight the power and limitations of its distinguishing operators (i.e., hypermutations with mutation potential and ageing) by analysing them in isolation. Recent work has shown that ageing combined with local mutations can help escape local optima on a dynamic optimisation benchmark function. We generalise

    更新日期:2020-03-05
  • Fault-tolerant metric dimension of circulant graphs Cn(1,2,3)
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2019-01-16
    Mithun Basak; Laxman Saha; Gour Kanta Das; Kalishankar Tiwary

    For a connected graph G=(V,E), an ordered set R={r1,r2,…,rk}⊂V(G) is said to be a resolving set if c(u|R)≠c(v|R) for every distinct pair of vertices u,v of G, where c(w|R)=(d(w,r1),d(w,r2),…,d(w,rk)) for w∈V(G) and d(x,y) denotes the distance between two vertices x and y. A resolving set F for the graph G is fault-tolerant if for each v∈F, F∖{v} is also a resolving set for G and the fault-tolerant

    更新日期:2020-03-05
  • On invariance and linear convergence of evolution strategies with augmented Lagrangian constraint handling
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-11-01
    Asma Atamna; Anne Auger; Nikolaus Hansen

    In the context of numerical constrained optimization, we investigate stochastic algorithms, in particular evolution strategies, handling constraints via augmented Lagrangian approaches. In those approaches, the original constrained problem is turned into an unconstrained one and the function optimized is an augmented Lagrangian whose parameters are adapted during the optimization. The use of an augmented

    更新日期:2020-03-05
  • Bounded disagreement
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-10-26
    David Yu Cheng Chan; Vassos Hadzilacos; Sam Toueg

    A well-known generalization of the consensus problem, namely, set agreement (SA), limits the number of distinct decision values that processes decide. In some settings, it may be more important to limit the number of “disagreers”. Thus, we introduce another natural generalization of the consensus problem, namely, bounded disagreement (BD), which limits the number of processes that decide differently

    更新日期:2020-03-05
  • Kleinberg's grid unchained
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-09-25
    Céline Comte; Fabien Mathieu

    One of the key features of small-world networks is the ability to route messages in a few hops, using a decentralized algorithm in which each node has a limited knowledge of the topology. In 2000, Kleinberg proposed a model based on an augmented grid that asymptotically exhibits such a property. In this paper, we revisit the original model with the help of numerical simulations. Our approach is fueled

    更新日期:2020-03-05
  • An incentive compatible, efficient market for air traffic flow management
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-09-12
    Ruta Mehta; Vijay V. Vazirani

    We present a market-based approach to the Air Traffic Flow Management (ATFM) problem. The goods in our market are delays and buyers are airline companies; the latter pay money to the Federal Aviation Administration (FAA) to buy away the desired amount of delay on a per flight basis. We give a notion of equilibrium for this market and an LP whose every optimal solution gives an equilibrium allocation

    更新日期:2020-03-05
  • NP-completeness results for partitioning a graph into total dominating sets
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-08-14
    Mikko Koivisto; Petteri Laakkonen; Juho Lauri

    A total domatic k-partition of a graph is a partition of its vertex set into k subsets such that each intersects the open neighborhood of each vertex. The maximum k for which a total domatic k-partition exists is known as the total domatic number of a graph G, denoted by dt(G). We extend considerably the known hardness results by showing it is -complete to decide whether dt(G)≥3 where G is a bipartite

    更新日期:2020-03-05
  • Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-08-10
    Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa

    In this paper we consider the problem of listing the maximal k-degenerate induced subgraphs of a chordal graph, and propose an output-sensitive algorithm using delay O(m⋅ω(G)) for any n-vertex chordal graph with m edges, where ω(G)≤n is the maximum size of a clique in G. Degeneracy is a well known sparsity measure, and k-degenerate subgraphs are a notion of sparse subgraphs, which generalizes other

    更新日期:2020-03-05
  • Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2018-06-27
    Tobias Friedrich; Timo Kötzing; J.A. Gregor Lagodzinski; Frank Neumann; Martin Schirneck

    Linear functions have gained great attention in the run time analysis of evolutionary computation methods. The corresponding investigations have provided many effective tools for analyzing more complex problems. So far, the runtime analysis of evolutionary algorithms has mainly focused on unconstrained problems, but problems occurring in applications frequently involve constraints. Therefore, there

    更新日期:2020-03-05
  • Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-02-13
    Alexander Bolotov; Montserrat Hermo; Paqui Lucio

    Temporal logic has become essential for various areas in computer science, most notably for the specification and verification of hardware and software systems. For the specification purposes rich temporal languages are required that, in particular, can express fairness constraints. For linear-time logics which deal with fairness in the linear-time setting, one-pass and two-pass tableau methods have

    更新日期:2020-03-04
  • Convergence of the non-uniform Physarum dynamics
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-02-28
    Andreas Karrenbauer; Pavel Kolev; Kurt Mehlhorn

    The Physarum computing model is an analog computing model motivated by the network dynamics of the slime mold Physarum Polycephalum. In previous works, it was shown that it can solve a class of linear programs. We extend these results to a more general dynamics motivated by situations where the slime mold operates in a non-uniform environment. Let c∈Z>0m, A∈Zn×m, and b∈Zn. We show under fairly general

    更新日期:2020-03-02
  • Reliability analysis of subsystem in dual cubes
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-02-27
    Qifan Zhang; Liqiong Xu; Shuming Zhou; Weihua Yang

    The probability of failing processors in the multiprocessor system increases as the cardinality of system grows. The subsystem reliability in a system, defined as the probability that a subsystem of a specified cardinality is operational with the emergence of failed nodes. In this paper, we derive an approximation and an upper bound on the probability of a subgraph Dn−1 being fault-free under the probabilistic

    更新日期:2020-02-27
  • A fully distributed hierarchical attribute-based encryption scheme
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-02-26
    Mohammad Ali; Javad Mohajeri; Mohammad-Reza Sadeghi; Ximeng Liu

    With the development of cloud computing, many enterprises have been interested in outsourcing their data to cloud servers to decrease IT costs and rise capabilities of provided services. To afford confidentiality and fine-grained data access control, attribute-based encryption (ABE) was proposed and used in several cloud storage systems. However, scalability and flexibility in key delegation and user

    更新日期:2020-02-26
  • Revocable identity-based encryption with server-aided ciphertext evolution
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-02-25
    Yinxia Sun; Yi Mu; Willy Susilo; Futai Zhang; Anmin Fu

    The utmost important problem in identity-based cryptosystems is the issue of user revocation. One of the existing solutions in the literature is to issue extra time keys periodically for every non-revoked user over public channels. Unfortunately, this solution is inefficient and very impractical when applying to the cloud. Because the scheme requires different time keys to allow data decryption for

    更新日期:2020-02-25
  • Deque automata, languages, and planar graph representations
    Theor. Comput. Sci. (IF 0.718) Pub Date : 2020-02-25
    Stefano Crespi Reghizzi; Pierluigi San Pietro

    A deque automaton is a finite-state machine equipped with a deque memory tape. Such memory being more general than a queue or two stacks, we restrict consideration to quasi-real-time deque machines, for which we present useful normal forms. The closure properties of deque languages qualify them as an abstract family of languages but not a full one. The newly defined characteristic deque language CDL

    更新日期:2020-02-25
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
聚焦肿瘤,探索癌症
欢迎探索2019年最具下载量的材料科学论文
宅家赢大奖
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
舒伟
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
香港大学化学系刘俊治
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug