Log in

Relevant bibliographies by topics / Complexity of States / Journal articles

To see the other types of publications on this topic, follow the link: Complexity of States.

Journal articles on the topic 'Complexity of States'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Complexity of States.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Adams, Robert McC. "Complexity in Archaic States." Journal of Anthropological Archaeology 20, no. 3 (2001): 345–60. http://dx.doi.org/10.1006/jaar.2000.0377.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

MORA, CATERINA E., and HANS J. BRIEGEL. "ALGORITHMIC COMPLEXITY OF QUANTUM STATES." International Journal of Quantum Information 04, no. 04 (2006): 715–37. http://dx.doi.org/10.1142/s0219749906002043.

Full text

Abstract:

We give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory, the algorithmic complexity of a string is a measure of the information needed by a universal machine to reproduce the string itself. We define the complexity of a quantum state by means of the classical description complexity of an (abstract) experimental procedure that allows us to prepare the state with a given fidelity. We argue that our definition satisfies the intuitive idea of complexity as a measure of "how difficult" it is to prepare a state. We apply this definition to give an

APA, Harvard, Vancouver, ISO, and other styles

3

Bob, Petr, and Miroslav Svetlak. "Dissociative states and neural complexity." Brain and Cognition 75, no. 2 (2011): 188–95. http://dx.doi.org/10.1016/j.bandc.2010.11.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wieśniak, Marcin. "Communication complexity reduction from globally uncorrelated states." Physics Letters A 379, no. 8 (2015): 787–89. http://dx.doi.org/10.1016/j.physleta.2015.01.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hegde, Samarth, Andrew M. Leader, and Miriam Merad. "MDSC: Markers, development, states, and unaddressed complexity." Immunity 54, no. 5 (2021): 875–84. http://dx.doi.org/10.1016/j.immuni.2021.04.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lopoo, Leonard M., and Kerri M. Raissian. "U.S. Social Policy and Family Complexity." ANNALS of the American Academy of Political and Social Science 654, no. 1 (2014): 213–30. http://dx.doi.org/10.1177/0002716214530372.

Full text

Abstract:

The United States has a number of social policies that were designed explicitly to provide options and supports for individuals related to their family formation decisions, such as the Title X National Family Planning Program and the Healthy Marriage Initiative. At the same time, because social policies can have considerable implications for the populations they target, we have long known that government policy can impact family structure and individuals’ fertility decisions even when such an impact was not the policy’s stated objective. This article reviews both theoretical and empirical lite

APA, Harvard, Vancouver, ISO, and other styles

7

Ott, Marvin C. "East Asia: Security and Complexity." Current History 100, no. 645 (2001): 147–53. http://dx.doi.org/10.1525/curh.2001.100.645.147.

Full text

Abstract:

In Southeast Asia, the United States and China are natural geopolitical rivals. For United States security planners based in Honolulu and Washington, this creates a remarkably challenging environment.

APA, Harvard, Vancouver, ISO, and other styles

8

Hernández-Orozco, Santiago, Francisco Hernández-Quiroz, and Hector Zenil. "Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence." Artificial Life 24, no. 1 (2018): 56–70. http://dx.doi.org/10.1162/artl_a_00254.

Full text

Abstract:

Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical systems. Within this framework, we show that decidability imposes absolute limits on the stable growth of complexity in computable dynamical systems. Conversely, systems that exhibit (strong) open-ended evolution must be undecidable, establishing undecidability as a requirement for such systems. Complexity is assessed in terms of three measures: sophistication, c

APA, Harvard, Vancouver, ISO, and other styles

9

Susa, Cristian E., and Davide Girolami. "Weaving and neural complexity in symmetric quantum states." Optics Communications 413 (April 2018): 157–61. http://dx.doi.org/10.1016/j.optcom.2017.12.050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Sandeford, David S. "Organizational complexity and demographic scale in primary states." Royal Society Open Science 5, no. 5 (2018): 171137. http://dx.doi.org/10.1098/rsos.171137.

Full text

Abstract:

The relationship between organizational complexity and demographic scale is an enduring research problem at the intersection of the natural and social sciences and has far reaching implications for the study of social evolution, particularly the emergence and collapse of complex social organizations such as chiefdoms, states and empires. Anthropological models of social evolution universally assume that population growth plays a critical role in the development of organizational complexity; however, the relationship between organizational complexity and demographic scale has not been formalize

APA, Harvard, Vancouver, ISO, and other styles

11

Sokolov, Valentin V., B. Alex Brown, and Vladimir Zelevinsky. "Invariant correlational entropy and complexity of quantum states." Physical Review E 58, no. 1 (1998): 56–68. http://dx.doi.org/10.1103/physreve.58.56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Hu, Zixuan, and Sabre Kais. "Characterization of Quantum States Based on Creation Complexity." Advanced Quantum Technologies 3, no. 9 (2020): 2000043. http://dx.doi.org/10.1002/qute.202000043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Manning, Wendy D., Susan L. Brown, and J. Bart Stykes. "Family Complexity among Children in the United States." ANNALS of the American Academy of Political and Social Science 654, no. 1 (2014): 48–65. http://dx.doi.org/10.1177/0002716214524515.

Full text

Abstract:

Researchers largely have relied on a measure of family structure to describe children’s living arrangements, but this approach captures only the child’s relationship to the parent(s), ignoring the presence and composition of siblings. We develop a measure of family complexity that merges family structure and sibling composition to distinguish between simple two-biological-parent families, families with complex-sibling (half or stepsiblings) arrangements, and complex-parent (stepparent, single-parent) families. Using the Survey of Income and Program Participation (SIPP), we provide a descriptiv

APA, Harvard, Vancouver, ISO, and other styles

14

Zamenopoulos, Theodore. "A complexity theory of design intentionality." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 26, no. 1 (2011): 63–83. http://dx.doi.org/10.1017/s0890060411000023.

Full text

Abstract:

AbstractThe subject of this paper is design intentionality. The paper is concerned with the property of the mind to hold intentional states (its capacity to represent or reflect existing and nonexisting realities) and with the way that these mental states are constructed during design tasks. The aim is to develop a mathematical theory of design intentionality, capturing the structures and processes that characterize an intentional system with the mental ability to address design tasks. The philosophical notion of intentionality is approached methodologically from a complexity theoretic perspec

APA, Harvard, Vancouver, ISO, and other styles

15

CÂMPEANU, CEZAR. "DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES." International Journal of Foundations of Computer Science 25, no. 07 (2014): 917–32. http://dx.doi.org/10.1142/s0129054114400152.

Full text

Abstract:

Algorithmic Information Theory is based on the notion of descriptional complexity known as Chaitin-Kolmogorov complexity, defined in the '60s in terms of minimal description length. Blum Static Complexity spaces defined using Blum axioms, and Encoded Function spaces defined using properties of the complexity function, were introduced in 2012 to generalize the concept of descriptional complexity. In formal language theory we also use the concept of descriptional complexity for the number of states, or the number of transitions in a minimal finite automaton accepting a regular language, and appa

APA, Harvard, Vancouver, ISO, and other styles

16

Bossaerts, Peter, Nitin Yadav, and Carsten Murawski. "Uncertainty and computational complexity." Philosophical Transactions of the Royal Society B: Biological Sciences 374, no. 1766 (2018): 20180138. http://dx.doi.org/10.1098/rstb.2018.0138.

Full text

Abstract:

Modern theories of decision-making typically model uncertainty about decision options using the tools of probability theory. This is exemplified by the Savage framework, the most popular framework in decision-making research. There, decision-makers are assumed to choose from among available decision options as if they maximized subjective expected utility, which is given by the utilities of outcomes in different states weighted with subjective beliefs about the occurrence of those states. Beliefs are captured by probabilities and new information is incorporated using Bayes’ Law. The primary co

APA, Harvard, Vancouver, ISO, and other styles

17

Markella, Koutsouradi, Karkazis John, Siousiouras Petros, and Chondrogianni Dionysia. "The Complexity of the Caspian Basin." European Scientific Journal, ESJ 14, no. 26 (2018): 159. http://dx.doi.org/10.19044/esj.2018.v14n26p159.

Full text

Abstract:

The collapse of the Soviet Union and the emergence of newly independent States marked the uprising of a new era in the region of the Caspian Basin. Failing to reach a consensus regarding the legal nature of the Caspian, Russia, Turkmenistan, Iran, Azerbaijan, and Kazakhstan’s policies have been characterized by a perpetual pursuit of establishing themselves as key-role agents in the region. The question about “Lake or Sea” is yet to be answered after many decades. This paper focuses on analyzing the significance of the Caspian Basin for the littoral States and how it determines their political

APA, Harvard, Vancouver, ISO, and other styles

18

Matin, Abdul, and Jaya. "Sex Ratio Complexity in Selected States: A Tentative Observation." Journal of Exclusion Studies 6, no. 1 (2016): 30. http://dx.doi.org/10.5958/2231-4555.2016.00003.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Bob, Peter, Megan Golla, Phillip Epstein, and Lukasz Konopka. "EEG Complexity and Attentional Processes Related to Dissociative States." Clinical EEG and Neuroscience 42, no. 3 (2011): 175–79. http://dx.doi.org/10.1177/155005941104200306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Piqueira, José Roberto C., and Yuri Cássio Campbell-Borges. "Extending SDL and LMC complexity measures to quantum states." Physica A: Statistical Mechanics and its Applications 392, no. 20 (2013): 5255–59. http://dx.doi.org/10.1016/j.physa.2013.06.043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Aguiñaga, Adrian Rodriguez, and Miguel Angel Lopez Ramirez. "Emotional states recognition, implementing a low computational complexity strategy." Health Informatics Journal 24, no. 2 (2016): 146–70. http://dx.doi.org/10.1177/1460458216661862.

Full text

Abstract:

This article describes a methodology to recognize emotional states through an electroencephalography signals analysis, developed with the premise of reducing the computational burden that is associated with it, implementing a strategy that reduces the amount of data that must be processed by establishing a relationship between electrodes and Brodmann regions, so as to discard electrodes that do not provide relevant information to the identification process. Also some design suggestions to carry out a pattern recognition process by low computational complexity neural networks and support vector

APA, Harvard, Vancouver, ISO, and other styles

22

Klamut, Jarosław, Ryszard Kutner, and Zbigniew R. Struzik. "Towards a Universal Measure of Complexity." Entropy 22, no. 8 (2020): 866. http://dx.doi.org/10.3390/e22080866.

Full text

Abstract:

Recently, it has been argued that entropy can be a direct measure of complexity, where the smaller value of entropy indicates lower system complexity, while its larger value indicates higher system complexity. We dispute this view and propose a universal measure of complexity that is based on Gell-Mann’s view of complexity. Our universal measure of complexity is based on a non-linear transformation of time-dependent entropy, where the system state with the highest complexity is the most distant from all the states of the system of lesser or no complexity. We have shown that the most complex is

APA, Harvard, Vancouver, ISO, and other styles

23

Mealy, Penny, J. Doyne Farmer, and Alexander Teytelboym. "Interpreting economic complexity." Science Advances 5, no. 1 (2019): eaau1705. http://dx.doi.org/10.1126/sciadv.aau1705.

Full text

Abstract:

Two network measures known as the economic complexity index (ECI) and product complexity index (PCI) have provided important insights into patterns of economic development. We show that the ECI and PCI are equivalent to a spectral clustering algorithm that partitions a similarity graph into two parts. The measures are also closely related to various dimensionality reduction methods, such as diffusion maps and correspondence analysis. Our results shed new light on the ECI’s empirical success in explaining cross-country differences in gross domestic product per capita and economic growth, which

APA, Harvard, Vancouver, ISO, and other styles

24

Hospodár, Michal, Galina Jirásková, and Peter Mlynárčik. "Descriptional Complexity of the Forever Operator." International Journal of Foundations of Computer Science 30, no. 01 (2019): 115–34. http://dx.doi.org/10.1142/s0129054119400069.

Full text

Abstract:

We examine the descriptional complexity of the forever operator, which assigns the language [Formula: see text] to a regular language [Formula: see text], and we investigate the trade-offs between various models of finite automata. We consider complete and partial deterministic finite automata, nondeterministic finite automata with single or multiple initial states, alternating, and Boolean finite automata. We assume that the argument and the result of this operation are accepted by automata belonging to one of these six models. We investigate all possible trade-offs and provide a tight upper

APA, Harvard, Vancouver, ISO, and other styles

25

Yu, Lan Lan, and Tian Xing Meng. "The Sleep EEG Partition by Stages Based on Complexity Measure." Applied Mechanics and Materials 29-32 (August 2010): 2720–25. http://dx.doi.org/10.4028/www.scientific.net/amm.29-32.2720.

Full text

Abstract:

Sleep is the important phenomenon in human’s life. About third time of human is spent on sleeping in which many important physical course happen and develop so that the research of sleep EEG gets more and more regards. The beginning of sleep research often starts from right partition by stages. Different sleep stages correspond with different brain states so that the sleep partition by stages has important meaning for the research of the sleep EEG. In this paper, a method is given for sleep segmentation using Lempel-Ziv complexity. From the result of the simulation, it can be drawn that the co

APA, Harvard, Vancouver, ISO, and other styles

26

Еськов, Valeriy Eskov, Филатова, and O. Filatova. "Other World, Other Science, Other Models in Complexity Descreaption." Journal of New Medical Technologies 21, no. 1 (2014): 138–41. http://dx.doi.org/10.12737/3328.

Full text

Abstract:

The understanding of very special systems of third type was created according to W.Weaver efforts. The new theory of chaos – self- organization was created last 40 years and was based on other understanding of stationary mode of third type of systems and its very specific chaotic behavior. The analog of the systems with physical system was discussed too. The third type of systems (opposite of deterministic and stochastic systems) was presented. It was discussed the principle distinguishes between dynamics of such system and traditional systems according to Heisenberg uncertainty principle. Tra

APA, Harvard, Vancouver, ISO, and other styles

27

Joosten, Joost J., Fernando Soler-Toscano, and Hector Zenil. "Fractal Dimension versus Process Complexity." Advances in Mathematical Physics 2016 (2016): 1–21. http://dx.doi.org/10.1155/2016/5030593.

Full text

Abstract:

We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. For any particular such machineτand any particular inputx, we consider what we call thespace-timediagram which is basically the collection of consecutive tape configurations of the computationτ(x). In our setting, it makes sense to define a fractal dimension for a Turing machine as the limiting fractal dimension for the corresponding space-time diagrams. It turns out that there is a very strong relation between the fractal dimension of a Turing machine of the above-specified

APA, Harvard, Vancouver, ISO, and other styles

28

Passerini, Filippo, and Simone Severini. "Quantifying Complexity in Networks." International Journal of Agent Technologies and Systems 1, no. 4 (2009): 58–67. http://dx.doi.org/10.4018/jats.2009071005.

Full text

Abstract:

The authors introduce a novel entropic notion with the purpose of quantifying disorder/uncertainty in networks. This is based on the Laplacian and it is exactly the von Neumann entropy of certain quantum mechanical states. It is remarkable that the von Neumann entropy depends on spectral properties and it can be computed efficiently. The analytical results described here and the numerical computations lead us to conclude that the von Neumann entropy increases under edge addition, increases with the regularity properties of the network and with the number of its connected components. The notion

APA, Harvard, Vancouver, ISO, and other styles

29

Hospodár, Michal, and Galina Jirásková. "The complexity of concatenation on deterministic and alternating finite automata." RAIRO - Theoretical Informatics and Applications 52, no. 2-3-4 (2018): 153–68. http://dx.doi.org/10.1051/ita/2018011.

Full text

Abstract:

We study the state complexity of the concatenation operation on regular languages represented by deterministic and alternating finite automata. For deterministic automata, we show that the upper bound m2n − k2n−1 on the state complexity of concatenation can be met by ternary languages, the first of which is accepted by an m-state DFA with k final states, and the second one by an n-state DFA with ℓ final states for arbitrary integers m, n, k, ℓ with 1 ≤ k ≤ m − 1 and 1 ≤ ℓ ≤ n − 1. In the case of k ≤ m − 2, we are able to provide appropriate binary witnesses. In the case of k = m − 1 and ℓ ≥ 2,

APA, Harvard, Vancouver, ISO, and other styles

30

PIGHIZZINI, GIOVANNI, and JEFFREY SHALLIT. "UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION." International Journal of Foundations of Computer Science 13, no. 01 (2002): 145–59. http://dx.doi.org/10.1142/s012905410200100x.

Full text

Abstract:

In this paper we give the cost, in terms of states, of some basic operations (union, intersection, concatenation, and Kleene star) on regular languages in the unary case (where the alphabet contains only one symbol). These costs are given by explicitly determining the number of states in the noncyclic and cyclic parts of the resulting automata. Furthermore, we prove that our bounds are optimal. We also present an interesting connection to Jacobsthal's function from number theory.

APA, Harvard, Vancouver, ISO, and other styles

31

Zheng, Zheng Zhong, Jun Chang Zhao, Xiao Lin Huang, and Jun Wang. "Attention Electroencephalogram Analysis Based on Jensen-Shannon Divergence Analysis." Advanced Materials Research 749 (August 2013): 254–57. http://dx.doi.org/10.4028/www.scientific.net/amr.749.254.

Full text

Abstract:

In this paper, the complexity analysis method based on Jensen-Shannon Divergence was used to calculate the complexity of the Idle states, the close eyes states and the count numbers states electroencephalogram. The study found that the JSD value of close eyes states EEG was highest, followed by that of the Idle states EEG, and that of the count numbers states EEG was minimum. The result can be used to assisted clinical diagnosis.

APA, Harvard, Vancouver, ISO, and other styles

32

Hunter, Kennith G., Laura Ann Wilson, and Gregory G. Brunk. "Societal Complexity and Interest-Group Lobbying in the American States." Journal of Politics 53, no. 2 (1991): 488–503. http://dx.doi.org/10.2307/2131769.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Goldscheider, Frances K., and Regina M. Bures. "The Racial Crossover in Family Complexity in the United States." Demography 40, no. 3 (2003): 569. http://dx.doi.org/10.2307/1515160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Arbekov, I. M., and S. N. Molotkov. "Distinguishability of quantum states and shannon complexity in quantum cryptography." Journal of Experimental and Theoretical Physics 125, no. 1 (2017): 50–64. http://dx.doi.org/10.1134/s1063776117060085.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Nagy, Á., K. D. Sen, and H. E. Montgomery. "LMC complexity for the ground states of different quantum systems." Physics Letters A 373, no. 30 (2009): 2552–55. http://dx.doi.org/10.1016/j.physleta.2009.05.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Xue, Peng, Chuan-Feng Li, Yong-Sheng Zhang, and Guang-Can Guo. "Three-party quantum communication complexity via entangled tripartite pure states." Journal of Optics B: Quantum and Semiclassical Optics 3, no. 4 (2001): 219–22. http://dx.doi.org/10.1088/1464-4266/3/4/304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Crutchfield, James P., and Cosma Rohilla Shalizi. "Thermodynamic depth of causal states: Objective complexity via minimal representations." Physical Review E 59, no. 1 (1999): 275–83. http://dx.doi.org/10.1103/physreve.59.275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Goldscheider, Frances K., and Regina M. Bures. "The Racial Crossover in Family Complexity in the United States." Demography 40, no. 3 (2003): 569–87. http://dx.doi.org/10.1353/dem.2003.0022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Peng, Xue, Li Chuan-Feng, and Guo Guang-Can. "A Two-Party Probabilistic Communication Complexity Scenario via Werner States." Chinese Physics Letters 18, no. 10 (2001): 1305–7. http://dx.doi.org/10.1088/0256-307x/18/10/303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Niekamp, Sönke, Tobias Galla, Matthias Kleinmann, and Otfried Gühne. "Computing complexity measures for quantum states based on exponential families." Journal of Physics A: Mathematical and Theoretical 46, no. 12 (2013): 125301. http://dx.doi.org/10.1088/1751-8113/46/12/125301.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Katz, Daniel Martin, and M. J. Bommarito. "Measuring the complexity of the law: the United States Code." Artificial Intelligence and Law 22, no. 4 (2014): 337–74. http://dx.doi.org/10.1007/s10506-014-9160-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Noskov, Sergei, Oscar Teijido Hermida, Tatiana Rostovtseva, and Bezrukov Sergei. "Mapping Conformational States in VDAC1 Channel: Complexity of Gating Landscape." Biophysical Journal 106, no. 2 (2014): 234a. http://dx.doi.org/10.1016/j.bpj.2013.11.1371.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Blondin, Michael, Andreas Krebs, and Pierre McKenzie. "The complexity of intersecting finite automata having few final states." computational complexity 25, no. 4 (2014): 775–814. http://dx.doi.org/10.1007/s00037-014-0089-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Mateos, D. M., R. Guevara Erra, R. Wennberg, and J. L. Perez Velazquez. "Measures of entropy and complexity in altered states of consciousness." Cognitive Neurodynamics 12, no. 1 (2017): 73–84. http://dx.doi.org/10.1007/s11571-017-9459-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Wolf, Yuri I., Mikhail I. Katsnelson, and Eugene V. Koonin. "Physical foundations of biological complexity." Proceedings of the National Academy of Sciences 115, no. 37 (2018): E8678—E8687. http://dx.doi.org/10.1073/pnas.1807890115.

Full text

Abstract:

Biological systems reach hierarchical complexity that has no counterpart outside the realm of biology. Undoubtedly, biological entities obey the fundamental physical laws. Can today’s physics provide an explanatory framework for understanding the evolution of biological complexity? We argue that the physical foundation for understanding the origin and evolution of complexity can be gleaned at the interface between the theory of frustrated states resulting in pattern formation in glass-like media and the theory of self-organized criticality (SOC). On the one hand, SOC has been shown to emerge i

APA, Harvard, Vancouver, ISO, and other styles

46

Kollmann, Nancy Shields. "The Complexity of History." Historical Reflections/Réflexions Historiques 44, no. 1 (2018): 41–53. http://dx.doi.org/10.3167/hrrh.2018.440106.

Full text

Abstract:

This article finds Steven Pinker’s argument for a decline of violence too Eurocentric and generalizing to fit all cases. Study of the early modern Russian criminal law, and society in general, shows that different states can develop radically different approaches to violence when influenced by some of the same factors (in this case Enlightenment values). The centralized Muscovite autocracy in many ways relied less on official violence and exerted better control over social violence than did early modern Europe, while at the same time it supported violence in institutions such as serfdom, exile

APA, Harvard, Vancouver, ISO, and other styles

47

Hapsari, Dewi Anggraini Puspa, Widya Khafa Nofa, and Sugeng Santoso. "Analisis Kompleksitas Algoritma Filter IRR Shen-Castan untuk Deteksi Tepi pada Citra Digital." CCIT Journal 12, no. 2 (2019): 218–28. http://dx.doi.org/10.33050/ccit.v12i2.693.

Full text

Abstract:

This study aims to measurethe level of complexity of a Shen-Castan IIR filter algorithm for edge detection in digital images based on time complexity and space complexity. This analysis is very helpful when going to do an algorithm optimization and data structure that will be used in a system. Time complexity states how long an algorithm runs at runtime based on the input given. While space complexity states how much space in memory an algorithm needs when operating. The calculation of time complexity and space complexity is denoted by Big-O notation. From the results of time complexity calcul

APA, Harvard, Vancouver, ISO, and other styles

48

Bello-Osagie, Vivien, and Prof Nwogu N. Kevin. "Lexicalization and Complexity in Economic Community of West African States (ECOWAS) Peacekeeping Agreements." International Journal of Language and Literary Studies 1, no. 3 (2019): 85–99. http://dx.doi.org/10.36892/ijlls.v1i3.101.

Full text

Abstract:

The paper seeks to establish the level of lexical complexity in the discourse of Economic Community of West African States (ECOWAS) peacekeeping agreements (EPKA) and to describe the lexical strategies through which the observed complexity is created. Many studies on linguistic complexity focus on second language acquisition, assessment and writing development. But, this article focuses on lexical choices that create complexity capable of hindering reader’s comprehension. It utilizes quantitative and qualitative designs in its analysis of corpus which consists of ten purposively selected EPKA

APA, Harvard, Vancouver, ISO, and other styles

49

Silva, Jorge M., Eduardo Pinho, Sérgio Matos, and Diogo Pratas. "Statistical Complexity Analysis of Turing Machine tapes with Fixed Algorithmic Complexity Using the Best-Order Markov Model." Entropy 22, no. 1 (2020): 105. http://dx.doi.org/10.3390/e22010105.

Full text

Abstract:

Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexity because they create structures that follow algorithmic schemes, rather than generating symbols from a probabilistic function assuming independence. In the case of Turing machines, this means that machines with the same algorithmic complexity can create tapes with different statistical complexity. In this paper, we use a compression-based approach to measure global and local statistical complexity of specific Turing machine tapes with the same number of states and alphabet. Both measures are es

APA, Harvard, Vancouver, ISO, and other styles

50

Hunt, G. W., and T. J. Dodwell. "Complexity in phase transforming pin-jointed auxetic lattices." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 475, no. 2224 (2019): 20180720. http://dx.doi.org/10.1098/rspa.2018.0720.

Full text

Abstract:

We demonstrate the complexity that can exist in the modelling of auxetic lattices. By introducing pin-jointed members and large deformations to the analysis of a re-entrant structure, we create a material which has both auxetic and non-auxetic phases. Such lattices exhibit complex equilibrium behaviour during the highly nonlinear transition between these two states. The local response is seen to switch many times between stable and unstable states, exhibiting both positive and negative stiffnesses. However, there is shown to exist an underlying emergent modulus over the transitional phase, to

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!