The article discusses the possibilities of the formal analysis of the fine-art painting composition on the basis of the classical definitions of beauty and computational aesthetics’ approaches of the second half of the 20th century he authors define the problem and consider solutions for the formalization of aesthetic perception in the context of aesthetic text, i.e., as part of the fine arts composition – a formal sequence of signs simply ordered in accordance with the syntactic rules’ system. The methodology (...) of the research is defined by the general semiotics, distinguishing semantics, syntax, and pragmatics of a sign, by the aesthetic analysis’ methods, ranging according to the author’s message aesthetics, receptive aesthetics, and text aesthetics, as well as by the computational analysis methods connected with neural network means of defining the images’ symmetry. The article reveals preconditions for the emergence and also the current state of computational aesthetics as an interdisciplinary branch of knowledge. Analyzing the problem from the perspective of philosophy, aesthetics, semiotics, and technology, the authors draw attention to the need to improve the computational aesthetics methods. Firstly, the existing methods do not always enable to describe the fine-art object adequately. Secondly, there exists the so-called reduction of aesthetic assertion transforming it into the assertion concerning the object’s external characteristics. As a result, the authors assume that the increasing complexity of the current mathematical models and the experts’ subjective assessment support will allow to reach a compromise solution that enables the development of computational aesthetics as a branch of knowledge. Enhancement and development of the mathematical models, taking into account the rules of semiotics and subjectivism of the human perception, is the relevant objective of computational analysis of the aesthetic fine-arts text. The results of the present research supports the classic statement regarding the underivability of semantic and pragmatic propositions from syntax. The research concludes that relevant objectives are to find a correlation between, one the one hand, the axes and points of symmetry, deriving from the neural simulation, and, on the other hand, aesthetic effect, emerging from the perception of fine-art paintings. (shrink)

Energy contributes significantly in almost all aspects of human life as well as economic activities and plays a crucial role in the infrastructural development of a county to alleviate poverty. Generating energy from a renewable source such as small hydropower through the application of pump operating as a turbine mode called Pump as Turbine is one of the best alternatives to provide clean and inexpensive energy. Using Pump as Turbine helps in generating reasonably priced hydroelectric power for communities in underdeveloped (...) counties. This study investigates the effects of internal flow behaviour and performance of Pump as Turbine under different rotational speed and flow rate. The rotational speed is an essential physical parameter as it affects the Pump as Turbine operation. A model-specific speed centrifugal pump model with head 32, flow rate of 12.5 and the rotational speed of 2900 rpm, has been selected for the study. Numerical simulations have been conducted using the k-ω turbulence model to solve three-dimensional equations. The pump mode experimental data were used to confirm the results for better analysis. The results predicted that vortex and turbulent kinetic energy increase per rotational speed increase. Also, at the higher rotational speed, very high recirculation of flow is detected at the blade suction chamber, although the pressure side has a smooth flow. This study provides beneficial information which will serve as a reference to help improve PAT performance along with selecting PAT for a small hydropower site. Future works will consider the impact of blade thickness and cavitation in Pump as Turbine. (shrink)

We study computability of the abstract linear Cauchy problem equation image)where A is a linear operator, possibly unbounded, on a Banach space X. We give necessary and sufficient conditions for A such that the solution operator K: x ↦ u of the problem is computable. For studying computability we use the representation approach to computable analysis developed by Weihrauch and others. This approach is consistent with the model used by Pour-El/Richards.

INTRODUCTION In the course of their excavations on Delos, the sacred island of Apollo, archaeologists discovered considerable remains of an Egyptian cult. ...

In this thesis, we study the complexity of some mathematical problems: in particular, those arising in computable analysis and algorithmic learning theory for algebraic structures. Our study is not limited to these two areas: indeed, in both cases, the results we obtain are tightly connected to ideas and tools coming from different areas of mathematical logic, including for example descriptive set theory and reverse mathematics.After giving the necessary preliminaries, we first study the uniform computational strength of the Cantor–Bendixson (...) theorem in the Weihrauch lattice. This work falls into the program connecting reverse mathematics and computable analysis via the framework of Weihrauch reducibility. We concentrate on problems related to perfect subsets of Polish spaces, studying the perfect set theorem, the Cantor–Bendixson theorem, and various problems arising from them. As far as we know, this is the first systematic study of problems at the level of $\mathbf {\Pi }^1_1\mathsf {-CA}_0$ in the Weihrauch lattice. We show that the strength of some of the problems we study depends on the topological properties of the Polish space under consideration, while others have the same strength once the space is rich enough.We continue considering problems related to (induced) subgraphs. We provide results on the (effective) Wadge complexity of sets of graphs, that are also used to determine the Weihrauch degree of certain decision problems. The decision problems we consider are defined for a fixed graph G, and they take as input a graph H, answering whether G is an (induced) subgraph of H: we also consider the opposite problem (i.e., answering whether H is an induced subgraph of G). We conclude this part on (induced) subgraphs considering the Weihrauch degree of “search problems.”These problems are defined for a fixed graph G, and they take as input a graph H such that G is an (induced) subgraph H: the output is a copy of G in H. In both cases, we highlight differences and analogies between the subgraph and the induced subgraph relation.We then move our attention to algorithmic learning theory, and we present the framework we use to study the learnability of families of algebraic structures: here, given a countable family of pairwise nonisomorphic structures $\mathfrak {K}$, a learner receives larger and larger pieces of an arbitrary copy of a structure in $\mathfrak {K}$ and, at each stage, is required to output a conjecture about the isomorphism type of such a structure. We say that $\mathfrak {K}$ is learnable if there exists a learner which eventually stabilizes to a correct guess. The framework was lacking a method for comparing the complexity of nonlearnable families, and so we propose a solution to this problem using tools coming from invariant descriptive set theory. To do so, we first prove that a family of structures is learnable if and only if its learning domain is continuously reducible to the relation $E_0$ of eventual agreement on infinite binary sequences and then, replacing $E_0$ with Borel equivalence relations of higher complexity, we obtain a new hierarchy of learning problems. This leads to the notion of E-learnability, where a family of structures $\mathfrak {K}$ is E-learnable, for a Borel equivalence relation E, if there is a continuous reduction from the isomorphism relation associated with $\mathfrak {K}$ to E. It is then natural to ask how the notion of E-learnability interacts with “classical” learning paradigms.Finally, we study the number of mind changes that a learner needs to learn a given family, both from a topological and a combinatorial point of view, and we consider how the complexity of a learner (in terms of Turing reducibility) affects the number of mind changes for learning a given family.Abstract prepared by Vittorio Cipriani.E-mail: [email protected]: https://air.uniud.it/handle/11390/1252226. (shrink)

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain (...) choice principles such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn—Banach Theorem and Weak Kőnig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this we compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example. (shrink)

In this article, we use a mix of computational techniques to identify textual shifts in the Ottoman şeyhülislams’ fetvas between the sixteenth and twentieth centuries. Our analysis, supplemented by a close reading of these texts, indicates that the fetvas underwent multiple forms of transformation, a consequence of the institutional evolution of the şeyhülislam’s fetva office that aimed to speed up and streamline the production of the fetvas: over time, the texts appropriated a more uniform character and came to contain (...) shorter responses. In the compositions of the questions, we identified many “trigger terms” that facilitated reflexive responses independent of the fetvas’ jurisprudential contexts, a tendency that became stronger after the second half of the seventeenth century. In addition, we propose in the article a methodology that measures the relative strengths of textual and conceptual links among the fetva corpora of various Ottoman şeyhülislams. This analysis informs us about possible paths of long-term evolution of this genre of jurisprudential documents. (shrink)

We investigate Turing's contributions to computability theory for real numbers and real functions presented in [22, 24, 26]. In particular, it is shown how two fundamental approaches to computable analysis, the so-called ‘Type-2 Theory of Effectivity' (TTE) and the ‘realRAM machine' model, have their foundations in Turing's work, in spite of the two incompatible notions of computability they involve. It is also shown, by contrast, how the modern conceptual tools provided by these two paradigms allow a systematic interpretation (...) of Turing's pioneering work in the subject. (shrink)

The confrontations of stakeholder visions about agriculture and food production has become a focal point in the public sphere, coinciding with a diversification of agrifood models. This study analyzes the debates stemming from the coexistence of these models, particularly during the initial term of neoliberal-centrist Emmanuel Macron’s presidency in France. Employing collective monitoring from 2017 to 2021, a corpus of 958 online news and blog articles was compiled. Using a computational analysis, we reveal the framings and controversies emerging from (...) this media discourse. The macro-structuring of discourse on model coexistence revolves around scientific, economic and political framings. Coexistence is a complex of debates based on specific frames associated with specific arenas and actor configurations: growth of organic agriculture, transformations of agrifood systems, sciences of production and impacts, livestock and meat diet controversies, agroecological innovations, CAP reform criticism, discourse of peasant agriculture and State-Profession _co-gestion_. Employing global sentiment analysis and focusing on salient controversies, namely EGAlim law, pesticide regulations, and agribashing, we show the shift from conciliation to a hardening of debates. Finally, we discuss the causes and consequences of this trend. The political will to support the transition of agriculture remains influenced by the _co-gestion_ system, an inherited configuration of decision-makers instrumental in the agricultural modernization. As a consequence, significant agricultural challenges, particularly highlighted in the scientific macro-frame, persist unresolved. This lock-in of the agrifood system is based on defensive strategies that challenge the democratic debate about food and agricultural practices. (shrink)

In this study, we use temporally aligned word embeddings and a large diachronic corpus of English to quantify language change in a data-driven, scalable way, which is grounded in language use. We show a unique and reliable relation between measures of language change and age of acquisition (AoA) while controlling for frequency, contextual diversity, concreteness, length, dominant part of speech, orthographic neighborhood density, and diachronic frequency variation. We analyze measures of language change tackling both the change in lexical representations and (...) the change in the relation between lexical representations and the words with the most similar usage patterns, showing that they capture different aspects of language change. Our results show a unique relation between language change and AoA, which is stronger when considering neighborhood-level measures of language change: Words with more coherent diachronic usage patterns tend to be acquired earlier. The results support theories positing a link between ontogenetic and ethnogenetic processes in language. (shrink)

In informal argument, an essential step is to ask what will “resonate” with a particular audience and hence persuade. Marketers, for example, may recommend a certain colour for a new soda can becau...

This paper explores the application of an affective content analysis to a selection of nanotechnology news articles gathered from selected newspapers. Thematic content analyses dominate current efforts to mine large text collections of popular science media; the addition of an affective analysis element can yield useful information to supplement future content analysis efforts. Using Whissell’s Dictionary of Affect in Language , the analysis rates news articles gathered over a twenty-two year period for their pleasantness, activeness, and (...) imagery, determining the mean affective tone in each category for the entire collection, four ‘content themes’ (business, national security, health, and environment), and the change in affective tone over the twenty-two year period these articles represent. Whereas the entire collection analyzed as a whole rates very similarly to the average found for everyday English language use and the ‘content themes’ show similar results, the change in affective tone over the years has been both significant and striking. A sample of results from three years of the twenty-two year period is then qualitatively explored to demonstrate to the reader the connection between the quantitative results of the Dictionary and the qualitative effect of the article’s word use and phrasing. The paper ends with a review of the technique’s success, implications for policymaking and public dialogue, and avenues for future use. (shrink)

This article is a computational enquiry into the different ways in which two words, assumed to be central to the eighteenth-century concept of aesthetics, were used across that century. Using word co-association measures designed specifically for this study, I show the markedly different lexis that surrounded the words ‘beauty’ and ‘beautiful’ in three decades of historical textual data from Eighteenth-Century Collections Online. Having demonstrated that these words were used in very different semantic contexts in the beginning, middle, and end of (...) the century, the article presents semantic network diagrams which further demonstrate the distinctness of noun from adjective. I argue that while ‘beautiful’ is suspended in a semantic space that is recognizably aesthetic, ‘beauty’ is not. Furthermore, that which is deemed ‘beautiful,’ according to the evidence presented here, presents something of a challenge to received narratives of how the concept of aesthetics developed throughout the eighteenth century. (shrink)

Social scientists and computer scientist are divided by small differences in perspective and not by any significant disciplinary divide. In the field of text analysis, several such differences are noted: social scientists often use unsupervised models to explore corpora, whereas many computer scientists employ supervised models to train data; social scientists hold to more conventional causal notions than do most computer scientists, and often favor intense exploitation of existing algorithms, whereas computer scientists focus more on developing new models; and (...) computer scientists tend to trust human judgment more than social scientists do. These differences have implications that potentially can improve the practice of social science. (shrink)

This article starts with the analysis of the existing electronic commerce system, summarizes its characteristics, and analyzes and solves its existing problems. Firstly, the characteristics of the relational database My Structured Query Language and the distributed database HBase are analyzed, their respective advantages and disadvantages are summarized, and the advantages and disadvantages of each are taken into account when storing data. My SQL is used to store structured business data in the system, while HBase is used to store unstructured (...) data such as pictures. These two storage mechanisms together constitute a data storage subsystem. Secondly, considering the large amount of data in the e-commerce system and the complex calculation of the data mining algorithm, this paper uses MapReduce to realize the parallelization of the data mining algorithm and builds a Hadoop-based commodity recommendation subsystem on this basis. We use JavaEE technology to design a full-featured web mall system. Finally, based on the impact of cloud computing, mobile e-commerce is analyzed, including relevant theories, service mode, architecture, core technology, and the application in e-commerce, which can realize e-commerce precision marketing, find the optimal path of logistics, and take effective security measures to avoid transaction risks. This method can avoid the disadvantages of the traditional e-commerce, where large-scale data cannot be processed in a timely manner, realize the value of mining data behind, and realize the precision marketing of e-commerce enterprises. (shrink)

With the progress of social production, the competition for talents among enterprises is fierce, and the market often lacks capable leaders, which leads to the lack of management of enterprise employees and cannot bring more economic benefits to enterprises. Traditional leaders make subordinate employees work actively and achieve the common goal of the enterprise by exerting their own leadership characteristics and observing their subordinates, but they cannot take care of the psychological state of each employee, resulting in the employee's work (...) efficiency is not very high. In recent years, charismatic leadership has become an important economic leader in the new era, and the theoretical spirit of charismatic leadership can well guide employees to work actively. Artificial intelligence affective computing can well identify the psychological state of the subject, and the combination of artificial intelligence affective computing and charismatic leadership can achieve effective management of employees through the predictive analysis of employees' psychological state. This paper compares the psychological state prediction analysis of employees' work attitudes between charismatic leaders based on artificial intelligence affective computing and traditional leaders through experiments. The results show that: charismatic leaders based on artificial intelligence affective computing predictive analytics can improve sensitivity to employee needs, resulting in an 8.2% increase in employee trust in leadership, a 4.4% increase in employee commitment to achieving organizational goals, and a 19.3% increase in employee job satisfaction. The psychological state prediction analysis of charismatic leaders based on artificial intelligence affective computing on employees' work attitudes can improve the work efficiency of employees and the economic benefits of enterprises. (shrink)

Three variants of Kurt Gödel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of Gödel's argument the two variants contributed by Anderson and Fitting avoid modal collapse. Although they appear quite different on a cursory reading they are in fact closely related. This has been revealed in the computer-supported formal analysis presented in this article. Key to our formal analysis is the (...) utilization of suitably adapted notions of ultrafilters, and a careful distinction between extensions and intensions of positive properties. (shrink)

Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of classical mathematics is rather restricted in scope due to the existence of sentences without computational content which are provable from the law of excluded middle and which involve only two quantifier alternations. By contrast, we show that the proof mining of classical Nonstandard Analysis has a (...) very large scope. In particular, we will observe that this scope includes any theorem of pure Nonstandard Analysis, where 'pure' means that only nonstandard definitions are used. In this note, we survey results in analysis, computability theory, and Reverse Mathematics. (shrink)

By the Riesz representation theorem for the dual of C [0; 1], if F: C [0; 1] → ℝ is a continuous linear operator, then there is a function g: [0;1] → ℝ of bounded variation such that F = ∫ f dg . The function g can be normalized such that V = ‖F ‖. In this paper we prove a computable version of this theorem. We use the framework of TTE, the representation approach to computable (...) class='Hi'>analysis, which allows to define natural computability for a variety of operators. We show that there are a computable operator S mapping g and an upper bound of its variation to F and a computable operator S ′ mapping F and its norm to some appropriate g. (shrink)

Understanding students’ psychological pressure and bad emotional reaction can solve psychological problems as soon as possible and avoid affecting students’ normal study life. With the improvement of global scientific and technological strength, and the step-by-step in-depth research on deep learning and computational intelligence optimization. Now, we have enough conditions to build a psychological and emotional data set for the field of education, and build a mental health stress detection model with emotional analysis function. In addition, a variety of experimental (...) methods are used for comparison, which shows the superior performance of the model in practical application scenarios. The results show that: the data set constructed for the model is reasonable. Psychological stress test shows that the tested college students are in good health and have no positive performance. Schools need to pay special attention to obsessive–compulsive disorder and interpersonal sensitivity, and the average values of both indicators are higher than 0.9. For the optimization of ant colony algorithm computational intelligence, both the stability and the average execution time of the algorithm are obviously higher than those of other algorithms. This model has obvious performance advantages after using this algorithm. Using loss function value to measure the difference between simulated emotion analysis and real value. The difference of most emotion tests is less than 3%; the accuracy difference between sadness and fear is about 7%. Although the final results prove the feasibility of this method, there are still some shortcomings to be optimized. (shrink)

In recent years, risk management and analysis has attracted a great deal of attention from both researchers and practitioners. Enterprise risk management has become an important topic in today’s more complex, interrelated global business environment, replete with threats from natural, political, economic, and technical sources. This survey and introductory article addresses computerized tools used for risk management and analysis. Risks are studied from perspectives of different disciplines, with a discussion of how various methods and tools are used to (...) optimize risk management. (shrink)

It is conventionally understood that computers play a rather limited role in theoretical mathematics. While computation is indispensable in applied mathematics and the theory of computing and algorithms is rich and thriving, one does not, even today, expect to find computers in theoretical mathematics settings beyond the theory of computing. Where computers are used, by those studying combinatorics , algebra, number theory, or dynamical systems, the computer most often assumes the role of an automated and speedy theoretician, performing manipulations and (...) checking cases in a way assumed to be possible for human theoreticians, if only they had the time, the memory, and the precision. Automated proofs have become standard tools in mathematical logic, and it is often expected that proofs be published in a computer-checkable format. It is not surprising, then, that most philosophical work on computers in theoretical mathematics has been on computers' roles as supplementary mathematicians. Donald MacKenzie's 2001 book Mechanizing Proof demonstrates the rich potential for social and historical studies to complement the substantial analytic debate in this area of philosophy. But what of computers in theoretical mathematics behaving as computers, and not as mere mechanized mathematicians? Very little role is commonly assumed for computers working as supplements to mathematicians, rather than as supplementary mathematicians themselves. Accordingly, very little philosophy has attempted to grapple with theoretical mathematics in which computers play an essential but essentially non-theoretical role. My presentation will draw on work I conducted as a researcher in harmonic analysis on fractals at Cornell University. I will analyze the explicit and implicit conceptual apparatus employed in my and my fellow researchers' use of computers in the theoretical study of second order differential equations, such as those for sound and heat flow, on various fractal analogues of the Sierpinski gasket. Such gaskets are easy to visualize in very crude approximation in a low number of dimensions. As one increases the complexity of the gasket or the refinement of one's analysis, visualization and precise computation become impossible, and soon computers are unable to produce even approximate data to model differential equations in these situations. We thus had to carefully choose analytic approaches and methods to make our theoretical mathematics amenable to computer simulation. In my case, studying the transformation of the gaskets as they are expanded into increasingly high dimensions, computer simulation eventually required that the problem be reimagined entirely in terms of interlinked systems of parameters. This computer-approximation-driven theoretical orientation shaped my mathematical intuitions toward the problem and guided my fellow researchers and me in both theoretical and computational directions. We discovered both that computer approximation could be incredibly powerful as an aid to intuition, and that it can be incredibly difficult to transfer computer-oriented mathematics back into the purely theoretical standards of our area of specialty. I will address the philosophical implications of computer-driven theoretical mathematics, asking how computer experiments can shape both the content and standards of theoretical sciences. (shrink)

In this paper, building on these previous works, we propose to go deeper into the understanding of crowd behavior by proposing an approach which integrates ontologi- cal models of crowd behavior and dedicated computer vision algorithms, with the aim of recognizing some targeted complex events happening in the playground from the observation of the spectator crowd behavior. In order to do that, we first propose an ontology encoding available knowledge on spectator crowd behavior, built as a spe- cialization of the (...) DOLCE foundational ontology, which allows the representation of categories belonging both to the physical and to the social realms. We then propose a simplified and tractable version of such ontology in a new temporal extension of a description logic, which is used for temporally coupling events happening on the play- ground and spectator crowd behavior. At last, computer vision algorithms provide the input information concerning what is observed on the stands and ontological reasoning delivers the output necessary to perform complex event recognition. (shrink)

El autor analiza el pronunciamiento de Kierkegaard acerca de la mujer y lo femenino en el texto O lo Uno o lo Otro, especialmente en las partes I y II. Para esto, se seleccionaron palabras clave como “mujer”, “femenino”, “virginidad”, “novia”, “esposa”, entre muchas otras más y se empleó el programa de análisis comparativo SimCA 2.0 de Michael J. Greenacre con el objetivo de mostrar tanto las comunes como las diferentes posturas del esteta A y el esteta B, así como (...) ofrecer una serie de dimensiones discursivas presentes en el texto que arrojan un conjunto de conclusiones valiosas para la comprensión de esta obra kierkegaardiana y la postura del filósofo danés frente a la mujer y lo que le compete. Los resultados del análisis se muestran al final del artículo por medio de tablas que comparan el vocabulario de A y de B y muestran su frecuencia; otras figuras exhiben por medio de gráficas el comportamiento de las palabras clave frente a las dimensiones discursivas más importantes. (shrink)

We give a systematic technical exposition of the foundations of the theory of computably compact metric spaces. We discover several new characterizations of computable compactness and apply these characterizations to prove new results in computable analysis and effective topology. We also apply the technique of computable compactness to give new and less combinatorially involved proofs of known results from the literature. Some of these results do not have computable compactness or compact spaces in their statements, (...) and thus these applications are not necessarily direct or expected. (shrink)

The size and variation in both meaning-making and populations that characterize much contemporary text data demand research processes that support both discovery, interpretation and measurement. We assess one dominant strategy within the social sciences that takes a computer-led approach to text analysis. The approach is coined computational grounded theory. This strategy, we argue, relies on a set of unwarranted assumptions, namely, that unsupervised models return natural clusters of meaning, that the researcher can understand text with limited immersion and that (...) indirect validation is sufficient for ensuring unbiased and precise measurement. In response to this criticism, we develop a framework that is computer assisted. We argue that our reformulation of computational grounded theory better aligns with the principles within grounded theory, anthropological theory generation and ethnography. (shrink)