Computational Theory Research Articles

Cognitive Technology to Evaluate the Academic Learning of Computational Cognition in Psychology Students

<p style="text-align:justify">This study illustrated an alternative way to evaluate students’ academic learning. It involved the joint and intertwined application of the natural semantic network technique, computer simulations, and semantic priming experiments to assess the cognitive changes in knowledge structures due to academic learning in two groups of psychology students. The experimental group was enrolled in a course on computational cognition, while the control group was oblivious to this course. The results indicated that the cognitive assessment tools discriminate the cognitive changes produced as a result of general training undertaken in a psychology degree versus the influence of a specific course. After the course, the experimental group increased their technical vocabulary, changed their conceptual valuation of definers related to computational theories of mind, and reorganized the relations among definers according to the computational cognition approach. Also, this group presented a higher connectivity index between the concepts of the semantic network, their conceptual activation level and conceptual co-activation pattern changed, and their access level to the evaluated schema’s concepts improved. In contrast, the control group did not show significant changes in their cognitive patterns after the course. These findings suggest that cognitive tools may be helpful in the diagnosis of academic learning.</p>

Thermodynamics of Computations with Absolute Irreversibility, Unidirectional Transitions, and Stochastic Computation Times

Developing a thermodynamic theory of computation is a challenging task at the interface of nonequilibrium thermodynamics and computer science. In particular, this task requires dealing with difficulties such as stochastic halting times, unidirectional (possibly deterministic) transitions, and restricted initial conditions, features common in real-world computers. Here, we present a framework which tackles all such difficulties by extending the martingale theory of nonequilibrium thermodynamics to generic nonstationary Markovian processes, including those with broken detailed balance and/or absolute irreversibility. We derive several universal fluctuation relations and second-law-like inequalities that provide both lower and upper bounds on the intrinsic dissipation (mismatch cost) associated with any periodic process—in particular, the periodic processes underlying all current digital computation. Crucially, these bounds apply even if the process has stochastic stopping times, as it does in many computational machines. We illustrate our results with exhaustive numerical simulations of deterministic finite automata processing bit strings, one of the fundamental models of computation from theoretical computer science. We also provide universal equalities and inequalities for the acceptance probability of words of a given length by a deterministic finite automaton in terms of thermodynamic quantities, and outline connections between computer science and stochastic resetting. Our results, while motivated from the computational context, are applicable far more broadly. Published by the American Physical Society 2024

Creativity and Machine Learning: A Survey

There is a growing interest in the area of machine learning and creativity. This survey presents an overview of the history and the state of the art of computational creativity theories, key machine learning techniques (including generative deep learning), and corresponding automatic evaluation methods. After presenting a critical discussion of the key contributions in this area, we outline the current research challenges and emerging opportunities in this field.

Some New Results on Domination and Independent Dominating Set of Some Graphs

One area of graph theory that has been studied in great detail is dominance in graphs. Applications for dominating sets are numerous. In wireless networking, dominant sets are used to find effective paths inside ad hoc mobile networks. They have also been used in the creation of document summaries and safe electrical grid systems. A set <I>S</I>⊆<I>V</I> is said to be dominating set of <I>G</I> if for every <i>v </i>є <I>V</I>-<I>S</I> there exists a vertex <i>u</i> є <I>S</I> such that <i>uv</i> є <I>E</I>. The dominance number of <I>G</I>, represented by <i>γ</i>(<I>G</I>), is the lowest cardinality of vertices among the dominating set of <I>G</I>. A classic NP-complete decision problem in computational complexity theory determines whether, given a graph <I>G</I> and input <I>K</I>, <i>γ</i>(<I>G</I>) ≤ <I>K</I>. This is known as the dominating set issue. Consequently, it is thought that calculating <i>γ</i>(<I>G</I>) for each given graph <I>G</I> may not be possible to do with a feasible algorithm. In addition to efficient approximation tactics, there exist efficient exact techniques for various graph classes. If there are no neighboring vertices in a subset <I>S</I>, then <I>S</I>⊆<I>V</I> is an independent set. Additionally, the empty set and the subset with just one vertex are independent. An independent dominating set of <I>G</I> is a set <I>S</I> of vertices in a graph <I>G</I> that is both an independent and a dominating set of <I>G</I>. This paper's primary goal is to investigate the dominance and independent dominating set of many graphs, including the line graph, the alternate triangular belt graph, the bistar graph, the triangular snake graph, and others.

Randomness of Shapes and Statistical Inference on Shapes via the Smooth Euler Characteristic Transform

In this article, we establish the mathematical foundations for modeling the randomness of shapes and conducting statistical inference on shapes using the smooth Euler characteristic transform. Based on these foundations, we propose two chi-squared statistic-based algorithms for testing hypotheses on random shapes. Simulation studies are presented to validate our mathematical derivations and to compare our algorithms with state-of-the-art methods to demonstrate the utility of our proposed framework. As real applications, we analyze a data set of mandibular molars from four genera of primates and show that our algorithms have the power to detect significant shape differences that recapitulate known morphological variation across suborders. Altogether, our discussions bridge the following fields: algebraic and computational topology, probability theory and stochastic processes, Sobolev spaces and functional analysis, analysis of variance for functional data, and geometric morphometrics.

Preface

The 2023 International Conference on Applied Mathematics and Digital Simulation (AMDS 2023) was held successfully on 28-29 December 2023 in Beijing, China. The contributions are the results of submissions from the conference participants, who provide readers with a broader view of mathematical, statistical and computational science methods, ideas and tools.There are 92 participants in AMDS 2023, in which the program includes 6 keynote reports (35-45 minutes), 48 oral presentations (15 mins+3 Q&A) included in four sessions (Mathematics and Computational Theory, Mathematical Modelling and Machine Learning Methods Statistics Modelling and Data Analysis, and Fluid Dynamics and Mechanics), 15 E-posts and 23 listeners. The point of the conference emphasizes the development of theories and applications and promotes interdisciplinary endeavors among mathematicians, statisticians, scientists, engineers and researchers from other related disciplines.This volume comprises selected papers from the AMDS2023 conference. Accepted manuscripts were peer-reviewed by 2 to 4 reviewers in a double-blind review process. A total of 48 reviewers participated in this conference and provided their professional comments to authors to ensure the quality of the manuscripts. There are six topic partitions, including Mathematics and Computational Theory, Statistics Modelling and Data Analysis, Mathematical Modelling and Machine Learning Methods, Fluid Dynamics and Mechanics, Mathematical Modelling in Physics and Control and Automation, which constitutes an up-to-date account of principles, techniques, and tools for mathematical simulation and modelling in a wide range of research fields.We would like to thank the authors of all papers and participants; the members of the Scientific Committee who assisted with the review of the papers submitted and presented at the conference; the four session chairs: Prof. Yichuan Zhao, Prof. Quanxin Zhu, Prof. P.M. Siva Raja, Prof. Rao Li; the six keynote speakers: Prof. Alexander G. Ramm, Prof. Ovidiu Radulescu, Prof. Hajime Urakawa, Prof. Yanjun Liu, Prof. Grienggrai Rajchakit and Prof. Oscar Eduardo Ruiz Salguero; the organzier and sponsors: the Hubei Mengshun Exhibition Service Center, the Research Center for Stochastic Configuration Machines (SCM), the National Laboratory for Scientific Computing (LNCC); the publisher: IOP Publishing Ltd agrees to publish the AMDS 2023 proceedings. We are grateful for your attendance and contribution to a successful AMDS 2023.Organizing Cmmittee of AMDS 2023Jiang Zhu (Advisory Chair)National Laboratory for Scientific Computing-LNCC, BraziList of Conference Committees are available in this Pdf.

The Ginsburg–Sands theorem and computability theory

The Ginsburg–Sands theorem from topology states that every infinite topological space has an infinite subspace homeomorphic to exactly one of the following five topologies on ω: indiscrete, discrete, initial segment, final segment, and cofinite. The original proof is nonconstructive, and features an interesting application of Ramsey's theorem for pairs (RT22). We analyze this principle in computability theory and reverse mathematics, using Dorais's formalization of CSC spaces. Among our results are that the Ginsburg–Sands theorem for CSC spaces is equivalent to ACA0, while for Hausdorff spaces it is provable in RCA0. Furthermore, if we enrich a CSC space by adding the closure operator on points, then the Ginsburg–Sands theorem turns out to be equivalent to the chain/antichain principle (CAC). The most surprising case is that of the Ginsburg–Sands theorem restricted to T1 spaces. Here, we show that the principle lies strictly between ACA0 and RT22, yielding arguably the first natural theorem from outside logic to occupy this interval. As part of our analysis of the T1 case we introduce a new class of purely combinatorial principles below ACA0 and not implied by RT22 which form a hierarchy generalizing the stable Ramsey's theorem for pairs (SRT22). We show that one of these, the Σ20 subset principle (Σ20-Subset), has the property that it, together with the cohesive principle (COH), is equivalent over RCA0 to the Ginsburg–Sands theorem for T1 CSC spaces.

Games, Norms, and Utterances

AbstractA body of work proposes that social-norm change can be explained in terms of game theory. These game theoretic models, however, don't fully account for how and why utterances are used to change social norms. This paper describes the problem and some of the solution elements. There are three existing, relevant, game-based models. The first is a game theoretic model of social norm change (Bicchieri, 2005, 2016). This accounts for how individuals make decisions to adhere to or violate norms, based on empirical expectations of how others will behave. The second is the idea of a conversational game (Lewis, 1979) and its extensions. This posits that speech acts are accommodated in a conversation to make what is said correct play. This feature can explain how some speech acts, such as slurring utterances, change the dynamics of a conversation. The third is a theory of pragmatic inference, known as Rational Speech Act theory (Goodman and Frank, 2016). This is a computational theory of pragmatics, of how listeners interpret utterances and how speakers construct utterances that can be understood. This paper proposes, without setting out the full formal model, that elements of these three theories need to be incorporated together into a game theoretic model of how utterances change long-term social norms.

On-premises superconducting quantum computer for education and research

With a growing interest in quantum technology globally, there is an increasing need for accessing relevant physical systems for education and research. In this paper we introduce a commercially available on-site quantum computer utilizing superconducting technology, offering insights into its fundamental hardware and software components. We show how this system can be used in education to teach quantum concepts and deepen understanding of quantum theory and quantum computing. It offers learning opportunities for future talent and contributes to technological progress. Additionally, we demonstrate its use in research by replicating some notable recent achievements.

Time-Controlled Authentication Strategies for Molecular Information Transfer.

Modern cryptography based on computational complexity theory is mainly constructed with silicon-based circuits. As DNA nanotechnology penetrates the molecular domain, utilizing molecular cryptography for data access protection in the biomolecular domain becomes a unique approach to information security. However, building security devices and strategies with robust security and compatibility is still challenging. Here, this study reports a time-controlled molecular authentication strategy using DNAzyme and DNA strand displacement as the basic framework. A time limit exists for authorization and access, and this spontaneous shutdown design further protects secure access. Multiple hierarchical authentications, temporal Boolean logic authentication, and enzyme authentication strategies are constructed based on DNA networks'good compatibility and programmability. This study gives proof of concept for the detection and protection of bioinformation about single nucleotide variants and miRNA, highlighting their potential in biosensing and security protection.

Combining Scattering Experiments and Colloid Theory to Characterize Charge Effects in Concentrated Antibody Solutions.

Charges and their contribution to protein-protein interactions are essential for the key structural and dynamic properties of monoclonal antibody (mAb) solutions. In fact, they influence the apparent molecular weight, the static structure factor, the collective diffusion coefficient, or the relative viscosity, and their concentration dependence. Further, charges play an important role in the colloidal stability of mAbs. There exist standard experimental tools to characterize mAb net charges, such as the measurement of the electrophoretic mobility, the second virial coefficient, or the diffusion interaction parameter. However, the resulting values are difficult to directly relate to the actual overall net charge of the antibody and to theoretical predictions based on its known molecular structure. Here, we report the results of a systematic investigation of the solution properties of a charged IgG1 mAb as a function of concentration and ionic strength using a combination of electrophoretic measurements, static and dynamic light scattering, small-angle X-ray scattering, and tracer particle-based microrheology. We analyze and interpret the experimental results using established colloid theory and coarse-grained computer simulations. We discuss the potential and limits of colloidal models for the description of the interaction effects of charged mAbs, in particular pointing out the importance of incorporating shape and charge anisotropy when attempting to predict structural and dynamic solution properties at high concentrations.

Similarity in evoked responses does not imply similarity in macroscopic network states.

It is commonplace in neuroscience to assume that if two tasks activate the same brain areas in the same way, then they are recruiting the same underlying networks. Yet computational theory has shown that the same pattern of activity can emerge from many different underlying network representations. Here we evaluated whether similarity in activation necessarily implies similarity in network architecture by comparing region-wise activation patterns and functional correlation profiles from a large sample of healthy subjects (N = 242). Participants performed two executive control tasks known to recruit nearly identical brain areas, the color-word Stroop task and the Multi-Source Interference Task (MSIT). Using a measure of instantaneous functional correlations, based on edge time series, we estimated the task-related networks that differed between incongruent and congruent conditions. We found that the two tasks were much more different in their network profiles than in their evoked activity patterns at different analytical levels, as well as for a wide range of methodological pipelines. Our results reject the notion that having the same activation patterns means two tasks engage the same underlying representations, suggesting that task representations should be independently evaluated at both node and edge (connectivity) levels.

Schiff baseAlkyne precursor for1,2,3-Triazole functionalized organosiliconas a PotentialSensor for Zn(II)andAntioxidantActivity

Schiff base linked1,2,3-triazole silane5has been synthesized through the Schiff base terminated alkyne with azido via click chemistry,the compound4 structure elucidated through X-ray crystallography, and the compound5 is well characterized through different techniques such asFT-IR, 1H and 13C NMR and Mass spectrometry. UV–visible sensing studies of synthesized compounds4 and5 have been performed, and both are efficient in detectingZn(II) ion, but compound 5 has imparted a higher mode of attraction to Zn(II) with limit of detection (LOD) value (1.4 x 10-6M) wherethe compound 4 is calculated to be (1.25 x 10-5M). By Job's method, the stoichiometric ratio of compound5 and Zn(II) iscalculated to bea 1:1 ratio. The complex of compound 5 with Zn(II) was prepared. A radical and oxidative species are responsible for the deteriorating of stabilized molecules. The synthesized compound 5hasantioxidant propertiesthat can potentially scavenge 2,2-diphenyl-1-picrylhydrazyl (DPPH) radicals. Further to verify the mode of binding interaction between compound 5andZn(II), computational Density functional theory (DFT) study was evaluated.

Nanofibrous Covalent Organic Frameworks Based Hierarchical Porous Separators for Fast‐Charging and Thermally Stable Lithium Metal Batteries

AbstractEngineering multifunctional smart separators are important for the ongoing pursuit of fast‐charging and safe batteries. Herein, a novel nanofibrous covalent organic framework (COF) based separator with well‐designed hierarchical porous channels is fabricated to effectively regulate mass transport for fast‐charging and thermally stable lithium metal batteries (LMBs). Such a hierarchical porous separator consists of electrospun polyacrylonitrile nanofibers with macroporous channels (average diameter of 323 nm) and mesoporous channels (≈7 nm) created between amide‐group‐bonded COF nanoparticles with intrinsic 1.6 nm lithiophilic microporous channels (PAN/AM‐COF). Computational fluid dynamics and density functional theory calculations demonstrate that PAN/AM‐COF can simultaneously facilitate high‐speed and selective transport of Li+, as well as homogeneous deposition of Li, achieving high conductivity (3.33 mS cm−1) and high Li+ transference number (0.79). As a result, Li || LFP full cell with PAN/AM‐COF displays superior cycling stability at 10 C with an acceptable capacity attenuation (0.037% per cycle) over 1000 cycles. Moreover, when operating under an extreme temperature of 100 °C, the Li || LFP full cell with PAN/AM‐COF can still operate stably for 300 cycles at 30 C, highlighting its potential processing scalability for ultrafast‐charging energy storage systems. This study gives insights into designing functional separators for fast‐charging LMBs.

Analysis of the structural reliability of communication networks supporting protective switching mechanisms for one protected section and one backup section

Objectives. The service level agreement is an important tool used in building reasonable relations between subscribers and operators of telecommunication networks. This includes the quality of services provided. One key component is reliability as assessed by the availability factor. The most suitable model for assessing the reliability of the service provided is a random graph model based on the service contour. This is the set of technical resources involved in the provision of this service. In this formulation, the assessment of the reliability of the service is based on the reliability of elements which constitute the telecommunications network (graph), nodes (vertices) and communication lines (edges). At the same time, the availability factors of nodes and lines are determined by the design features of the distribution environment, as well as the technical means used to organize them. The purpose of this work is to develop an approach to analyzing the reliability of telecommunication networks which support protective switching mechanisms for one protected and one backup sections.Methods. The following methods are used: theory of random graphs, matrices, probabilities and computer modeling.Results. The elements of the route, both basic and reserving, are divided into three groups. The first indicates permanent unchangeable parts of the paths, the second group identifies the reserved sections, and the third group indicates the reserving sections. At the same time, each of the reserved and reserving sections is formed on the basis of specified preferences. They are usually aimed at increasing the resulting reliability, although other rules may be used. In the case of protective switching schemes for one protected section and one backup sections, a variant of forming routes used for further calculations of the reliability indicator is shown.Conclusions. Using the example of a backbone network, the study shows that the use of protective switching mechanisms for the case of one required transmission route demonstrates a significant increase in reliability, with the exception of the use of protective switching in sections. This is primarily due to the topology features of the network under consideration.

Causal learning by infants and young children: From computational theories to language practices.

Causal reasoning-the ability to reason about causal relations between events-is fundamental to understanding how the world works. This paper reviews two prominent theories on early causal learning and offers possibilities for theory bridging. Both theories grow out of computational modeling and have significant areas of overlap while differing in several respects. Explanation-Based Learning (EBL) focuses on young infants' learning about causal concepts of physical objects and events, whereas Bayesian models have been used to describe causal reasoning beyond infancy across various concept domains. Connecting the two models offers a more integrated approach to clarifying the developmental processes in causal reasoning from early infancy through later childhood. We further suggest that everyday language practices offer a promising space for theory bridging. We provide a review of selective work on caregiver-child conversations, in particular, on the use of scaffolding language including causal talk and pedagogical questions. Linking the research on language practices to the two cognitive theories, we point out directions for further research to integrate EBL and Bayesian models and clarify how causal learning unfolds in real life. This article is categorized under: Psychology > Learning Cognitive Biology > Cognitive Development.

Count-free Weisfeiler–Leman and group isomorphism

We investigate the power of counting in Group Isomorphism. We first leverage the count-free variant of the Weisfeiler–Leman Version I algorithm for groups [J. Brachter and P. Schweitzer, On the Weisfeiler–Leman dimension of finite groups, in 35th Annual ACM/IEEE Symp. Logic in Computer Science, eds. H. Hermanns, L. Zhang, N. Kobayashi and D. Miller, Saarbrucken, Germany, July 8–11, 2020 (ACM, 2020), pp. 287–300, doi:10.1145/3373718.3394786] in tandem with bounded non-determinism and limited counting to improve the parallel complexity of isomorphism testing for several families of groups. These families include: Direct products of non-Abelian simple groups. Coprime extensions, where the normal Hall subgroup is Abelian and the complement is an [Formula: see text]-generated solvable group with solvability class poly log log [Formula: see text]. This notably includes instances where the complement is an [Formula: see text]-generated nilpotent group. This problem was previously known to be in [Formula: see text] [Y. Qiao, J. M. N. Sarma and B. Tang, On isomorphism testing of groups with normal Hall subgroups, in Proc. 28th Symp. Theoretical Aspects of Computer Science, Dagstuhl Castle, Leibniz Center for Informatics, 2011), pp. 567–578, doi:10.4230/LIPIcs. STACS.2011.567], and the complexity was recently improved to [Formula: see text] [J. A. Grochow and M. Levet, On the parallel complexity of group isomorphism via Weisfeiler–Leman, in 24th Int. Symp. Fundamentals of Computation Theory, eds. H. Fernau and K. Jansen, Lecture Notes in Computer Science, Vol. 14292, September 18–21, 2023, Trier, Germany (Springer, 2023), pp. 234–247]. Graphical groups of class [Formula: see text] and exponent [Formula: see text] [A. H. Mekler, Stability of nilpotent groups of class 2 and prime exponent, J. Symb. Logic 46(4) (1981) 781–788] arising from the CFI and twisted CFI graphs [J. -Y. Cai, M. Fürer and N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica 12(4) (1992) 389–410], respectively. In particular, our work improves upon previous results of Brachter and Schweitzer [On the Weisfeiler–Leman dimension of finite groups, in 35th Annual ACM/IEEE Symp. Logic in Computer Science, eds. H. Hermanns, L. Zhang, N. Kobayashi and D. Miller, Saarbrucken, Germany, July 8–11, 2020 (ACM, 2020), pp. 287–300, doi:10.1145/3373718.3394786]. Notably, each of these families was previously known to be identified by the counting variant of the more powerful Weisfeiler–Leman Version II algorithm. We finally show that the [Formula: see text]-ary count-free pebble game is unable to even distinguish Abelian groups. This extends the result of Grochow and Levet (ibid), who established the result in the case of [Formula: see text]. The general theme is that some counting appears necessary to place Group Isomorphism into [Formula: see text].

Influence of guide vane opening on channel vortex and pressure pulsation in Francis turbine runners

In order to investigate the impact of guide vane opening on channel vortex and pressure pulsation within the runner of a Francis turbine, this research examines the cavitation phenomenon, channel vortex phenomenon, and flow field characteristics of a power station's turbine in China. The investigation is conducted using computational fluid dynamics theory. Furthermore, the analysis focuses on the influence of changes in guide vane opening on the flow state within the turbine runner. The findings indicate that the occurrence of rotor cavitation is severe when the opening is small, and increasing the opening reduces the cavitation capacity of the rotor. The presence of a lobe vortex phenomenon is mainly observed within a small range of guide vane openings, and altering the opening modifies both the range of influence and flow characteristics of the lobe vortex. In the middle range of guide vane openings, vortex pressure pulsation dominates within the rotor, with the highest amplitude of pressure pulsation occurring at a 60% opening. In the large opening range, pressure pulsation mainly occurs in the lobe frequency pressure pulsation of the rotor within the lobe-less area. The amplitude of blade frequency is typically small, indicating good hydraulic stability of the unit. These study results elucidate the interval of stable operating conditions for the unit and offer valuable insights for maintaining its stable operation.

The influence of catalyst structure on acidic strength of –SO3H groups for alkyl levulinate synthesis from biomass–derived feedstocks using sulfonic acid functionalized flexible MOF catalyst

A Brönsted acidic BUT−8(Cr)–SO3H metal–organic framework was used for the synthesis of ethyl levulinate from two different biomass–derived platform chemicals viz. furfuryl alcohol and levulinic acid. The catalyst was well characterized using various methods such as PXRD, FTIR spectroscopy, acid–base titration, NH3–TPD, TGA–DTA, SEM, TEM as well as the computational density functional theory (DFT) method. The performance of BUT–8(Cr)–SO3H catalysts was found to be superior to other catalysts (HZSM–5, H–Beta, and amberlyst –15) taken in this study. The sulfonic acid moieties bound to the aromatic naphthalene structure of BUT–8(Cr)–SO3H MOF were found to have a much stronger influence on the catalytic performance than the sulfonic acid moieties bound to the styrene framework of amberlyst–15. The key discoveries regarding the Brönsted acidic characteristics were computed via DFT incorporating the hydrogen removal energy, molecular electrostatic potential maps, and stability of the conjugate base of –SO3H moieties. The trend in the DFT–derived values was in the following order: BUT–8(Cr)–SO3H > Linker–naph –SO3H > Amberlyst–15. The results also indicate the influence of Cr metal on MOF structure to increase the acidic strength of the –SO3H group. The reaction optimization using DOE, recyclability, leaching study, and substrate scope study for both pathways using BUT–8(Cr)–SO3H were obtained.

Labeled sample compression schemes for complexes of oriented matroids

We show that the topes of a complex of oriented matroids (abbreviated COM) of VC-dimension d admit a proper labeled sample compression scheme of size d. This considerably extends results of Moran and Warmuth on ample classes, of Ben-David and Litman on affine arrangements of hyperplanes, and of the authors on complexes of uniform oriented matroids, and is a step towards the sample compression conjecture – one of the oldest open problems in computational learning theory. On the one hand, our approach exploits the rich combinatorial cell structure of COMs via oriented matroid theory. On the other hand, viewing tope graphs of COMs as partial cubes creates a fruitful link to metric graph theory.