水凝胶类软物质材料理论中的数学问题

 水凝胶是一种具有广泛应用前景的软物质材料,一直是材料学家、物理化学家们关心的热点,目前有很多实验和专利产品.其机理和模型的研究处于初期阶段,本文综述该领域的部分进展,包括形变、微结构和宏观性质等的数学模型和相关计算方法,一并列出一些亟待解决的问题.     

Control-oriented modeling of servo-pump driven injection molding machines in the filling and packing phase

Servo-valves or variable displacement pumps are typically used to control conventional hydraulic injection molding machines (IMMs). Recent developments in electrical drive technology allow to utilize servo-motor driven pumps instead, which is beneficial due to their higher energy efficiency. Their dynamic behavior, however, is significantly different compared to the conventional setup. Thus, currently used mathematical models and control concepts cannot be directly applied. This paper presents a computationally efficient and scalable mathematical model of the injection process for these servo-pump driven IMMs. A first-principles model of the injection machine is combined with a phenomenological model describing the injection process, i.e. the compression of the melt and the polymer flow into the mold. The proposed model is tailored to real-time applications and serves as an ideal basis for the design of model-based control strategies. The feasibility of the proposed model is demonstrated by a number of different experiments. They confirm a high model accuracy over the whole operating range for different mold geometries.     

Media pressures on Welsh language preservation

Despite compulsory school instruction in the Welsh language and strong cultural incentives to acquire the language, the most recent UK Census showed a downward trend in the number of speakers. The asymmetry in explicit language acquisition incentives is here considered to be offset by the media dominance of the English language. This dominance is modeled by the introduction of time-dependent connectivity and infectivity among English speakers into an adapted epidemiological model. Extrapolations up to 2050 are made, this being the announced date of a Welsh Assembly language-planning target of one million Welsh speakers.     

Depth and Stanley depth of the edge ideals of square paths and square cycles

In this paper, we compute depth and Stanley depth for the quotient ring of the edge ideal associated to a square path on n vertices. We also compute depth and Stanley depth for the quotient ring of the edge ideal associated to a square cycle on n vertices, when n≡0,3,4( mod 5), and give tight bounds when n≡1,2( mod 5). We also prove a conjecture of Herzog presented in [5 Herzog, J. (2013). A survey on Stanley depth. In: Bigatti, M. A., Gimenez, P., Sáenz-de-Cabezón, E., eds. Monomial Ideals, Computations and Applications. Lecture Notes in Mathematics, Vol. 2083. Heidelberg: Springer, pp. 3–45. https://arxiv.org/pdf/1702.00781.pdf.[Crossref] , [Google Scholar]], for the edge ideals of square paths and square cycles.     

Preservice mathematics teachers' conceptions and enactments of modeling standards

Mathematical modeling has been highlighted recently as Common Core State Standards for Mathematics (CCSSM) included Model with Mathematics as one of the Standards for Mathematical Practices (SMP) and a modeling strand in the high school standards. This common aspect of standards across most states in the United States intended by CCSSM authors and policy makers seems to mitigate the diverse notions of mathematical modeling. When we observed secondary mathematics preservice teachers (M‐PSTs) who learned about the SMP and used CCSSM modeling standards to plan and enact lessons, however, we noted differences in their interpretations and enactments of the standards, despite their attendance in the same course sections during a teacher preparation program. This result led us to investigate the ways the M‐PSTs understood modeling standards, which could provide insights into better preparing teachers to teach mathematical modeling. We present the contrasting ways in which M‐PSTs presented modeling related to their conceptions of mathematical modeling, choices of problems, and enactments over an academic year, connecting their practices to extant research. We consider this teaching and research experience as an opportunity to make significant changes in our instruction that may result in our students enhanced implementation of mathematical modeling.     

考虑路径风险的需求不确定应急物流定位-路径问题

针对自然灾害对路网造成的破坏性和受灾点物资需求量的不确定性,综合考虑应急物流路径风险和物资分配的时间公平性,将路径风险定量化为路径通行能力风险、路径损毁风险和路径复杂性,基于鲁棒优化理论,以最小化车辆最长配送时间和应急物流系统总成本为目标,建立了双目标多物资定位-路径优化模型,采用遗传算法对其求解,以汶川地震应急救援相关数据为例进行了数据仿真实验。实验结果的对比分析表明:在考虑路径风险下,随着控制系数的增加,系统总成本和最长配送时间目标值均呈现增大的趋势;受灾点的物资需求扰动越大,构建应急物流系统的总成本越高。算例结果也验证了鲁棒优化方法在处理不确定需求方面的有效性,为解决自然灾害后应急设施点的开设和救援物资的安全及时准确配送提供了有效的方法。     

联图$K_5+P_n$的交叉数

A join graph denoted by G + H,is illustrated by connecting each vertex of graph G to each vertex of graph H.In this paper,we prove the crossing number of join product of K_5 + P_n is Z(5,n) + 2 n + [n/2] + 4 for n ≥ 2.     

声焦散线及其与应力强度因子的关系

根据焦散线的形成原理,以及含I型裂纹试件受力前后光程差与声程差表达式的相似性,提出了声焦散线的概念,得到了声焦散线沿横向最大尺寸与应力强度因子的关系,为通过声焦散线法确定应力强度因子打下了基础.     

Leaf‐Critical and Leaf‐Stable Graphs

The minimum leaf number ml(G) of a connected graph G is defined as the minimum number of leaves of the spanning trees of G if G is not hamiltonian and 1 if G is hamiltonian. We study nonhamiltonian graphs with the property for each or for each . These graphs will be called ‐leaf‐critical and l‐leaf‐stable, respectively. It is far from obvious whether such graphs exist; for example, the existence of 3‐leaf‐critical graphs (that turn out to be the so‐called hypotraceable graphs) was an open problem until 1975. We show that l‐leaf‐stable and l‐leaf‐critical graphs exist for every integer , moreover for n sufficiently large, planar l‐leaf‐stable and l‐leaf‐critical graphs exist on n vertices. We also characterize 2‐fragments of leaf‐critical graphs generalizing a lemma of Thomassen. As an application of some of the leaf‐critical graphs constructed, we settle an open problem of Gargano et al. concerning spanning spiders. We also explore connections with a family of graphs introduced by Grünbaum in correspondence with the problem of finding graphs without concurrent longest paths.