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)

“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)

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.

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)

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)

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)

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)

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)

Dwork, Hardt, Pitassi, Reingold, & Zemel [6] introduced two notions of fairness, each of which is meant to formalize the notion of similar treatment for similarly qualified individuals. The first of these notions, which we call additive metric fairness, has received much attention in subsequent work studying the fairness of a system composed of classifiers which are fair when considered in isolation [3, 4, 7, 8, 12] and in work studying the relationship between fair treatment of individuals and fair treatment (...) of groups [6, 7, 13]. Here, we extend these lines of research to the second, less-studied notion, which we call multiplicative metric fairness. In particular, we exactly characterize the fairness of conjunctions and disjunctions of multiplicative metric fair classifiers, and the extent to which a classifier which satisfies multiplicative metric fairness also treats groups fairly. This characterization reveals that whereas additive metric fairness becomes easier to satisfy when probabilities of acceptance are small, leading to unfairness under functional and group compositions, multiplicative metric fairness is better-behaved, due to its scale-invariance. (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)

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)

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)

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)

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)

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)

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)

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)

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)

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)

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)

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)

“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).

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)

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 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)

This paper details an algorithm for a binary, primitive recursive function that apparently computes, for any $i$ and $n$, $f_i\left(i,n\right)$. The algorithm works by exploiting the fact that, in the formal system described, the index assigned to a p.r. function codes the definitional composition of the function. The algorithm exploits such a code to generate a "canonical proof" of $f_i\left(i,n\right)=m$. Since this kind of algorithm is shown impossible by diagonal arguments, the algorithm must be in error. But the error (...) is worth investigating, for it is unclear upon sustained, earnest reflection where it lies. I thus offer this material to readers with a humble request for assistance. (shrink)

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 objective of this work is to categorize the available fly ashes in different parts of the world into distinct groups based on its compositional attributes. Kohonen's self-organizing feature map and radial basis function networks are applied in a cascading fashion for the classification of fly ashes in terms of its chemical parameters. The basic procedure of the methodology consists of three stages: apply self-organizing neural net to ascertain possible number of groups, delineate them and identify the group sensitive attributes; (...) find mean values of sensitive attributes of the elicited groups and augment them as start-up prototypes in k-means algorithm and find the refined centroids of these groups; incorporate the centroids in a two layer radial basis function network and fine-tune the delineated groups and develop an indexing equation using the weights of the stabilized network. Further, to demonstrate the utility of this classification scheme, the so formed groups were correlated with their performance in High Volume Fly Ash Concrete System [HVFAC]. The categorization was found to be excellent and compares well with Canadian Standard Association's [CSA A 3000] classification scheme. (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)

Current artificial neural network or connectionist models of music cognition embody feature-extraction and feature-weighting principles. This paper reports two experiments which seek evidence for similar processes mediating recognition of short musical compositions by musically trained and untrained listeners. The experiments are cast within a pattern recognition framework based on the vision-audition analogue wherein music is considered an auditory pattern consisting of local and global features. Local features such as inter-note interval, and global features such as melodic contour, are derived from (...) a two-dimensional matrix in which music is represented as a series of frequencies plotted over time.Manipulation of inter-note interval affected accuracy and reaction time measures in a discrimination task, whereas the same variables were affected by manipulation of melodic contour in a classification task. Musical training is thought of as a form of practice in musical pattern recognition and, as predicted, accuracy and reaction time measures of musically trained subjects were significantly better than those of untrained subjects. Given the evidence for feature-extraction and weighting processes in music recognition tasks, two connectionist models are discussed. The first is a single-layer perceptron which has been trained to discriminate between compositions according to inter-note interval. A second network, using the back-propagation algorithm and sequential input of patterns, is also discussed. (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)

This piece, included in the drift special issue of continent. , was created as one step in a thread of inquiry. While each of the contributions to drift stand on their own, the project was an attempt to follow a line of theoretical inquiry as it passed through time and the postal service(s) from October 2012 until May 2013. This issue hosts two threads: between space & place and between intention & attention . The editors recommend that to experience the (...) drifiting thought that attention be paid to the contributions as they entered into conversation one after another. This particular piece is from the BETWEEN INTENTION & ATTENTION thread: Jeremy Fernando, Sitting in the Dock of the bay, watching... * R.H. Jackson, Reading Eyes * Gina Rae Foster, Nyctoleptic Nomadism: The Drift/Swerve of Knowing * Bronwyn Lay, Driftwood * Patricia Reed, Sentences on Drifitng * David Prater, drift: a way * * * * * 1. To drift is to be propelled by currents. 2. Sentences are textual currents. 3. To drift is to be com pelled with currents. 4. To be compelled is to be overcome by some force. 5. To be overcome by some force requires the instantiation of a weightless body (virtual or actual), upon which and through which a force can operate. 6. Forces can be physical, cognitive, unconscious and sensory. 7. Forces of drift have no particular telos; they incline bodies without knowable destination. 8. Drifting is nomadic, where nomadism includes movements between places, times (also time-zones), genres, thought and cognitive states. 9. Forces are attractors; attractivity is a force. 10. Attractivity is a relation between force and body. 11. Attractivity is relation of exteriority; it is of the domain of the foreign. 12. To drift is to become the prey of attraction, the prey of the foreign. 13. In the movement of becoming prey, one can either be eaten or feed into a re-composition of things. 14. Drifting is liminal; it can be equally productive and destructive. 15. The deviated course implied by drifting may yield novelty, yet may equally yield a perpetual deferral of any positionality. 16. The state of drifting is necessary to the creation of novelty. 17. The state of drifting can inhibit the creation of novelty. 18. The modern drift was celebrated as a form of emancipation, through the liberation of urban structures traced on foot, to the negation of banal tasks in riding on the open highway. In the attention economy, drifting has become a paradigm of labour, precarious and otherwise. 19. To drift in a novel fashion requires a necessary threshold between distraction and re-attraction. 20. Re-attraction is a form of going off-track, yet implies the fidelity to an alter force. Re-attraction is eccentric in inclination, that is, decentred, casting alter orbits of orientation. 21. Eccentricity is a form of drift defined as a body inflected by the force of heterogeneous inclination. Eccentricity is the fidelity to the becoming-foreign of the body as prey to attractivity. 22. Drift as eccentricity is equal to the creation of novel modes of inclination alter to the limits of normative orbits of determinate trajectories. 23. The effects of eccentric drifting can only be known post-movement. 24. All modes of drifting (natural and cognitive) are relative to some former position, although distances and their capacity for measurement are inconsistent. 25. Eccentric drifting does not result in relativism. Drifting is transitional, and, like a Moiré pattern, produces interferences between things. 26. Where there is drifting there are both side-effects and side-affects, which feed-back into the inclination of drift itself. 27. Side-effects and side-affects may produce conditions and sensibilities of failure. 28. The ethics of drifting play out in the responsiveness to side-effects/side-affects. 29. Eccentric drifting is not algorithmic, informational, strategic nor opportunistic; it is tactically lived experience. 30. Eccentric drifting is a dance with contingency, of repositioning a body (a body includes thought) through the affirmation of re-attraction. 31. Eccentric drifting is a form of love, a love of existence that proceeds strategic coupling with ideas, people, situations, places and so forth. 32. As a form of love, eccentric drifting can generate changes of state (and even changes of State). 33. Currents that propel/compel a state of eccentric drifting may be imaginary; a possible current includes the attractive force to that which is not (yet) present. 34. Eccentric drifting is not only a state of transitional movement, but most importantly includes the fabrication of imaginary forces that could propel/compel a given body and its spheres of interaction. 35. These sentences comment on drift, but are not exemplary of drifting. (shrink)

Although there is wide agreement that ethics consults are at risk for conflicts of interest, ethics consultants have limited guidance with regard to how to identify and approach COIs. We aim to address these concerns and provide practical guidance. We will define and consider four categories of COIs: consult type, team composition, dual clinical roles and other concerns. We will define and consider six actions available for ECs to take in response to COIs: no action, disclosure only, obtaining a (...) second opinion, referring to another EC, referring to an institutional ethics committee or seeking an outside consult. We will then propose a points-based algorithm for ECs to use to determine the appropriate response to COI. Finally, we will discuss the strengths and limitations of our proposed algorithm. (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)

Earlier, we have studied computations possible by physical systems and by algorithms combined with physical systems. In particular, we have analysed the idea of using an experiment as an oracle to an abstract computational device, such as the Turing machine. The theory of composite machines of this kind can be used to understand (a) a Turing machine receiving extra computational power from a physical process, or (b) an experimenter modelled as a Turing machine performing a test of a known physical (...) theory T. Our earlier work was based upon experiments in Newtonian mechanics. Here we extend the scope of the theory of experimental oracles beyond Newtonian mechanics to electrical theory. First, we specify an experiment that measures resistance using a Wheatstone bridge and start to classify the computational power of this experimental oracle using non-uniform complexity classes. Secondly, we show that modelling an experimenter and experimental procedure algorithmically imposes a limit on our ability to measure resistance by the Wheatstone bridge. The connection between the algorithm and physical test is mediated by a protocol controlling each query, especially the physical time taken by the experimenter. In our studies we find that physical experiments have an exponential time protocol, this we formulate as a general conjecture. Our theory proposes that measurability in Physics is subject to laws which are co-lateral effects of the limits of computability and computational complexity. (shrink)

An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily incremental, involving the generation and selection among random local mutations and recombinations of (parts of) one's current model. We argue that, by narrowing and guiding exploration, this feature of (...) cognitive search is what allows human learners to discover better theories, without ever grappling directly with the problem of finding a “global optimum,” or best possible world model. We suggest this aspect of cognitive processing works analogously to how blind variation and selection mechanisms drive biological evolution. We propose algorithms developed for program synthesis provide candidate mechanisms for how human minds might achieve this. We discuss objections and implications of this perspective, finally suggesting that a better process-level understanding of how humans incrementally explore compositional theory spaces can shed light on how we think, and provide explanatory traction on fundamental cognitive biases, including anchoring, probability matching, and confirmation bias. (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)

The aim of the article is reasoning on an analogy which may help understand what an algorithm can do and, especially, cannot do. The analogy is given by Poe’s Philosophy of composition, in which, by making reference to his poem The raven, he argues for a singular strategy of composition we may compare with an algorithmic writing. KeywordsAlgorithm, Philosophy of technology, Poe.

A central concern of generative grammar is the relationship between hierarchy and word order, traditionally understood as two dimensions of a single syntactic representation. A related concern is directionality in the grammar. Traditional approaches posit process-neutral grammars, embodying knowledge of language, put to use with infinite facility both for production and comprehension. This has crystallized in the view of Merge as the central property of syntax, perhaps its only novel feature. A growing number of approaches explore grammars with different directionalities, (...) often with more direct connections to performance mechanisms. This paper describes a novel model of universal grammar as a one-directional, universal parser. Mismatch between word order and interpretation order is pervasive in comprehension; in the present model, word order is language-particular and interpretation order (i.e., hierarchy) is universal. These orders are not two dimensions of a unified abstract object (e.g., precedence and dominance in a single tree); rather, both are temporal sequences, and UG is an invariant real-time procedure (based on Knuth's stack-sorting algorithm) transforming word order into hierarchical order. This shift in perspective has several desirable consequences. It collapses linearization, displacement, and composition into a single performance process. The architecture provides a novel source of brackets (labeled unambiguously and without search), which are understood not as part-whole constituency relations, but as storage and retrieval routines in parsing. It also explains why neutral word order within single syntactic cycles avoids 213-like permutations. The model identifies cycles as extended projections of lexical heads, grounding the notion of phase. This is achieved with a universal processor, dispensing with parameters. The empirical focus is word order in noun phrases. This domain provides some of the clearest evidence for 213-avoidance as a cross-linguistic word order generalization. Importantly, recursive phrase structure “bottoms out” in noun phrases, which are typically a single cycle (though further cycles may be embedded, e.g., relative clauses). By contrast, a simple transitive clause plausibly involves two cycles (vP and CP), embedding further nominal cycles. In the present theory, recursion is fundamentally distinct from structure-building within a single cycle, and different word order restrictions might emerge in larger domains like clauses. (shrink)

Road link speed is one of the important indicators for traffic states. In order to incorporate the spatiotemporal dynamics and correlation characteristics of road links into speed prediction, this paper proposes a method based on LDA and GCN. First, we construct a trajectory dataset from map-matched GPS location data of taxis. Then, we use the LDA algorithm to extract the semantic function vectors of urban zones and quantify the spatial dynamic characteristics of road links based on taxi trajectories. Finally, we (...) add semantic function vectors to the dataset and train a graph convolutional network to learn the spatial and temporal dependencies of road links. The learned model is used to predict the future speed of road links. The proposed method is compared with six baseline models on the same dataset generated by GPS equipped on taxis in Shenzhen, China, and the results show that our method has better prediction performance when semantic zoning information is added. Both composite and single-valued semantic zoning information can improve the performance of graph convolutional networks by 6.46% and 8.35%, respectively, while the baseline machine learning models work only for single-valued semantic zoning information on the experimental dataset. (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.

Solar Resources takes stock of the resource - sunlight - on which any plan for solar heat conversion technologies must be based. It describes the evolution of theoretical models, algorithms, and equipment for measuring, analyzing, and predicting the quantity and composition of solar radiation, and it reviews and directs readers to insolation databases and other references that have been compiled since 1975. Following an overview of solar energy research by the editor, Raymond J. Bahm presents a comprehensive guide to (...) available insolation databases and other information resources in the United States. Charles M. Randall and Richard Bird discuss the theoretical models and algorithms used to characterize the transference of solar radiation through the earth's atmosphere. Their chapter also addresses the important question of the accuracy of the data sets produced by the various modeling methods and algorithms. The National Weather Service monitoring network and other major monitoring networks in the United States are discussed by Kirby Hanson and Thomas Stoffel. And Eugene Zerlaut covers the instrumentation used to measure total solar irradiance and spectral solar irradiance; he describes types of equipment, their manufacturers, procedures for calibration, and the accuracy of the data produced. Richard Bird and Carol Riordan explain the nature of spectral solar irradiance at the earth's surface, and John Jensenius describes the NWS Operational Solar Insolation Forecast System, which predicts the daily total global-horizontal insolation for two days. In the concluding chapter, Claude Robbins summarizes daylighting models and resources, and details methods for converting insolation date to illuminance data. Solar Resources is volume 2 in the series Solar Heat Technologies: Fundamentals and Applications, edited by Charles A. Bankston. (shrink)

In a supply chain system, the prices with which the suppliers supply its local commodity to the retailers should satisfy the requirements of the retailers and the consumers. The supply and demand scheme satisfying these requirements is reduced into fuzzy relation inequalities with min-product composition. Due to the difference between the min-product composition and the classical max-t-norm one, we first study the resolution of such min-product FRI system. For optimization management in the supply chain system, we further investigate (...) a maximin programming problem subject to the min-product FRIs. An algorithm is proposed to obtain the optimal solution based on the quasi-maximal matrix and corresponding index set. To illustrate the efficiency of our proposed algorithm, we provide a simple numerical example. The obtained optimal solution reflects an optimal pricing scheme, which maximizes the minimum prices of the commodity from the suppliers. (shrink)

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)

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)