Some recent exchanges (Gebharter 2017a,2017b; Baumgartner and Cassini, 2023) concern whether composition can have conditional independence properties analogous to causal relations. If so, composition might sometimes be detectable by the application of causal search algorithms. The discussion has focused on a particular algorithm, PC (Spirtes and Glymour, 1991). PC is but one, and in many circumstances not the best, of a host of causal search algorithms that are candidates for methods of discovering composition provided appropriate statistical relations (...) obtain. The discussion raises two issues: 1. Does the structure of the composition relation entail probability relations such that PC and like algorithms cannot discover composition from frequency data about kinds; and 2. what can be discovered—and how—about the composition of systems by PC or related causal search algorithms that exploit conditional independence relations. Baumgartner and Cassini answer the first question positively: constitution entails probability relations incompatible with discovery by PC. They do not engage the second question, but we will. (shrink)

Philosophers have disagreed on the composition of force for decades. The main divergence concerns the fundamental question: given a certain motion that is observable, which force or forces are present in it, component or resultant forces? The present paper focuses on the conditions for dealing with this problem. I will argue that we are not able to infer force from the observation of a motion, as required by the problem. I will further argue that the validity of the Newtonian (...) algorithm is not a sufficient condition for that inference because the Gaussian algorithm, which is equally valid, differs from the former with regard to the forces present in motions. Under these circumstances, I will make recourse to an experiment available in physics in which the force present in a motion is measured. Thus, we obtain a numerical value for this force. This result, playing the role of a counterexample, clarifies the composition of force issue significantly. (shrink)

In recent years, with the development of society and the rapid development of the animation industry, people are paying more and more attention to and requirements for animation production. As an indispensable part of animation production, picture composition plays a major role in animation production. It can give full play to the application of color matching and light and shadow design and enhance the depth and space of the animation screen. Tone space conversion refers to the conversion or representation (...) of color data in one color space into corresponding data in another color space. Its purpose is to distinguish and process color components such as hue and saturation in an image. This article first introduces the domestic and foreign research status of digital image preprocessing and analyzes the basic principles of several color space conversions in detail. Then, several color space conversion algorithms are studied, and the performance of the algorithms is compared and analyzed. The paper focuses on the hardware implementation and optimization of the algorithm for converting RGB color space into HSI color space to meet the real-time requirements. This article focuses on the mutual conversion between the RGB tone space and the HSI tone space and describes in detail how each color component in the HSI tone space is converted from the three RGB color components from a geometric perspective, and then the conversion is derived, and several general conversion methods of RGB to HSI tone space are introduced; two conversion methods of geometric derivation method and standard modulus algorithm are implemented in the software, and the comparison verification is carried out, and the comparison is made from the perspective of hardware implementation. The pros and cons of the two methods are discussed. Finally, the paper summarizes the shortcomings in the design and proposes further research directions in the future. (shrink)

I argue for patternism, a new answer to the question of when some objects compose a whole. None of the standard principles of composition comfortably capture our natural judgments, such as that my cat exists and my table exists, but there is nothing wholly composed of them. Patternism holds, very roughly, that some things compose a whole whenever together they form a “real pattern”. Plausibly we are inclined to acknowledge the existence of my cat and my table but not (...) of their fusion, because the first two have a kind of internal organizational coherence that their putative fusion lacks. Kolmogorov complexity theory supplies the needed rigorous sense of “internal organizational coherence”. (shrink)

The paper draws on an algorithmic criterion to demonstrate that the self is a composite, scattered, and patterned object. It also addresses the question of extendedness of the self-pattern. Based on the criteria drawn from algorithmic complexity, I argue that although the self-pattern possesses a genuinely extended aspect the self-pattern and its environment do not constitute a genuine composite object.

“The forms of thought are first set out and stored in human language,” we read in the preface to the second edition of Hegel’s Science of Logic. Man thinks through language, and everything he “transforms into language and expresses in it contains a category, whether concealed, mixed, or well defined”. Language, then, harbors thought categories. There is a philosophy of language, but there is also a philosophy implied in language. How is this supposed to work? More specifically, how is this (...) supposed to work in Hegel’s own use of language?This paper is an attempt to give a simple answer to this question. There have been scholarly attempts to tie Hegel’s philosophy to his use of language.1 This paper... (shrink)

Featuring chapters by emerging and established scholars as well as by leading practitioners in the field, this Handbook both describes the state of algorithmic composition and also set the agenda for critical research on and analysis of algorithmic music.

In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update sentence’s structure, and that may be reasonably implemented. In addressing update, we first provide a definition phrased in terms of the models of a knowledge base. While this operator (...) satisfies a core group of the benchmark Katsuno Mendelzon update postulates, not all of the postulates are satisfied. Other Katsuno Mendelzon postulates can be obtained by suitably restricting the syntactic form of the sentence for update, as we show. In restricting the syntactic form of the sentence for update, we also obtain a hierarchy of update operators with Winslett’s standard semantics as the most basic interesting approach captured. We subsequently give an algorithm which captures this approach; in the general case the algorithm is exponential, but with some not unreasonable assumptions we obtain an algorithm that is linear in the size of the knowledge base. Hence the resulting approach has much better complexity characteristics than other operators in some situations. We also explore other compositional belief change operators: erasure is developed as a dual operator to update; we show that a forget operator is definable in terms of update; and we give a definition of the compositional revision operator. We obtain that compositional revision, under the most natural definition, yields the Satoh revision operator. (shrink)

This paper studies the state of charge estimation of supercapacitors and lithium batteries in the hybrid energy storage system of electric vehicles. According to the energy storage principle of the electric vehicle composite energy storage system, the circuit models of supercapacitors and lithium batteries were established, respectively, and the model parameters were identified online using the recursive least square method and Kalman filtering algorithm. Then, the online estimation of SOC was completed based on the Kalman filtering algorithm and unscented Kalman (...) filtering algorithm. Finally, the experimental platform for SOC estimation was built and Matlab was used for calculation and analysis. The experimental results showed that the SOC estimation results reached a high accuracy, and the variation range of estimation error was [−0.94%, 0.34%]. For lithium batteries, the recursive least square method is combined with the 2RC model to obtain the optimal result, and the estimation error is within the range of [−1.16%, 0.85%] in the case of comprehensive weighing accuracy and calculation amount. Moreover, the system has excellent robustness and high reliability. (shrink)

A number of artificial intelligence systems have been proposed to assist users in identifying the issues of algorithmic fairness and transparency. These AI systems use diverse bias detection methods from various perspectives, including exploratory cues, interpretable tools, and revealing algorithms. This study explains the design of AI systems by probing how users make sense of fairness and transparency as they are hypothetical in nature, with no specific ways for evaluation. Focusing on individual perceptions of fairness and transparency, this study (...) examines the roles of normative values in over-the-top platforms by empirically testing their effects on sensemaking processes. A mixed-method design incorporating both qualitative and quantitative approaches was used to discover user heuristics and to test the effects of such normative values on user acceptance. Collectively, a composite concept of transparent fairness emerged around user sensemaking processes and its formative roles regarding their underlying relations to perceived quality and credibility. From a sensemaking perspective, this study discusses the implications of transparent fairness in algorithmic media platforms by clarifying how and what should be done to make algorithmic media more trustable and reliable platforms. Based on the findings, a theoretical model is developed to define transparent fairness as an essential algorithmic attribute in the context of OTT platforms. (shrink)

Wittgenstein's conception of the general form of a truth function given in thesis 6 can be presented as a sort of a trade-off: the author of the Tractatus is unable to reconcile the simplicity of his original idea of a series of forms with the simplicity of his generalisation of Sheffer's stroke; therefore, he is forced to sacrifice one of them. As we argue in this paper, the choice he makes – to weaken the logical constraints put on the concept (...) of a series of forms, thus effectively metaphorising that concept for the sake of upholding the N-operation's role of generating the series – is unfortunate. An actual expansion of a series of truth functions as defined in 6 would require either making decisions at each step (Anscombe) or outwardly rejecting the concept of a series (Sundholm). However, neither is faithful to Wittgenstein's own fundamental intuitions regarding the nature of logic. For this reason, a different trade-off that prioritises upholding the basic features of a series of forms over the simplicity of the operation that generates that series seems to be much more reasonable. We offer such a trade-off by developing the schema already present in the Tractatus (5.101). The key element of our alternative solution is the construction of an operation that can perform the task of producing all consecutive truth functions of a given collection of atomic propositions as an invariant difference between any base and its successor throughout the series. We define it as a composition of three functions (in an algebraic sense): the first turns a symbol of a given truth function into a binary number, the second increments that number, the third turns the result back into a symbol of another truth function. We also show how the operation can be defined by means of a different notation without invoking binary arithmetic. (shrink)

This paper first conducts knowledge point association analysis on a large amount of data collected in practical applications. Data mining includes data collection, data preprocessing, actual mining, and result analysis, establishes knowledge point association rules table, and develops college English diagnostic practice system. Then, starting from the existing paper composition mode of the system, the knowledge point association rule table is introduced, and the knowledge point association relationship mining model is constructed using the association rule algorithm to explore the (...) potential influence relationship between different knowledge points that affect the improvement of learning quality. Finally, the data collected when the system is used is preprocessed, and the three dimensions of learning status evaluation, question-type association analysis, and college English score prediction are, respectively, modeled. Finally, after combining these submodels, a relatively complete and reliable diagnosis is obtained by evaluation model and related verification. (shrink)

The famous Allen's interval relations constraint propagation algorithm was intended for linear time. Its 13 primitive relations define all the possible mutual locations of two intervals on the time-axis. In this paper an application of the algorithm for non-linear time is suggested. First, a new primitive relation is added. It is called excludes since an occurrence of one event in a certain course of events excludes an occurrence of the other event in this course. Next, new composition rules for (...) relations between intervals are presented: some of the old rules are extended by the relation excludes, and entirely new ones are formulated for composing the relation excludes with the other relations. Four different composition tables are considered. The choice of a composition table depends on whether time is branching or not, and whether intervals can contain non-collinear subintervals or not. (shrink)

Fractal art graphics are the product of the fusion of mathematics and art, relying on the computing power of a computer to iteratively calculate mathematical formulas and present the results in a graphical rendering. The selection of the initial value of the first iteration has a greater impact on the final calculation result. If the initial value of the iteration is not selected properly, the iteration will not converge or will converge to the wrong result, which will affect the accuracy (...) of the fractal art graphic design. Aiming at this problem, this paper proposes an improved optimization method for selecting the initial value of the Gauss-Newton iteration method. Through the area division method of the system composed of the sensor array, the effective initial value of iterative calculation is selected in the corresponding area for subsequent iterative calculation. Using the special skeleton structure of Newton’s iterative graphics, such as infinitely finely inlaid chain-like, scattered-point-like composition, combined with the use of graphic secondary design methods, we conduct fractal art graphics design research with special texture effects. On this basis, the Newton iterative graphics are processed by dithering and MATLAB-based mathematical morphology to obtain graphics and then processed with the help of weaving CAD to directly form fractal art graphics with special texture effects. Design experiments with the help of electronic Jacquard machines proved that it is feasible to transform special texture effects based on Newton's iterative graphic design into Jacquard fractal art graphics. (shrink)

The essential purpose of this research study is to measure the impact of the applications of traditional Chinese philosophical thinking in film and television music composition; for measuring, the research study used open-ended and closed-ended questions related to the variables. This research study depends upon primary data analysis for collecting data associated with traditional Chinese philosophical thinking and music composition. These data were collected from film industries, directors, and actors in musical department research conducted in China. For measuring, (...) the research used smart PLS and run different results related to the variables, including independent and dependent variables. Indicator correlation, discriminant validity, and composite reliability are all tests run for measuring the research. The smart PLS Algorithm model explains the impact with each other. The overall result found a positive and significant effect on the applications of traditional Chinese philosophical thinking in film and television music composition. (shrink)

With the rapid development of Internet of Things technology, the energy consumption of service composition in the IoT environment is a key problem to be studied. At present, the problems of service composition in the IoT environment mostly focus on the evaluation research based on quality of service, ignoring the overall energy consumption in the process of dynamic configuration of service composition. Therefore, we construct the service composition structure for the IoT and propose the QoS evaluation (...) model and energy evaluation model for the service composition in the IoT environment. Considering that the service composition in the Internet of things environment is NP hard, moth algorithm is successfully applied to the QoS evaluation model and energy evaluation model. The simulation results reveal that MFO has good optimization effect in the abovementioned models, and the optimization effect of MFO is improved by 8% and 6% compared with the genetic algorithm and particle swarm optimization, so as to realize the green energy strategic management of QoS composition in the environment of IoT. (shrink)

With the continuous development of the stock market, designing a reasonable risk identification tool will help to solve the irrational problem of investors. This paper first selects the stocks with the most valuable investment value in the future through the random forest algorithm in the nine-factor model and then analyzes them by using the higher-order moment model to find that different investors’ preferences will make the weight of the portfolio change accordingly, which will eventually make the optimal return and risk (...) set of the composition of the portfolio change. The risk identification system designed in this paper can provide an effective risk identification tool for investors and help them make rational judgments. (shrink)

The number of events and artifacts described as sonification has increased considerably in recent years with some works making a bridge between the representation of data and artistic expression. Flood Tide which sonifies the flow of tidal water is such a work and has achieved a relatively high profile attracting good audiences for its 10 performances to date. It is not entirely obvious however what it is that attracts audiences and whether it is effective at representing the data being sonified. (...) This paper aims to address these issues and is based on a discussion group in which these and other questions are considered. (shrink)

Numbers have been identified with symbolic data forever. The profound association of both with acoustics, music, and sonic art from Pythagoras to current work is beyond reproach. Recently, sonification looks for ways to realize symbolic data (representing results or measurements) as well as “raw” data (signals, impulses, images, etc.) into compositions. In the strictest sense, everything in a computer is symbolic, that is, represented by 0s and 1s. In the arts, the digital age has broadened and enhanced the conceptual landscape (...) not simply through its servitude to the creative process, but as its partner. However, there is a rich history of the use of data that no doubt has paved the way for many of today’s experiments including my own. (shrink)

We show that vector space semantics and functional semantics in two-sorted first order logic are equivalent for pregroup grammars. We present an algorithm that translates functional expressions to vector expressions and vice-versa. The semantics is compositional, variable free and invariant under change of order or multiplicity. It includes the semantic vector models of Information Retrieval Systems and has an interior logic admitting a comprehension schema. A sentence is true in the interior logic if and only if the ‘usual’ first order (...) formula translating the sentence holds. The examples include negation, universal quantifiers and relative pronouns. (shrink)

Here is presented parallel CAMLET that is a platform for automatic composition of inductive applications with method repositories that organize many inductive learning methods. After having implemented CAMLET on a UNIX parallel machine with Perl and C languages, we have done the case studies of constructing inductive applications for eight different data sets from the StatLog repository. To find out an efficient search method, we have done the following experiments: a random search, a GA based search, and two hybrid (...) searches with unifying each global search and the local search which uses meta-rules for refining a specification. That have shown us that the hybrid search works better than the other search methods. Furthermore, comparing the accuracy of inductive applications composed by parallel CMALET with that of popular twenty four inductive algorithms, we have shown that parallel CAMLET support a user in doing model selection in KDD engineering processes. (shrink)

Polynomial clone reducibilities are generalizations of the truth-table reducibilities. A polynomial clone is a set of functions over a finite set X that is closed under composition and contains all the constant and projection functions. For a fixed polynomial clone ${\fancyscript{C}}$ , a sequence ${B\in X^{\omega}}$ is ${\fancyscript{C}}$ -reducible to ${A \in {X}^{\omega}}$ if there is an algorithm that computes B from A using only effectively selected functions from ${\fancyscript{C}}$ . We show that if A is Kurtz random and (...) ${\fancyscript{C}_{1} \nsubseteq \fancyscript{C}_{2}}$ are polynomial clones, then there is a B that is ${\fancyscript{C}_{1}}$ -reducible to A but not ${\fancyscript{C}_{2}}$ -reducible to A. This implies a generalization of a result first proved by Lachlan (Z Math Logik Grundlagen Math 11:17–44, 1965) for the case |X| = 2. We also show that the same result holds if Kurtz random is replaced by Kolmogorov–Loveland stochastic. (shrink)

ArgumentThe study of algebra in China has often focused on the algebraic “procedure of the Celestial Source.” Its geometrical ancestors are less known. TheYigu yanduan, authored by Li Ye (1192-1279), presents the procedure alongside its two geometrical counterparts, the “Section of Pieces [of Areas]” and the “Old Procedure.” The three procedures are known to represent three generations of algorithms used to set up quadratic equations. A similar geometrical procedure appears in a treatise written by Yang Hui (second half of thirteenth (...) century). Although the procedures look alike at first glance, the two treatises reveal different moments in their work on the relation between counting materials and geometrical representation. This study challenges their chronology trying to identify the meander of the geometrical roots of the Celestial Source. The construction of negative coefficients plays a pivotal role in this mutation and shows several layers of composition. (shrink)

The informative purpose of the research study is to describe the Applications of modern dance and creation in Chinese dance from dialectical materialist philosophy. This research study was conducted in china to measure Chinese and modern dance from materialist philosophy. Research based on primary data analysis for gathering the data developed almost 10 to 12 questions related to the variables. The Chinese dancers, department of Chinese dancers, film industries, etc., are all research study participants. For measuring, the research study used (...) smart PLS software, and run results included composite reliability, segmentations, smart PLS Algorithm, indicator correlations, and signification analysis related to the modern dance creation performance in China and the effect of dialectical materialist philosophy. Overall, the research found a positive and significant application of modern dance and creation from dialectical materialist philosophy. Modern dance and creation have a direct influence on dialectical materialist philosophy. (shrink)

Algorithmic software for mathematical modeling of structural stability is considered, which is reduced to solving a partial generalized eigenvalues problem of sparse matrices, with automatic parallelization of calculations on modern parallel computers with graphics processors. Peculiarities of realization of parallel algorithms for different structures of sparse matrices are presented. The times of solving the problem of stability of composite materialsusing a three-dimensional model of "finite size fibers" on computers of different architectures are given. In mathematical modeling of physical and (...) technical processes in many cases there is a need to solve problems of algebraic problem of eigenvalues with sparse matrices of large volumes. In particular, such problems arise in the analysis of the strength of structures in civil and industrial construction, aircraft construction, electric welding, etc. The solving to these problems is to determine the eigenvalues and eigenvectors of sparse matrices of different structure. The efficiency of solving these problems largely depends on the effectiveness of mathematical modeling of the problem as a whole. Continuous growth of task parameters, calculation of more complete models of objects and processes on computers require an increase in computer productivity. High-performance computing requirements are far ahead of traditional parallel computing, even with multicore processors. High-performance computing requirements are far ahead of traditional parallel computing, even with multicore processors. Today, this problem is solved by using powerful supercomputers of hybrid architecture, such as computers with multicore processors and graphics processors, which combine MIMD and SIMD architectures. But the potential of high-performance computers can be used to the fullest only with algorithmic software that takes into account both the properties of the task and the features of the hybrid architecture. Complicating the architecture of modern high-performance supercomputers of hybrid architecture, which are actively used for mathematical modeling means a significant complication of efficient use of these resources in creating parallel algorithms and programs. here are problems with the creation of algorithmic software with automatic execution of stages of work, which are associated with the efficient use of computing resources, ways to store and process sparse matrices, analysis of the reliability of computer results. This makes it possible to significantly increase the efficiency of mathematical modeling of practical problems on modern high-performance computers, as well as free users from the problems of parallelization of complex problems. he developed algorithmic software automatically implements all stages of parallel computing and processing of sparse matrices on a hybrid computer. It was used at the Institute of Mechanics named after S.P. Tymoshenko NAS of Ukraine in modeling the strength problems of composite material. A significant improvement in the time characteristics of mathematical modeling was obtained. Problems of mathematical modeling of the properties of composite materials has an important role in designing the processes of deformation and destruction of products in various subject areas. Algorithmic software for mathematical modeling of structural stability is considered, which is reduced to solving a partial generalized problem of eigen values of sparse matrices of different structure of large orders, with automatic parallelization of calculations on modern parallel computers with graphics processors. The main methodological principles and features of implementation of parallel algorithms for different structures of sparse matrices are presented, which ensure effective implementation of multilevel parallelism of a hybrid system and reduce data exchange time during the computational process. As an example of these approaches, a hybrid algorithm of the iteration method in subspace for tape and block-diagonal matrices with a frame for computers of hybrid architecture is given. Peculiarities of data decomposition for matrices of profile structure at realization of parallel algorithms are considered. The proposed approach provides automatic determination of the required topology of the hybrid computer and the optimal amount of resources for the organization of an efficient computational process. The results of testing the developed algorithmic software for problems from the collection of the University of Florida, as well as the times of solving the problem of stability of composite materials using a three-dimensional model of "finite size fibers" on computers of different architectures. The results show a significant improvement in the time characteristics of solving problems. (shrink)

Non-compensatory aggregation rules are applied in a variety of problems such as voting theory, multi-criteria analysis, composite indicators, web ranking algorithms and so on. A major open problem is the fact that non-compensability implies the analytical cost of loosing all available information about intensity of preference, i.e. if some variables are measured on interval or ratio scales, they have to be treated as measured on an ordinal scale. Here this problem has been tackled in its most general formulation, that is (...) when mixed measurement scales (interval, ratio and ordinal) are used and both stochastic and fuzzy uncertainties are present. Objectives of this article are first to present a comprehensive review of useful solutions already proposed in the literature and second to advance the state of the art mainly in the theoretical guarantee that weights have the meaning of importance coefficients and they can be summarized in a voting matrix. This is a key result for using non-compensatory Condorcet consistent rules. A proof on the probability of existence of ties in the voting matrix is also developed. (shrink)

The paper presents a compositional approach to the verification of CTL* properties over reactive systems. Both symbolic model-checking and deductive verification are considered. Both methods are based on two decomposition principles. A general state formula is decomposed into basic state formulas which are CTL* formulas with no embedded path quantifiers. To deal with arbitrary basic state formulas, we introduce another reduction principle which replaces each basic path formula, i.e., path formulas whose principal operator is temporal and which contain no embedded (...) temporal operators or path quantifiers, by a newly introduced boolean variable which is added to the system. Thus, both the algorithmic and the deductive methods are based on two statification transformations which successively replace temporal formulas by assertions which contain no path quantifiers or temporal operators. Performing these decompositions repeatedly, we remain with basic assertional formulas, i.e., formulas of the form Efp and Afp for some assertion p. In the model-checking method we present a single symbolic algorithm to verify both universal and existential basic assertional properties. In the deductive method we present a small set of proof rules and show that this set is sound and relatively complete for verifying universal and existential basic assertional properties over reactive systems. Together with two proof rules for the decompositions, we obtain a sound and relatively complete proof system for arbitrary CTL* properties. Interestingly, the deductive approach for CTL* presented here, offers a viable new approach to the deductive verification of arbitrary LTL formulas. The paper corrects a previous preliminary version of a deductive system for CTL*, in which some of the rules were unsound. The correction is based on the introduction of a new type of temporal testers which are guaranteed to be non blocking. That is, when composed with a deadlock-free system, which is a key operation in the verification process, the resulting composed system is guaranteed to remain deadlock free. (shrink)

“The ‘fallacy of composition’ that drives a felicitous wedge between micro and macro, between the individual and the aggregate, and gives rise to emergent phenomena in economics, non-algorithmic ways – as conjectured originally by John Stuart Mill…, George Herbert Lewes … , and codified by Lloyd Morgan … in his popular Gifford Lectures - may yet be tamed by unconventional models of computation.” --K. Vela Velupillai (2008, p. 21).

In this paper, we use antecedent-final conditionals to formulate two problems for parsing-based theories of presupposition projection and triviality of the kind given in Schlenker 2009. We show that, when it comes to antecedent-final conditionals, parsing-based theories predict filtering of presuppositions where there is in fact projection, and triviality judgments for sentences which are in fact felicitous. More concretely, these theories predict that presuppositions triggered in the antecedent of antecedent-final conditionals will be filtered (i.e. will not project) if the negation (...) of the consequent entails the presupposition. But this is wrong: John isn’t in Paris, if he regrets being in France intuitively presupposes that John is in France, contrary to this prediction. Likewise, parsing-based approaches to triviality predict that material entailed by the negation of the consequent will be redundant in the antecedent of the conditional; but John isn’t in Paris, if he’s in France and Mary is with him is intuitively felicitous, contrary to these predictions. Importantly, given that the trigger appears in sentence-final position, both incremental (left-to-right) and symmetric versions of such theories make the same predictions. These data constitute a challenge to the idea that presupposition projection and triviality should be computed on the basis of parsing. This issue is important because it relates to the more general question as to whether presupposition and triviality calculation should be thought of as a pragmatic post-compositional phenomenon or as part of compositional semantics (as in the more traditional dynamic approaches). We discuss a solution which allows us to maintain the parsing-based pragmatic approach; it is based on an analysis of conditionals which incorporates a presupposition that their antecedent is compatible with the context, together with a modification to Schlenker’s (2009) algorithm for calculating local contexts so that it takes into account presupposed material. As we will discuss, this solution works within a framework broadly similar to that of Schlenker’s (2009), but it doesn’t extend in an obvious way to other parsing-based accounts (e.g. parsing-based trivalent approaches). We conclude that a parsing-based theory can be maintained, but only if we adopt a substantial change of perspective on the framework. (shrink)

These lectures on logic, more specifically proof theory, are basically intended for postgraduate students and researchers in logic. The question at stake is the nature of mathematical knowledge and the difference between a question and an answer, i.e., the implicit and the explicit. The problem is delicate mathematically and philosophically as well: the relation between a question and its answer is a sort of equality where one side is ``more equal than the other'': one thus discovers essentialist blind spots. Starting (...) with Godel's paradox --so to speak, the incompleteness of answers with respect to questions--the book proceeds with paradigms inherited from Gentzen's cut-elimination. Various settings are studied: sequent calculus, natural deduction, lambda calculi, category-theoretic composition, up to geometry of interaction, all devoted to explicitation, which eventually amounts to inverting an operator in a von Neumann algebra. Mathematical language is usually described as referring to a preexisting reality. Logical operations can be given an alternative procedural meaning: typically, the operators involved in GoI are invertible, not because they are constructed according to the book, but because logical rules are those ensuring invertibility. Similarly, the durability of truth should not be taken for granted: one should distinguish between imperfect and perfect modes. The procedural explanation of the infinite thus identifies it with the unfinished, i.e., the perennial. But is perenniality perennial? This questioning yields a possible logical explanation for algorithmic complexity. This highly original course on logic by one of the world's leading proof theorists challenges mathematicians, computer scientists, physicists, and philosophers to rethink their views and concepts on the nature of mathematical knowledge in an exceptionally profound way. (shrink)

Reflectance spectroscopy is a standard tool for studying the mineral composition of rock and soil samples and for remote sensing of terrestrial and extraterrestrial surfaces. We describe research on automated methods of mineral identification from reflectance spectra and give evidence that a simple algorithm, adapted from a well-known search procedure for Bayes nets, identifies the most frequently occurring classes of carbonates with reliability equal to or greater than that of human experts. We compare the reliability of the procedure to (...) the reliability of several other automated methods adapted to the same purpose. Evidence is given that the procedure can be applied to some other mineral classes as well. Since the procedure is fast with low memory requirements, it is suitable for on- board scientific analysis by orbiters or surface rovers. (shrink)

Reflectance spectroscopy is a standard tool for studying the mineral composition of rock and soil samples and for remote sensing of terrestrial and extraterrestrial surfaces. We describe research on automated methods of mineral identification from reflectance spectra and give evidence that a simple algorithm, adapted from a well-known search procedure for Bayes nets, identifies the most frequently occurring classes of carbonates with reliability equal to or greater than that of human experts. We compare the reliability of the procedure to (...) the reliability of several other automated methods adapted to the same purpose. Evidence is given that the procedure can be applied to some other mineral classes as well. Since the procedure is fast with low memory requirements, it is suitable for on-board scientific analysis by orbiters or surface rovers. (shrink)

This article proposes a semio-rhetorical epistemology for visual documents, one capable of accounting for both their internal configuration, which we shall call the compositional dimension, and their persuasive force within public space, or their rhetorical dimension. The field of reference will be that of identity-related images on social networks, because compared to other kinds of images, such as artistic or professional ones, they adopt new compositional solutions and new dynamics of circulation. To test this theoretical framework, we will conduct an (...) analysis which has never been carried out in semiotics and which, as far as we know, remains very rare even in the overall field of visual studies, that is, the analysis of the profile of an Instagram influencer’s visual production, that of Canadian artist Rupi Kaur. Taking into account the flow of images shared over time, we will focus primarily on the compositional dimension that articulates the specificity of the language of images. The most appropriate model for investigating social network photos seems to be that of the portrait, thanks to which we will identify a first series of regularities and deviations. Secondly, we will turn towards the rhetorical dimension – the persuasive strategies found within, through, and towards images – focusing on the analysis of a single photo: on the one hand, it is a shot which presents greater compositional richness than others; on the other hand, it has greatly impacted the notoriety of the influencer, due to the censorship incurred on Instagram, its abundant coverage by traditional media, and the heated debate it triggered on social media. We will thus propose a reinterpretation of Paul Ricœur’s theory of identity in order to balance the rhetorical and the compositional dimensions through a unitary theoretical hypothesis. Visual identity on social networks is always the result of a negotiation between two opposite tendencies: on the one hand, the experiential pressure expressed through images related to the body and everyday practices; on the other, the algorithmic pressure due to the delegation of the management of identity to software. The case of Rupi Kaur is a rare example of a critical mediation between these two pressures and helps us build a methodology for the examination of images belonging to other social domains. (shrink)

The ability to identify the mineral composition of rocks and soils is an important tool for the exploration of geological sites. Even though expert knowledge is commonly used for this task, it is desirable to create automated systems with similar or better performance. For instance, NASA intends to design robots that are sufficiently autonomous to perform this task on planetary missions. Spectrometer readings provide one important source of data for identifying sites with minerals of interest. Reflectance spectrometers measure intensities (...) of light reflected from surfaces over a range of wavelengths. Spectral intensity patterns may in some cases be sufficiently distinctive for proper identification of minerals or classes of minerals. For some mineral classes, carbonates for example, specific short spectral intervals are known to carry a distinctive signature. Finding similar distinctive spectral ranges for other mineral classes is not an easy problem. We propose and evaluate data-driven techniques in two stages: first, evaluating algorithms to identify which components are probably present in a given rock; second, trying to improve this classification by automatically searching for spectral ranges optimized for specific classes of minerals. In one set of studies, we partition the whole interval of wavelengths available in our data into sub-intervals, or bins, and use a genetic algorithm to evaluate a candidate selection of subintervals. As an alternative to these computationally expensive search techniques, we present an entropy-based heuristic that gives higher scores for wavelengths more likely to distinguish between classes. Results are presented for four different classes, showing reasonable improvements in identifying some, but not all, of the mineral classes tested. (shrink)

Visual inspections have been typically used in condition assessment of infrastructure. However, they are based on human judgment and their interpretation of data can differ from acquired results. In psychology, this difference is called cognitive bias which directly affects Structural Health Monitoring -based decision making. Besides, the confusion between condition state and safety of a bridge is another example of cognitive bias in bridge monitoring. Therefore, integrated computer-based approaches as powerful tools can be significantly applied in SHM systems. This paper (...) explores the relationship between the use of advanced computational intelligence and the development of SHM solutions through conducting an infrastructure monitoring methodology. Artificial Intelligence -based algorithms, i.e., Artificial Neural Network, hybrid ANN-based Imperial Competitive Algorithm, and hybrid ANN-based Genetic Algorithm, are developed for damage assessment using a lab-scale composite bridge deck structure. Based on the comparison of the results, the employed evolutionary algorithms could improve the prediction error of the pre-developed network by enhancing the learning procedure of the ANN. (shrink)

In the Anthropocene, the fact that human activity is enmeshed with the existence and actions of every kind of other being is inescapable. As a result, the planetary ecological crisis has brought forth an urgent need to rethink understandings of human action. One response holds that the transformations necessary to tackle today’s crises will emerge from the distinctive capacity of human beings to transcend their environment. Another school of thought calls for seeing action as composite, produced by distributed networks of (...) human and nonhuman agents. Yet the first of these is open to charges of human exceptionalism, while the second, according to its critics, lacks effective political traction. Martin Crowley argues that a new conception of political agency is necessary to break this impasse. Engaging with thinkers such as Bruno Latour, Bernard Stiegler, and Catherine Malabou, Crowley proposes an original account of agency as both distributed and decisive. Challenging the prevailing view of agency as exclusively human, he explores how a politics that incorporates nonhuman agency can intervene in the real world, examining timely issues such as climate-related migration and digital-algorithmic politics. A major intervention into ongoing debates in posthumanism, political ecology, and political theory, Accidental Agents reshapes our understanding of political agency in and for a more-than-human world. (shrink)

This paper describes a novel pedagogical software program that can be seen as an online companion to one of the standard textbooks of formal natural language semantics, Heim and Kratzer (1998). The Penn Lambda Calculator is a multifunctional application designed for use in standard graduate and undergraduate introductions to formal semantics: Teachers can use the application to demonstrate complex semantic derivations in the classroom and modify them interactively, and students can use it to work on problem sets provided by the (...) teacher. The program supports demonstrations and exercises in two main areas: (1) performing beta reduction in the simply typed lambda calculus; (2) application of the bottom-up algorithm for computing the compositional semantics of natural language syntax trees. The program is able to represent the full range of phenomena covered in the Heim and Kratzer textbook by function application, predicate modification, and lambda abstraction. This includes phenomena such as intersective adjectives, relative clauses and quantifier raising. In the student use case, emphasis has been placed on providing “live” feedback for incorrect answers. Heuristics are used to detect the most frequent student errors and to return specific, interactive suggestions. (shrink)

The International workshop 'Frontiers of Combining Systems' is the only forum that is exclusively devoted to research efforts in this interdisciplinary area. This volume contains selected, edited papers from the second installment of the workshop. The contributions range from theorem proving, rewriting and logic to systems and constraints. While there is a clear emphasis on automated tools and logics, the contributions to this volume show that there exists a rapidly expanding body of solutions of particular instances of the combination problem, (...) and at the same time, that the issue of developing general frameworks for intergrating formalisms and systems is taking on an increasingly important position on the international research agenda. The idea of combining formal systems and algorithms has been attracting interest in areas as diverse as constraint logic programming, automated deduction, verification, information retrieval, computational linguistics, artificial intelligence, and logic. As any interesting real world system is a complex composite entity, decomposing its descriptive requirements (for design, verification, or maintenance purposes) into simpler, more restricted tasks is appealing as it is often the only plausible way of tackling complex modelling problems. A core body of notions, questions and results is beginning to emerge in the area, and we are beginning to understand the computational and logical impact of combining methods and algorithms. (shrink)

Russian Abstract: Данный документ является сборником «заметок на полях», раскрывающих состав и содержание метода структурно-онтологического анализа. Указанный метод разработан для системного описания предметной области изучаемых явлений. Он включает специальную процедуру по построению структурно-онтологических матриц и алгоритм их описания. Междисциплинарная направленность метода продемонстрирована на примере анализа процесса социализации личности. English Abstract: This document is a collection of `marginal notes` revealing the composition and content of the structural ontological analysis method. The specified method is developed for a systemic description of the (...) subject matter area of the studied phenomena. It includes a special procedure for constructing structural-ontological matrices and an algorithm for their description. The interdisciplinary focus of the method is demonstrated by the example of an analysis of the personality socialization process. (shrink)

The ability to identify the mineral composition of rocks and softs is an important tool for the exploration of geological sites. For instance, NASA intends to design robots that are sufficiently autonomous to perform this task on planetary missions. Spectrometer readings provide one important source of data for identifying sites with minerals of interest. Reflectance spectrometers measure intensities of light reflected from surfaces over a range of wavelengths. Spectral intensity patterns may in some cases be sufficiently distinctive for proper (...) identification of minerals or classes of minerals. For some mineral classes, carbonates for example, specific short spectral intervals are known to carry a distinctive signature. Finding similar distinctive spectral ranges for other mineral classes is not an easy problem. We propose and evaluate data-driven techniques that automatically search for spectral ranges optimized for specific minerals. In one set of studies, we partition the whole interval of wavelengths available in our data into sub-intervals, or bins, and use a genetic algorithm to evaluate a candidate selection of subintervals. As alternatives to this computationally expensive search technique, we present an entropy-based heuristic that gives higher scores for wavelengths more likely to distinguish between classes, as well as other greedy search procedures. Results are presented for four different classes, showing reasonable improvements in identifying some, but not all, of the mineral classes tested. (shrink)

The ‘New Apuleius’ is a set of Latin summaries of Plato's works first published in 2016 by Justin Stover, who attributed it to Apuleius. The present article attempts to assess two key aspects of Stover's argument, viz. his reconstruction of the manuscript transmission of the new text and his use of computer-assisted stylometric techniques. The authors suggest that both strands of his argument are inconclusive. First, it is argued that the transposition of gatherings in the archetype of the Apuleian philosophica (...) as envisaged by Stover is highly unrealistic. Second, replications of Stover's stylometric experiments show that their results are highly dependent on the particular algorithm settings and on the composition of the corpus. It is further shown that Stover's choice of highly specialized stylometric techniques is suboptimal, because popular generalist methods for statistical data analysis are demonstrably more successful in correctly identifying authors of Latin text fragments and do not support the case for Apuleius’ authorship of the new text. The authors conclude that there are no solid grounds to conclude that the ‘New Apuleius’ was indeed written by Apuleius. (shrink)

We prove that the observational equivalence of third-order finitary Idealized Algol is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function fM. Given any such fM, we construct a real-time deterministic pushdown automaton that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational (...) equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable. (shrink)

The success of models of human behavior based on Bayesian inference over logical formulas or programs is taken as evidence that people employ a “language-of-thought” that has similarly discrete and compositional structure. We argue that this conclusion problematically crosses levels of analysis, identifying representations at the algorithmic level based on inductive biases at the computational level.

Adults with dysphagia experience difficulties swallowing food and fluids with potentially harmful health and psychosocial consequences. Speech pathologists who manage patients with dysphagia are frequently required to address ethical issues when patients' food culture and/ or preferences are inconsistent with recommended diets. These issues incorporate complex links between food, identity and social participation. A composite case has been developed to reflect ethical issues identified by practising speech pathologists for the purposes of illustrating ethical concerns in dysphagia management. The case examines (...) a speech pathologist's role in supporting patient autonomy when patients and carers express different goals and values. The case presents a 68-year-old man of Australian/Italian heritage with severe swallowing impairment and strong values attached to food preferences. The case is examined through application of the dysphagia algorithm, a tool for shared decision-making when patients refuse dietary modifications. Case analysis revealed the benefits and challenges of shared decision-making processes in dysphagia management. Four health professional skills and attributes were identified as synonymous with shared decision making: communication, imagination, courage and reflection. (shrink)

The ability to identify the mineral composition of rocks and soils is an important tool for the exploration of geological sites. Even though expert knowledge is commonly used for this task, it is desirable to create automated systems with similar or better performance. For instance, NASA intends to design robots that are sufficiently autonomous to perform this task on planetary missions. Spectrometer readings provide one important source of data for identifying sites with minerals of interest. Reflectance spectrometers measure intensities (...) of light reflected from surfaces over a range of wavelengths. Spectral intensity patterns may in some cases be sufficiently distinctive for proper identification of minerals or classes of minerals. For some mineral classes, carbonates for example, specific short spectral intervals are known to carry a distinctive signature. Finding similar distinctive spectral ranges for other mineral classes is not an easy problem. We propose and evaluate data-driven techniques in two stages: first, evaluating algorithms to identify which components are probably present in a given rock; second, trying to improve this classification by automatically searching for spectral ranges optimized for specific classes of minerals. In one set of studies, we partition the whole interval of wavelengths available in our data into sub-intervals, or bins, and use a genetic algorithm to evaluate a candidate selection of subintervals. As an alternative to these computationally expensive search techniques, we present an entropy-based heuristic that gives higher scores for wavelengths more likely to distinguish between classes. Results are presented for four different classes, showing reasonable improvements in identifying some, but not all, of the mineral classes tested. (shrink)

Functions of type n are characteristic functions on n-ary relations. Keenan [5] established their importance for natural language semantics, by showing that natural language has many examples of irreducible type n functions, i.e., functions of type n that cannot be represented as compositions of unary functions. Keenan proposed some tests for reducibility, and Dekker [3] improved on these by proposing an invariance condition that characterizes the functions with a reducible counterpart with the same behaviour on product relations. The present paper (...) generalizes the notion of reducibility (a quantifier is reducible if it can be represented as a composition of quantifiers of lesser, but not necessarily unary, types), proposes a direct criterion for reducibility, and establishes a diamond theorem and a normal form theorem for reduction. These results are then used to show that every positive n function has a unique representation as a composition of positive irreducible functions, and to give an algorithm for finding this representation. With these formal tools it can be established that natural language has examples of n-ary quantificational expressions that cannot be reduced to any composition of quantifiers of lesser degree. (shrink)

This article deals with the reframing of the concept of universal mediated communication on a global scale. Subjects include the following: the universe has a conscious force field at all its scales, requiring continuous inter-scale communication of information; the field exhibits distinct electromagnetic frequencies associated with the building blocks of life; and advances in the technology of sound production with electronic synthesizers can be applied to study mechanisms of such universal communication. The question being addressed is how electronic synthesizers can (...) be used to create sonic xenolinguistic expressions when composing with sonified frequencies obtained from bio-organisms, human protein structures, phonemes and various types of interstellar frequencies that include, but are not limited to, gamma bursts, pulsars and neutron stars. The objective is to construct sonic xenolingusitic expressions that can act like feedback loops within the field of consciousness. These sonic expressions can include anomalous cognitive, emotive or spiritual experiences that may be emerging out of the universal field of consciousness in real time. Xenolinguistics is a hypothetical language used to communicate with other sentient beings in the universe. The rationale for composing sonic xenolingustic expressions is the belief that the universe is considered conscious and that there is a field of consciousness existing throughout the universe that in principle is also instrumental in how communication can evolve with extraterrestrials. Outlines of other attempts at extraterrestrial communication by other researchers will be offered based on current literature. The probability that other life forms have established some mode of information exchange that is detectable and that, in return, may be able to create a form of communication to respond will be covered. It is postulated that various energy fields existing before and after the creation of our universe interacted with one another becoming abiotic, and then over time, formed even more complex structures. It is these complex structures that were then able to communicate essential information for maintaining their stability and survivability by using specific signalling frequencies. It is hypothesized that first life in the universe emerged within an already existing field of information and that our consciousness is thereby able to establish communication with other forms of consciousness in the universe. It is on this basis that a novel scientific and philosophical paradigm is considered in which the universe is conceived of as an active information matrix that can entertain potential extraterrestrial communication. In this framework, the present article will offer a new approach to orchestrated electronic sounds as a means to such communication. By integrating quantum physical properties into that sonic framework, a new study emerged on how sonic xenolinguistic elements can be incorporated into electronic composition techniques. This new framework may produce new algorithms for musical expression that not only represent an innovative future of electronic music but may also be crucial in the formulation and induction of new states of consciousness that will enable humankind to directly participate in the further becoming of the universe as a result of the evolution of this universal field of consciousness. (shrink)