Does growing state activity inevitably lead to more complex policy systems? In this article, we offer a new, comprehensive approach that systematically differentiates between the size and complexity of portfolios answer question. Looking at data from 21 OECD countries over than three decades (1980–2015) in areas social environmental policy, find substantial variation portfolios. While larger is...

many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. in this paper we discuss integrity and its properties in vulnerability calculation. the integrity of a graph g, i(g), is defined t...

This paper presents a hybrid algorithm on P/G networks of Mesh+Tree topology for ASICs. Based on existing algorithms, equivalent circuit method and TLM-ADI method, our algorithm is of linear complexity to solve P/G networks of Mesh+Tree topology. First, it uses equivalent circuit approach to compress the Mesh+Tree P/G circuit into the circuit only of Mesh topology, which is a linear complexity ...

In 9] we proved that for a word rewriting system with variables R and a word with variables w, it is undecidable if w is ground reducible by R, that is if all the instances of w obtained by substituting its variables by non-empty words are reducible by R. On the other hand, if R is linear, the question is decidable for arbitrary (linear or non-linear) w. In this paper we futher study the comple...

abstract the present study was an attempt to investigate the relationship between efl learners’ anxiety and writing complexity. for the purpose of the study, 70 female learners, between 17 and 24 years old (mean=20) from najm language school in tehran participated in the study. the participants’ level of anxiety was measured using horwitz, horwitz, and cope’s anxiety questionnaire (1986) and th...

We present new complexity results on answer set checking for nonground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is important. In particular, we consider set-based and bitmap-based representations, which are popular in implementations of Answer Set Programming systems. Furthermore, we present new...

Answer Set Programming has become a host for expressing knowledge representation problems, which reinforces the interest in efficient methods for computing answer sets of a logic program. While for propositional programs, the complexity of this task has been amply studied and is wellunderstood, less attention has been paid to the case of nonground programs, which is much more important from a K...

Attenuation relation (Ground-motion prediction equation) The term “attenuation relation” is a former short-hand notation in earthquake engineering for “empirical ground-motion attenuation relationship”, now referred to as “ground-motion prediction equation” (GMPE). Attenuation relations represent empirical scaling equations that relate observed ground-motion intensity measures to parameters of ...