We define a program size complexity function $H^\infty$ as a variant of the prefix-free Kolmogorov complexity, based on Turing monotone machines performing possibly unending computations. We consider definitions of randomness and triviality for sequences in ${\{0,1\}}^\omega$ relative to the $H^\infty$ complexity. We prove that the classes of Martin-Löf random sequences and $H^\infty$-random sequences coincide and that the $H^\infty$-trivial sequences are exactly the recursive ones. We also study some properties of $H^\infty$ and compare it with other complexity (...) functions. In particular, $H^\infty$ is different from $H^A$, the prefix-free complexity of monotone machines with oracle A. (shrink)

We reduce to a standard circuit-size complexity problem a relativisation of the $P = NP$ question that we believe to be connected with the same question in the model for computation over the reals defined by L. Blum, M. Shub, and S. Smale. On this occasion, we set the foundations of a general theory for computation over an arbitrary structure, extending what these three authors did in the case of rings.

Classical fractal dimensions have recently been effectivized by characterizing them in terms of real-valued functions called gales, and imposing computability and complexity constraints on these gales. This paper surveys these developments and their applications in algorithmic information theory and computational complexity theory.

One of the most efficient nondestructive methods for pipeline in-line inspection is magnetic flux leakage inspection. Estimating the size of the defect from MFL signal is one of the key problems of MFL inspection. As the inspection signal is usually contaminated by noise, sizing the defect is an ill-posed inverse problem, especially when sizing the depth as a complex shape. An actor-critic structure-based algorithm is proposed in this paper for sizing complex depth profiles. By learning with more information from the (...) depth profile without knowing the corresponding MFL signal, the algorithm proposed saves computational costs and is robust. A pinning strategy is embedded in the reconstruction process, which highly reduces the dimension of action space. The pinning actor-critic structure helps to make the reward for critic network more efficient when reconstructing the depth profiles with high degrees of freedom. A nonlinear FEM model is used to test the effectiveness of algorithm proposed under 20 dB noise. The results show that the algorithm reconstructs the depth profile of defects with good accuracy and is robust against noise. (shrink)

We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin's universal distribution to identify evidence in support of or in contravention of the claim that the world is algorithmic in nature. To this end statistical comparisons are undertaken of the frequency distributions of data from physical sources--repositories of information such as images, data stored in a hard drive, computer programs and DNA sequences--and the output frequency distributions generated by purely algorithmic means--by running (...) abstract computing devices such as Turing machines, cellular automata and Post Tag systems. Statistical correlations were found and their significance measured. (shrink)

A proof of the (propositional) Craig interpolation theorem for cut-free sequent calculus yields that a sequent with a cut-free proof (or with a proof with cut-formulas of restricted form; in particular, with only analytic cuts) with k inferences has an interpolant whose circuit-size is at most k. We give a new proof of the interpolation theorem based on a communication complexity approach which allows a similar estimate for a larger class of proofs. We derive from it several corollaries: (1) (...) Feasible interpolation theorems for the following proof systems: (a) resolution (b) a subsystem of LK corresponding to the bounded arithmetic theory S 2 2 (α) (c) linear equational calculus (d) cutting planes. (2) New proofs of the exponential lower bounds (for new formulas) (a) for resolution ([15]) (b) for the cutting planes proof system with coefficients written in unary ([4]). (3) An alternative proof of the independence result of [43] concerning the provability of circuit-size lower bounds in the bounded arithmetic theory S 2 2 (α). In the other direction we show that a depth 2 subsystem of LK does not admit feasible monotone interpolation theorem (the so called Lyndon theorem), and that a feasible monotone interpolation theorem for the depth 1 subsystem of LK would yield new exponential lower bounds for resolution proofs of the weak pigeonhole principle. (shrink)

Much human adaptation depends on the gradual accumulation of culturally transmitted knowledge and technology. Recent models of this process predict that large, well-connected populations will have more diverse and complex tool kits than small, isolated populations. While several examples of the loss of technology in small populations are consistent with this prediction, it found no support in two systematic quantitative tests. Both studies were based on data from continental populations in which contact rates were not available, and therefore these studies (...) do not provide a test of the models. Here, we show that in Oceania, around the time of early European contact, islands with small populations had less complicated marine foraging technology. This finding suggests that explanations of existing cultural variation based on optimality models alone are incomplete because demography plays an important role in generating cumulative cultural adaptation. It also indicates that hominin populations with similar cognitive abilities may leave very different archaeological records, a conclusion that has important implications for our understanding of the origin of anatomically modern humans and their evolved psychology. (shrink)

Over the past 50 years, rock music has been the prime mover of an emergent national recording industry in Australia. This is a story in turn of increasing size, complexity, diversity, and sophistication, before its ultimate decline into the 21st century. This story has not been told in full previously and this article is a first step to make good this gap in the historical and cultural sociology of popular music. In this study, which has two parts, we survey (...) record labels, recording techniques and forms, and the music that was bought and sold. In Part One we chronicled the emergence of modern record production, the rise of rock music, and the development of a local recording industry in Australia between 1945 and 1970. In Part Two we narrate the rise and fall of Australian local, regional and national rock music cultures and the ebb and flow of independent labels and their labyrinthine relations to the transatlantic centre of the world-system of rock music industry. In particular we focus on four aspects: 1) technological change: the dominance of the vinyl album in the 1970s but its eventual usurpation by cassettes and then compact discs before the ultimate decline of all formats in the rise of the internet and the i-pod; 2) infrastructure: the development of the recording industry as a system of recording studios and record factories; as a system of impresarios and musician management; and also as a system that integrates performance circuits, radio, television, film, and eventually computer, product placement, advertising, and promotion through the cultivation and manipulation of taste markets in consumer culture etc.; 3) business logistics and markets: the tracking of the record labels, their struggles for markets and copyright control, local and global; and 4) musical production and repertoire. Since the digital revolution started eating away firstly and most conspicuously at the recording industry, the 50 years from 1945 to 1995 can now more clearly be seen as the rise and fall of rock music and its major technological form, the vinyl record. This is why we call it ‘the vinyl age’. (shrink)

Business Ethics: A European Review, EarlyView.

This note is a continuation of our former paper ''Complexity of the r-query tautologies in the presence of a generic oracle.'' We give a very short direct proof of the nonexistence of t-generic oracles, a result obtained first by Dowd. We also reconstitute a proof of Dowd's result that the class of all r-generic oracles in his sense has Lebesgue measure one.

Hurley's high level of generality suggests that a control-theoretic framework underpins all of the phenomena in question, but this is problematic. In contrast to the action-perception domain, where the control-theoretic framework certainly applies, there is no evidence that this framework equally applies to feelings and emotions, such as pain, touch, and disgust, where mirroring and simulational mindreading are also found.

We refine the constructions of Ferrante-Rackoff and Solovay on iterated definitions in first-order logic and their expressibility with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite sets and can be eliminated. We prove optimal upper and lower bounds on the quantifier complexity of polynomial size formulas obtained from the iterated definitions. In the quantifier-free case and in the case of purely existential or universal quantifiers, we show that Ω (...) quantifiers are necessary and sufficient. The last lower bounds are obtained with the aid of the Yao-Håstad switching lemma. (shrink)

We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...) analytic quasi-orders on View the MathML source. These facts generalize analogous results for κ=ω obtained in Louveau and Rosendal [17] and Friedman and Motto Ros [6], and it also partially extends a result from Baumgartner [3] concerning the structure of the embeddability relation on linear orders of size κ. (shrink)

The canonical pair of a proof system P is the pair of disjoint NP sets where one set is the set of all satisfiable CNF formulas and the other is the set of CNF formulas that have P-proofs bounded by some polynomial. We give a combinatorial characterization of the canonical pairs of depth d Frege systems. Our characterization is based on certain games, introduced in this article, that are parametrized by a number k, also called the depth. We show that (...) the canonical pair of a depth d Frege system is polynomially equivalent to the pair (Ad+2,Bd+2) where Ad+2 (respectively, Bd+1) are depth d+1 games in which Player I (Player II) has a positional winning strategy. Although this characterization is stated in terms of games, we will show that these combinatorial structures can be viewed as generalizations of monotone Boolean circuits. In particular, depth 1 games are essentially monotone Boolean circuits. Thus we get a generalization of the monotone feasible interpolation for Resolution, which is a property that enables one to reduce the task of proving lower bounds on the size of refutations to lower bounds on the size of monotone Boolean circuits. However, we do not have a method yet for proving lower bounds on the size of depth d games for d>1. (shrink)

Human languages vary in terms of which meanings they lexicalize, but this variation is constrained. It has been argued that languages are under two competing pressures: the pressure to be simple (e.g., to have a small lexicon) and to allow for informative (i.e., precise) communication, and that which meanings get lexicalized may be explained by languages finding a good way to trade off between these two pressures. However, in certain semantic domains, languages can reach very high levels of informativeness even (...) if they lexicalize very few meanings in that domain. This is due to productive morphosyntax and compositional semantics, which may allow for construction of meanings which are not lexicalized. Consider the semantic domain of natural numbers: many languages lexicalize few natural number meanings as monomorphemic expressions, but can precisely convey very many natural number meanings using morphosyntactically complex numerals. In such semantic domains, lexicon size is not in direct competition with informativeness. What explains which meanings are lexicalized in such semantic domains? We will propose that in such cases, languages need to solve a different kind of trade‐off problem: the trade‐off between the pressure to lexicalize as few meanings as possible (i.e, to minimize lexicon size) and the pressure to produce as morphosyntactically simple utterances as possible (i.e, to minimize average morphosyntactic complexity of utterances). To support this claim, we will present a case study of 128 natural languages' numeral systems, and show computationally that they achieve a near‐optimal trade‐off between lexicon size and average morphosyntactic complexity of numerals. This study in conjunction with previous work on communicative efficiency suggests that languages' lexicons are shaped by a trade‐off between not two but three pressures: be simple, be informative, and minimize average morphosyntactic complexity of utterances. (shrink)

This work introduces a three-dimensional, highly nonlinear quadratic oscillator with no linear terms in its equations. Most of the quadratic ordinary differential equations such as Chen, Rossler, and Lorenz have at least one linear term in their equations. Very few quadratic systems have been introduced and all of their terms are nonlinear. Considering this point, a new quadratic system with no linear term is introduced. This oscillator is analyzed by mathematical tools such as bifurcation and Lyapunov exponent diagrams. It is (...) revealed that this system can generate different behaviors such as limit cycle, torus, and chaos for its different parameters’ sets. Besides, the basins of attractions for this system are investigated. As a result, it is revealed that this system’s attractor is self-excited. In addition, the analog circuit of this oscillator is designed and analyzed to assess the feasibility of the system’s chaotic solution. The PSpice simulations confirm the theoretical analysis. The oscillator’s time series complexity is also investigated using sample entropy. It is revealed that this system can generate dynamics with different sample entropies by changing parameters. Finally, impulsive control is applied to the system to represent a possible solution for stabilizing the system. (shrink)

In this article I discuss some of the findings of an on-going ethnographic study of two once-weekly circuit training classes held in one of the growing number of private health and fitness clubs. The article has four aims. First, to demonstrate and explore the active role of the body in a central practice of body modification/maintenance: i.e. circuit training. Second, to demonstrate that circuit training is a social structure which both shapes the activity of the agent and is shaped by (...) that (shaped) agent. I aim also to explore this structuration process. Third, to draw out a number of aspects of the sociality of body maintenance/modification. Training, I argue, is a form of symbolic interaction, localized within specific and durable social networks. The final aim of the article is to weave these various claims together into a coherent overall account of circuit training as a form of body modification. As an investigation of the embodied nature of practices of body maintenance and the active role of social agents in relation to these practices the article rejoins an important strand of sociological investigations of ‘the body’. At the same time, however, the article seeks to challenge those approaches, often rooted in Foucauldian analysis, which portray the body as ‘docile’ in relation to body maintenance. Foucauldian inspired studies often reify practices of modification as ‘technologies’ or ‘apparatuses’, ignoring the active role of embodied agents in these practices and eliding the difference between texts which prescribe ways of acting and the more messy and complex reality of those ways of acting. (shrink)

Rice's Theorem says that every nontrivia semantic property of programs is undecidable. In this spirit we show the following: Every nontrivia absolute counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect analogue of Rice's Theorem.

We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game (cf. [3]) and of real communication complexity, and relate this complexity to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (defined in [4, Definition 2.2]) of small real communication complexity solving the monotone communication complexity problem associated with the bipartite perfect matching problem. This work is motivated by a research in interpolation theorems (...) for prepositional logic (by a problem posed in [5, Section 8], in particular). Our main objective is to extend the communication complexity approach of [4, 5] to a wider class of proof systems. In this direction we obtain an effective interpolation in a form of a protocol of small real communication complexity. Together with the above mentioned lower bound for tree-like protocols this yields as a corollary a lower bound on the number of steps for particular semantic derivations of Hall's theorem (these include tree-like cutting planes proofs for which an exponential lower bound was demonstrated in [2]). (shrink)

Some Indigenous Australians have embraced developmental origins of health and disease (DOHaD) and epigenetic discourses to highlight the legacies of slow violence in a settler colonial context. Despite important differences between Indigenous and scientific knowledges, some Indigenous scholars are positioning DOHaD and epigenetics as a resource to benefit their communities. This article argues that time plays a crucial role of brokering disparate knowledge spaces in Indigenous discourses of postgenomics, with both Indigenous cosmological frames and DOHaD/epigenetics centring a circular temporal model. (...) Drawing on interview data with scientists who work in Indigenous health, and broader ethnographic work in Indigenous Australian contexts where epigenetics is deployed, this article explores how different circularities of space and time become entangled to co-produce narratives of historical trauma. We use the concept of biocircularity to understand the complex ways that Indigenous and postgenomic temporalities are separated and connected, circling each other to produce a postcolonial articulation of postgenomics as a model of collective embodiment and distributed responsibility. (shrink)

On February 11, 2003, the Second Circuit ruled in Cicio v. Vytra Healthcare that patients may in some cases sue health maintenance organizations for medical malpractice under state law. The decision is particularly notable for opening the door to state tort claims in an area that had heen considered preempted by the Employee Retirement Income Security Act of 1974.ERISA is a federal statute that regulates employee benefit plans, establishing a complex set of rules and minimum standards for most health and (...) pension plans in private industry. ERISA requires that participants receive certain information about their benefits plans, and imposes fiduciary responsibilities on individuals with discretionary control over plan assets. These individuals have certain specific duties, and are required to work “solely in the interest of the participants and beneficiaries and for the exclusive purpose of: providing benefits to participants and their beneficiaries; and defraying reasonable expenses of administering the plan.”. (shrink)

On February 11, 2003, the Second Circuit ruled in Cicio v. Vytra Healthcare that patients may in some cases sue health maintenance organizations for medical malpractice under state law. The decision is particularly notable for opening the door to state tort claims in an area that had heen considered preempted by the Employee Retirement Income Security Act of 1974.ERISA is a federal statute that regulates employee benefit plans, establishing a complex set of rules and minimum standards for most health and (...) pension plans in private industry. ERISA requires that participants receive certain information about their benefits plans, and imposes fiduciary responsibilities on individuals with discretionary control over plan assets. These individuals have certain specific duties, and are required to work “solely in the interest of the participants and beneficiaries and for the exclusive purpose of: providing benefits to participants and their beneficiaries; and defraying reasonable expenses of administering the plan.”. (shrink)

Short circuit is a key factor which drastically affects the efficiency of metal electrorefining. Infrared image of the intercell busbar region is used to perform short circuit detection. To cope with the high thermal background, a two-level short circuit detection method is designed. Firstly, with background subtraction, high intensity short circuit electrodes, as well as the background, are removed, and normal working electrodes are preserved. In the second stage, suspicious short circuit areas are sifted out by normal electrode detecting and (...) texture period estimation. Gaussian difference filter which is based on the human visual system is improved to match the target gray distribution. A comparative experiment indicates that the proposed orthogonal DoG outperforms the original DoG and top-hat in the accuracy of normal electrode detection. The two-level detection method in this paper is applied in a copper electrolysis plant and exhibits superiority in locating short circuits and avoiding miss detection. (shrink)

In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired output via a possibly non-halting computation. Clearly this function gives a lower bound of the classical Kolmogorov complexity. In particular, if the machine is allowed to overwrite its output, this complexity coincides with the classical Kolmogorov complexity for halting (...) computations relative to the first jump of the halting problem. However, on machines that cannot erase their output –called monotone machines–, we prove that our complexity for non effective computations and the classical Kolmogorov complexity separate as much as we want. We also consider the prefix-free complexity for possibly infinite computations. We study several properties of the graph of these complexity functions and specially their oscillations with respect to the complexities for effective computations. (shrink)

Cluster growth models are utilized for a wide range of scientific and engineering applications, including modeling epidemics and the dynamics of liquid propagation in porous media. Invasion percolation is a stochastic branching process in which a network of sites is getting occupied that leads to the formation of clusters. The occupation of sites is governed by their resistance distribution; the invasion annexes the sites with the least resistance. An iterative cluster growth model is considered for computing the expected size and (...) perimeter of the growing cluster. A necessary ingredient of the model is the description of the mean perimeter as the function of the cluster size. We propose such a relationship for the site square lattice. The proposed model exhibits the expected phase transition of percolation models, i.e., it diverges at the percolation threshold p c. We describe an application for the porosimetry percolation model. The calculations of the cluster growth model compare well with simulation results. (shrink)

In this paper, a novel no-equilibrium 5D memristive hyperchaotic system is proposed, which is achieved by introducing an ideal flux-controlled memristor model and two constant terms into an improved 4D self-excited hyperchaotic system. The system parameters-dependent and memristor initial conditions-dependent dynamical characteristics of the proposed memristive hyperchaotic system are investigated in terms of phase portrait, Lyapunov exponent spectrum, bifurcation diagram, Poincaré map, and time series. Then, the hidden dynamic attractors such as periodic, quasiperiodic, chaotic, and hyperchaotic attractors are found under (...) the variation of its system parameters. Meanwhile, the most striking phenomena of hidden extreme multistability, transient hyperchaotic behavior, and offset boosting control are revealed for appropriate sets of the memristor and other initial conditions. Finally, a hardware electronic circuit is designed, and the experimental results are well consistent with the numerical simulations, which demonstrate the feasibility of this novel 5D memristive hyperchaotic system. (shrink)

The terms complexity, complex adaptive systems, and sciences of complexity are found often in recent scientific literature, reflecting the remarkable growth in collaborative academic research focused on complexity from the origin and dynamics of organisms to the largest social and political organizations. One of the great challenges in this field of research is to discover which features are essential and shared by all of the seemingly disparate systems that are described as complex. Is there sufficient synthesis to (...) suggest the possibility of an overarching science of complexity? This report describes current views on this subject held by various eminent scholars associated with the Santa Fe Institute.The physical sciences have traditionally been concerned with “simple” systems whose dynamics can be described in mathematical terms with precision and certainty. In contrast, the biological and social sciences are inevitably concerned with self-organized or social “complex” systems whose detailed behaviors appear to be unpredictable. The two categories differ greatly in size and diversity, prompting the late mathematician Stanislaus Ulam to remark that research on complex systems might be compared to the study of non-elephants. Nevertheless, certain integrative themes have begun to emerge.Rising activity in this field of research runs completely counter to the trend toward increasing fragmentation and specialization in the sciences. It has stimulated a resurgence of interest in a broad synthesis involving mathematics, computational science, physics, chemistry, biology, neuroscience, and the social sciences. The growth of effort in this very extended field has been greatly stimulated by the development of new computational tools that are capable of dealing with vast, interrelated databases. Many of the participants in complexity research feel that it is now time to reintegrate the fragmented interests of much of the academic community. The reader is encouraged to consider whether such views are sparking a historic renaissance of scholarship or represent a passing scientific diversion. (shrink)

We present results from numerical studies of supervised learning operations in recurrent networks considered as graphs, leading from a given set of input conditions to predetermined outputs. Graphs that have optimized their output for particular inputs with respect to predetermined outputs are asymptotically stable and can be characterized by attractors which form a representation space for an associative multiplicative structure of input operations. As the mapping from a series of inputs onto a series of such attractors generally depends on the (...) sequence of inputs, this structure is generally noncommutative. Moreover, the size of the set of attractors, indicating the complexity of learning, is found to behave non-monotonically as learning proceeds. A tentative relation between this complexity and the notion of pragmatic information is indicated. (shrink)

The alleged robustness of Z, t, and F tests against nonnormality and, when sample sizes are equal, of t and F tests against heterogeneity as well was investigated in a large-scale sampling study under conditions realistic to experimentation and testing in the behavioral sciences. Factors varied were: population shape (L or bell), σ1/σ2 (1/2, 1, or 2), size N of smallest sample (2, 4, 8, 16, 32, 64, 128, 256, 512, or 1,024), N1/N2 (1/3,1/2,1, 2, or 3), α (.05,.01, or.001), (...) and test tailedness (left, right, or two). In about 25% of the situations investigated, the test failed to meet a very lax criterion for robustness at every examined N value less than 100, and in 8% at every value less than 1,000; no test met the criterion in all of the situations studied before N=512. Robustness was strongly influenced by all of the factors investigated, and interactions among the influencing factors were often strong and complex. (shrink)

Science and technology policy is often confronted with issues that are both complex and controversial and which have to be decided upon in a delicate constellation of policy-makers, experts, stakeholders, non-governmental organizations and the public. One attempt to deal with such a complex problem is via citizen involvement. Participatory technology assessment (pTA) already goes back to several decades, and countries have made various experiences. While in some countries, governments established technology assessment organizations, which also included pTA in their methodological portfolio, (...) others primarily rely on experts to make decisions on science and technology policy. In a third group of countries non-state actors, such as social scientists, experimented with pTA. However, they were often unable to link these experiments to policy-making. This paper deals with the question of why this variation exists and compares the use of pTA in Switzerland and Austria. Despite similarities between the two countries, both had quite different experiences with pTA so far. Whereas several pTAs have been carried out in Switzerland until today, Austrian pTAs have remained infrequent. The aim of this paper is to explain this difference as a result of different ways of policy-making which affect the use and chances of pTA. (shrink)

The book of Aristarchus of Samos, On the distances and sizes of the sun and moon, is one of the few pre-Ptolemaic astronomical works that have come down to us in complete or nearly complete form. The simplicity and cleverness of the basic ideas behind the calculations are often obscured in the reading of the treatise by the complexity of the calculations and reasoning. Part of the complexity could be explained by the lack of trigonometry and part by (...) the fact that Aristarchus appears unwilling to make some simplifications that could be simply taken for granted. But an important part of the complexities is due to some unnecessary inconsistencies, as recently discovered by Berggren and Sidoli (Arch Hist Exact Sci 61:213–254, 2007). In the first part of this paper, I will try to show that some of these inconsistencies are just apparent. But the complexity of the calculations and reasoning is not the only reason that could disturb a reader of the treatise. The great inaccuracy—even for the measurement methods and instruments available at those times—of one of the three input values of the treatise is really astonishing. In the sixth and last hypothesis, Aristarchus states that the moon’s apparent size is equal to 2∘\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^{\circ }$$\end{document}, while the correct value is one-fourth of that. Some attempts have been made in order to explain such a big value, but all of them have problems. In the second part of this paper, I will propose a new speculative but plausible explanation of the origin of this value. (shrink)

This paper is devoted to introduce a novel fourth-order hyperchaotic system. The hyperchaotic system is constructed by adding a linear feedback control level based on a modified Lorenz-like chaotic circuit with reduced number of amplifiers. The local dynamical entities, such as the basic dynamical behavior, the divergence, the eigenvalue, and the Lyapunov exponents of the new hyperchaotic system, are all investigated analytically and numerically. Then, an active control method is derived to achieve global chaotic synchronization of the novel hyperchaotic system (...) through making the synchronization error system asymptotically stable at the origin based on Lyapunov stability theory. Next, the proposed novel hyperchaotic system is applied to construct another new hyperchaotic system with circuit deformation and design a new hyperchaotic secure communication circuit. Furthermore, the implementation of two novel electronic circuits of the proposed hyperchaotic systems is presented, examined, and realized using physical components. A good qualitative agreement is shown between the simulations and the experimental results around 500 kHz and below 1 MHz. (shrink)

In this paper, a stochastic simulation model for a standalone PV system sizing is replicated and extended to supply a dairy’s power demand. A detailed hourly-based simulation is conducted considering an hourly load profile and global solar radiation prediction model. The stochastic simulation model is based on a thorough statistical analysis of the solar radiation data and simulates the energy yield, the excess energy curtailed, and the state of charge of the batteries for the sizing month and the whole year, (...) providing the designer autonomy factor values d to properly size the PV system, finding the optimum combination of installed peak power P m and battery storage capacity C L that meets the application load requirements, considering a preset reliability level at minimum cost. The model makes use of the NASA’S Surface Meteorology and Solar Energy database to obtain solar radiation data. Results show a substantial reduction of 44% in installed peak power and battery storage capacity when compared to conventional methodologies, considering three days of autonomy, and an 85% reduction considering four days. Considering the goodness of fit test results, the Wakeby distribution best represents the behavior of historical solar radiation data for the site in almost half of the months. This article seeks to contribute to the literature gap in the application of methodologies for the multicomponent power supply in the dairy industry through the use of renewable energy. (shrink)