Prospective elementary teachers’ claiming in responses to false generalizations

When faced with a false generalization and a counterexample, what types of claims do prospective K-8 teachers make, and what factors influence the type and prudence of their claims relative to the data, observations, and arguments reported? This article addresses that question. Responses to refutation tasks and cognitive interviews were used to explore claiming. It was found that prospective K-8 teachers’ claiming can be influenced by knowledge of argumentation; knowledge and use of the mathematical practice of exception barring; perceptions of the task; use of natural language; knowledge of, use of, and skill with the mathematics register; and abilities to technically handle data or conceptual insights. A distinction between technical handlings for developing claims and technical handlings for supporting claims was made. It was found that prudent claims can arise from arguer-developed representations that afford conceptual insights, even when searching for support for a different claim.     

Delay-Dependent Stability of Linear Multistep Methods for Neutral Systems with Distributed Delays

This paper considers the asymptotic stability of linear multistep (LM) methods for neutral systems with distributed delays. In particular, several sufficient conditions for delay-dependent stability of numerical solutions are obtained based on the argument principle. Compound quadrature formulae are used to compute the integrals. An algorithm is proposed to examine the delay-dependent stability of numerical solutions. Several numerical examples are performed to verify the theoretical results.     

On meromorphic extendibility

Let D be a bounded domain in the complex plane whose boundary consists of finitely many pairwise disjoint real-analytic simple closed curves. Let f be an integrable function on bD. In the paper we show how to compute the candidates for poles of a meromorphic extension of f through D and thus reduce the question of meromorphic extendibility to the question of holomorphic extendibility. Let A(D) be the algebra of all continuous functions on which are holomorphic on D. We prove that a continuous function f on bD extends meromorphically through D if and only if there is an N∈N∪{0} such that the change of argument of Pf+Q along bD is bounded below by −2πN for all P,Q∈A(D) such that Pf+Q≠0 on bD. If this is the case then the meromorphic extension of f has at most N poles in D, counting multiplicity.     

带有分段常数变元的时滞微分方程解的稳定性和振动性

本文讨论带有分段常数变元的时滞微分方程解的渐性性质。我们利用Ｒａｚｕｍｉｋｈｉｍ方法证明了零解的稳定性，并且改进了文［１］得到的两上振动定理。     

Analytical and numerical methods for the stability analysis of linear fractional delay differential equations

In this paper, several analytical and numerical approaches are presented for the stability analysis of linear fractional-order delay differential equations. The main focus of interest is asymptotic stability, but bounded-input bounded-output (BIBO) stability is also discussed. The applicability of the Laplace transform method for stability analysis is first investigated, jointly with the corresponding characteristic equation, which is broadly used in BIBO stability analysis. Moreover, it is shown that a different characteristic equation, involving the one-parameter Mittag-Leffler function, may be obtained using the well-known method of steps, which provides a necessary condition for asymptotic stability. Stability criteria based on the Argument Principle are also obtained. The stability regions obtained using the two methods are evaluated numerically and comparison results are presented. Several key problems are highlighted.     

The Existence of Almost Periodic Solutions of Second Order Neutral Differential Equations with Piecewise Constant Argument

51.Intr0ducti0nInthispaper,weconsidertheexistenceofalmostperiodicsoluti0nsforthefoll0wingneutralfunctionaldifferentialebuationwithpiecewiseconstantargument:wherep,qarenonzeroconstants,p(t)lsanalmostper1odicfunctlon,g:RXRXR-Risanalm0stperiodicfunctionintanduniformlyonRXR,andL.jstandsforthegreatest-integerfunction.Notethatforanyintegern,if2n-10)andtheequations(1),(2)areadvanced(orretardedrespectively).Differentialequationswithpiecewiseconstantar…     

A geometric algorithm for winding number computation with complexity analysis

Many methods to compute the winding number of plane curves have been proposed, often with the aim of counting the number of roots of polynomials (or, more generally, zeros of analytic functions) inside some region by using the principle of argument. In this paper we propose another method, which are not based on numerical integration, but on discrete geometry. We give conditions that ensure its correct behavior, and a complexity bound based on the distance of the curve to singular cases. Besides, we provide a modification of the algorithm that detects the proximity to a singular case of the curve. If this proximity is such that the number of operations required grows over certain threshold, set by the user, the modified algorithm returns without winding number computation, but with information about the distance to singular case. When the method is applied to polynomials, this information refers to the localization of the roots placed near the curve.     

Singularities of the matrix exponent of a Markov additive process with one-sided jumps

We analyze the number of zeros of det(F(α))$det\left(F\left(\alpha \right)\right)$, where F(α)$F\left(\alpha \right)$ is the matrix exponent of a Markov Additive Process (MAP) with one-sided jumps. The focus is on the number of zeros in the right half of the complex plane, where F(α)$F\left(\alpha \right)$ is analytic. In addition, we also consider the case of a MAP killed at an independent exponential time. The corresponding zeros can be seen as the roots of a generalized Cramér–Lundberg equation. We argue that our results are particularly useful in fluctuation theory for MAPs, which leads to numerous applications in queueing theory and finance.     

Probabilistic qualification of attack in abstract argumentation

An argument graph is a graph where each node denotes an argument, and each arc denotes an attack by one argument on another. It offers a valuable starting point for theoretical analysis of argumentation following the proposals by Dung. However, the definition of an argument graph does not take into account the belief in the attacks. In particular, when constructing an argument graph from informal arguments, where each argument is described in free text, it is often evident that there is uncertainty about whether some of the attacks hold. This might be because there is some expressed doubt that an attack holds or because there is some imprecision in the language used in the arguments. In this paper, we use the set of spanning subgraphs of an argument graph as a sample space. A spanning subgraph contains all the arguments, and a subset of the attacks, of the argument graph. We assign a probability value to each spanning subgraph such that the sum of the assignments is 1. This means we can reflect the uncertainty over which is the actual subgraph using this probability distribution. Using the probability distribution over subgraphs, we can then determine the probability that a set of arguments is admissible or an extension. We can also obtain the probability of an attack relationship in the original argument graph as a marginal distribution (i.e. it is the sum of the probability assigned to each subgraph containing that attack relationship). We investigate some of the features of this proposal, and we consider the utility of our framework for capturing some practical argumentation scenarios.