求解隐式差分方程的加速迭代并行算法

1、引言 近年来,求解抛物型方程的有限差分并行迭代算法有了较大发展．针对稳定性好且难于并行化的隐式差分方程,文第一次提出了构造分段隐式的思想,建立了分段显-隐式（ASE-Ⅰ）方法和交替分段Crank-Nicolson（ASC-N）方法,实现了分而治之原则,     

分段函数的连续可导性

讨论了分段函数的连续可导性,得到了一个分段函数具有任意阶导数的充分条件,并介绍了一个求分段函数在其分段点处n阶导数的公式     

分段双加权伪概周期函数及其分解唯一性

介绍了分段双加权伪概周期函数的概念.分段双加权伪概周期函数可以看做是分段加权伪概周期函数的推广也可以认为是双加权伪概周期函数的推广.首先给出分段双加权伪概周期函数的概念,然后介绍几个分段双加权伪概周期函数的几个性质:分解唯一性,分段双加权遍历空间的平移不变性.     

高中数学分段函数浅析

所谓分段函数指的是自变量在不同的取值范围内,有不同的表达式．分段函数由于是分段定义的,与一般函数有着明显的区别,学生往往受负迁移的影响,且在教材中是以例题形式出现的,并未作深入说明,同学们容易对此认识不清或思维片面产生解题错误．本文就分段函数作一肤浅的探讨,有关问题整理、归纳如下：     

关于“分段点”可导性判定的一个定理

如何判断分段函数在分段点处可导性,并求出导数?通常的作法(1)先判断连续性,若不连续,必不可导.(2)如果连续,再按导数的定义求导,由于在分段点两侧,函数表达式可能不同,则一般要通过计算分段点处左右导数来判断.实际上,在函数连续的基础上,可借助导函数在分段点处的极限,来判定并求出分段点的导数.这是因为有如下的定理:     

分段函数的分类及分离型分段函数与初等函数之间的关系

将分段函数划分为连结型分段函数 ,分离型分段函数和它们的组合形式三种类型 ,得到了分离型分段函数是初等函数的充分必要条件 ,完整地解决了分离型分段函数与初等函数之间的关系 ,并且给出了初等函数在其任一截取集上的限制函数 (截取函数 )仍然是初等函数的结果     

理解分段函数含义 领悟其研究方法

<正>分段函数在教材中是以例题的形式出现的,并未作深入说明.所谓"分段函数",习惯上指在定义域的不同部分,有不同的对应法则的函数.对它应有以下两点基本认识:(1)分段函数是一个函数,不要把它误认为是几个函数;(2)分段函数的定义域是各段定义域的并集,值域是各段值域的并集.下文谈谈领悟研究分段函数的方法.1.求分段函数的函数值求分段函数的函数值时,首先应确定自变     

例说分段函数的性质

高中数学教材中虽然给出了分段函数的定义,但对此类函数的性质未作深入系统地介绍,而在高考试题中却频繁地出现,因此,关注分段函数的性质及其应用很有必要.以下举例说明.     

分段Koszul代数, II

本文继续研究了分段Koszul 代数. 具体地, 给出了一些分段Koszul 代数的判定准则; 作为构造更多分段Koszul 代数例子的尝试, 讨论了分段Koszul 代数的“单点扩张” 和“H-Galois 分次扩张”, 其中H 是有限维的半单余半单Hopf 代数.     

船体不规则分段的动态空间调度算法

提出了一种基于遗传算法的针对船体不规则分段的动态空间调度方法。基于遗传算法和临界多边形算法直接对不规则分段进行优化调度，提高空间的利用率。首先，利用遗传算法产生多个可行的分段调度序列。然后，基于临界多边形算法及重心最低策略，根据分段调度序列一一确定各不规则分段的空间位置。充分考虑到空间调度问题所特有的动态性和时空关联性，同时以场地利用率和未延迟加工分段所占比例的综合加权和作为评价函数，实现了调度方案的全局优化。以江苏澄西船厂大型散货船的119个不规则分段作为实验数据，并通过多个算法的比较，发现该动态调度算法可以快速收敛得到较优解，并且在空间利用率和延迟分段指标上有了提高，最终可以得到比较理想的调度结果，证明了所提方法在动态空间调度问题上的有效性和优越性。     

Rawlsian altruism with perfect discrimination leads to social efficiency

Recent studies draw attention on the highly specialized capacity of human beings in recognizing altruists versus cheaters in social interactions. These results hint at the existence of specialized abilities that support discriminating behavior in strategic interactions. In this paper, we explore the implications of discriminating behavior in the study of the indirect evolutionary selection of selfish versus altruistic motivations in the context of generic 2×2 base games, and in particular for coordination and cooperation scenarios. We find that inequality averse (Rawlsian) altruism can enforce under rather general conditions socially optimal outcomes, including cases where selfishness cannot, such as in prisoner’s dilemmas. Inequality seeking (Nietzschian) altruism in no case improves upon Rawlsian altruism in terms of social optimality of outcomes, and often does worse. In the cooperation scenario in particular, Nietzschean altruism never manages to implement the cooperative outcome. Under perfect discrimination, moreover, inequality averse (Rawlsian) altruism often evolves at the expense of selfishness. These results suggest that the development of sophisticated discrimination abilities may be strongly adaptive in supporting fairness-oriented forms of pro-sociality in humans in the context of social dilemmas and coordination problems.     

Scan Statistics on Enron Graphs

We introduce a theory of scan statistics on graphs and apply the ideas to the problem of anomaly detection in a time series of Enron email graphs. Previous presentation: Workshop on Link Analysis, Counterterrorism and Security at the SIAM International Conference on Data Mining, Newport Beach, CA, April 23, 2005. Carey E. Priebe received the B.S. degree in mathematics from Purdue University in 1984, the M.S. degree in computer science from San Diego State University in 1988, and the Ph.D. degree in information technology (computational statistics) from George Mason University in 1993. From 1985 to 1994 he worked as a mathematician and scientist in the US Navy research and development laboratory system. Since 1994 he has been a professor in the Department of Applied Mathematics and Statistics, Whiting School of Engineering, Johns Hopkins University, Baltimore, Maryland. At Johns Hopkins, he holds joint appointments in the Department of Computer Science and the Center for Imaging Science. He is a past President of the Interface Foundation of North America—Computing Science & Statistics, a past Chair of the Section on Statistical Computing of the American Statistical Association, and on the editorial boards of Journal of Computational and Graphical Statistics, Computational Statistics and Data Analysis, and Computational Statistics. His research interests are in computational statistics, kernel and mixture estimates, statistical pattern recognition, statistical image analysis, and statistical inference for high-dimensional and graph data. He was elected Fellow of the American Statistical Association in 2002. John M. Conroy received a B.S. in Mathematics from Saint Joseph's University in 1980 and a Ph.D. in Applied Mathematics from the University of Maryland in 1986. Since then he has been a research staff member for the IDA Center for Computing Sciences in Bowie, MD. His research interest is applications of numerical linear algebra. He is a member of the Society for Industrial and Applied Mathematics, Institute of Electrical and Electronics Engineers (IEEE), and the Association for Computational Linguistics. David J. Marchette received a B.A. in 1980, and an M.A. in mathematics in 1982, from the University of California at San Diego. He received a Ph.D. in Computational Sciences and Informatics in 1996 from George Mason University under the direction of Ed Wegman. From 1985–1994 he worked at the Naval Ocean Systems Center in San Diego doing research on pattern recognition and computational statistics. In 1994 he moved to the Naval Surface Warfare Center in Dahlgren Virginia where he does research in computational statistics and pattern recognition, primarily applied to image processing, text processing, automatic target recognition and computer security. Dr. Marchette is a Fellow of the American Statistical Society. Youngser Park received the B.E. degree in electrical engineering from Inha University in Korea in 1985, the M.S. degree in computer science from The George Washington University in 1991, and had pursued a doctoral degree there. From 1998 to 2000 he worked at the Johns Hopkins Medical Institutes as a senior research engineer. Since 2003 he is working as a research analyst in the Center for Imaging Science at the Johns Hopkins University. His research interests are clustering algorithm, pattern classification, and data mining.     

等参函数及相关问题研究

著名的Yau 猜想断言单位球面中的紧致嵌入极小超曲面的Laplace 算子的第一特征值等于其维数. 近年来有许多几何学家致力于对Yau 猜想的研究, 但是到目前为止, 已有的结论只是一些关于第一特征值估计的不等式. 作为本文的一个主要结果, 本文证明了对于单位球面中的等参极小超曲面,Yau 猜想是正确的. 进一步地, 对于等参超曲面的焦流形(实际上是球面的极小子流形), 本文还证明了在一定维数条件下, 它的第一特征值也是其维数.
作为本文的第二个主要结果, 以著名的Schoen-Yau-Gromov-Lawson 的关于数量曲率的手术理论为出发点, 本文在一个Riemann 流形的嵌入超曲面处作手术, 构造了一个新的具有丰富几何性质的流形, 称为double 流形. 特别地, 本文在单位球面的极小等参超曲面处实行了这一手术, 发现得到的double 流形不仅有很复杂的拓扑(但其示性类有精确描述), 还存在数量曲率为正的度量, 更重要的是保持了等参叶状结构.
比Willmore 曲面更广泛的定义是Willmore 子流形, 即Willmore 泛函在球面中的的极值子流形.单位球面中的Willmore 子流形的例子在已有文献中是非常罕见的. 作为本文的另外两个主要结果, 通过深入挖掘单位球面上的OT-FKM- 型等参函数的焦流形的性质, 本文发现其极大值对应的焦流形是单位球面的一系列Willmore 子流形; 之后, 本文用几何办法统一证明了单位球面中具有4 个不同主曲率的等参超曲面的焦流形都是单位球面的Willmore 子流形. 这些新的Willmore 子流形是极小的,但一般不是Einstein 的.     

超网络中心性度量的υ-Position值方法

利用合作博弈理论的分配规则如Shapley值、Banzhaf值等来度量政治、经济和社会网络中节点的中心性或者重要性是识别网络中关键节点的一类重要方法。考虑到在超网络中代表各类组织的超边在网络中发挥的作用不同,本文研究了超网络博弈上一类广义Position值的分配规则,被称为υ-position值。它可以作为网络中度值测度的一类推广,以此来度量网络中参与者的中心性和相对重要性。其次,证明了超网络结构上类Shapley-position值可由分支超边指数和局部平衡超边贡献两个性质所唯一刻画。最后, 举例分析了υ-position值在超网络中心性测度中的应用。     

产能约束对闭环供应链回收渠道选择的影响

在制造商存在产能约束下,建立了再制造闭环供应链回收渠道决策的Stackelberg博弈模型,得出了三种回收渠道下的回收率、零售价以及制造商、零售商和供应链的利润,分析了制造商的生产能力对回收渠道决策的影响。研究表明:存在产能约束时,制造商回收渠道中的回收率总是最高的,这与无产能约束时零售商回收渠道中回收率最高的情况明显不同;同时,若废旧产品回收转移支付价格较低,制造商会选择自己回收,此时的零售价最低,制造商、零售商和供应链利润最高;若回收转移支付价格较高,制造商会选择零售商回收,此时的零售价最低,制造商和供应链利润最高。     

An infeasible method of large-system optimization by direct coordination of subsystem inputs

An infeasible method of large-system optimization is proposed. The dual gap is resolved by use of the generalized Lagrangian as in the previous methods due to Stephanopouloset al. and Watanabeet al. The values of subsystem inputs are, however, coordinated in the second level, instead of being adjusted in the first level, as in previous methods. As a result, in contrast with previous methods, the subproblems in the first level include a small number of variables to be adjusted; in addition, the generalized Lagrangian is decomposable in a simple manner. Further, the decomposition is not subject to any restriction, which is often encountered in feasible methods.The authors would like to acknowledge the valuable comments given by Professor D. G. Luenberger of Stanford University, Stanford, California.     

基于平行DEA模型的我国小学教育资源配置效率分析

小学教育是教育阶段的基础,也是我国强制教育的一部分。但如何在各省份性别比例相差较大的情况下,更加有效的提高各省份小学教育资源配置效率是一个值得思考的问题。为了避免性别带来的影响,可以通过平行结构DEA模型根据学生性别分为两个平行子系统,来衡量我国2012~2018年各省份小学教育的资源配置情况。研究发现大部分省份小学教育资源配置的总系统效率未达到有效边界,仍有需要改进的地方。男学生在小学教育阶段的效率通常优于女学生在小学教育阶段的效率,但随着近些年我国教育体制的日益完善,女学生在小学教育阶段的效率呈上升趋势。此外,我国西部地区的小学教育资源配置效率在一些年份普遍优于东部和中部地区,而中部地区和东部地区小学教育总系统效率相对稳定,西部地区小学教育总系统效率波动较大。     

An overview on the history of actuarial calculus in Portugal until the late 19th century

Pension funds, namely survivors' pension funds were established in Portugal in the late 18th century, in mutual benefit societies. The first Portuguese life assurance companies were created in the first half of the 19th century but their activity was not very extensive. Only in the 20th century did both institutions become actuarially-based. In this paper, we provide an overview of the development of actuarial calculus in Portugal until the late 19th century, in order to contextualise the scientific progress of those institutions, mainly the former. This paper lays the groundwork for further research on the history of actuarial calculus in Portugal.     

Mapping deontic operators to abductive expectations

Deontic concepts and operators have been widely used in several fields where representation of norms is needed, including legal reasoning and normative multi-agent systems. The EU-funded SOCS project has provided a language to specify the agent interaction in open multi-agent systems. The language is equipped with a declarative semantics based on abductive logic programming, and an operational semantics consisting of a (sound and complete) abductive proof procedure. In the SOCS framework, the specification is used directly as a program for the verification procedure. In this paper, we propose a mapping of the usual deontic operators (obligations, prohibition, permission) to language entities, called expectations, available in the SOCS social framework. Although expectations and deontic operators can be quite different from a philosophical viewpoint, we support our mapping by showing a similarity between the abductive semantics for expectations and the Kripke semantics that can be given to deontic operators. The main purpose of this work is to make the computational machinery from the SOCS social framework available for the specification and verification of systems by means of deontic operators. Marco Alberti received his laurea degree in Electronic Engineering in 2001 and his Ph.D. in Information Engineering in 2005 from the University of Ferrara, Italy. His research interests include constraint logic programming and abductive logic programming, applied in particular to the specification and verification of multi-agent systems. He has been involved as a research assistants in national and European research projects. He currently has a post-doc position in the Department of Engineering at the University of Ferrara. Marco Gavanelli is currently assistant professor in the Department of Engineering at the University of Ferrara, Italy. He graduated in Computer Science Engineering in 1998 at the University of Bologna, Italy. He got his Ph.D. in 2002 at Ferrara University. His research interest include Artificial Intelligence, Constraint Logic Programming, Multi-criteria Optimisation, Abductive Logic Programming, Multi-Agent Systems. He is a member of ALP (the Association for Logic Programming) and AI*IA (the Italian Association for Artificial Intelligence). He has organised workshops, and is author of more than 30 publications between journals and conference proceedings. Evelina Lamma received her degree in Electronic Engineering from University of Bologna, Italy, in 1985 and her Ph.D. degree in Computer Science in 1990. Currently she is Full Professor at the Faculty of Engineering of the University of Ferrara where she teaches Artificial Intelligence and Foundations of Computer Science. Her research activity focuses around: – programming languages (logic languages, modular and object-oriented programming); – artificial intelligence; – knowledge representation; – intelligent agents and multi-agent systems; – machine learning. Her research has covered implementation, application and theoretical aspects. She took part to several national and international research projects. She was responsible of the research group at the Dipartimento di Ingegneria of the University of Ferrara in the UE ITS-2001-32530 Project (named SOCS), in the the context of the UE V Framework Programme - Global Computing Action. Paola Mello received her degree in Electronic Engineering from the University of Bologna, Italy, in 1982, and her Ph.D. degree in Computer Science in 1989. Since 1994 she has been Full Professor. She is enrolled, at present, at the Faculty of Engineering of the University of Bologna (Italy), where she teaches Artificial Intelligence. Her research activity focuses on programming languages, with particular reference to logic languages and their extensions, artificial intelligence, knowledge representation, expert systems with particular emphasis on medical applications, and multi-agent systems. Her research has covered implementation, application and theoretical aspects and is presented in several national and international publications. She took part to several national and international research projects in the context of computational logic. Giovanni Sartor is Marie-Curie professor of Legal informatics and Legal Theory at the European University Institute of Florence and professor of Computer and Law at the University of Bologna (on leave), after obtaining a PhD at the European University Institute (Florence), working at the Court of Justice of the European Union (Luxembourg), being a researcher at the Italian National Council of Research (ITTIG, Florence), and holding the chair in Jurisprudence at Queen’s University of Belfast (where he now is honorary professor). He is co-editor of the Artificial Intelligence and Law Journal and has published widely in legal philosophy, computational logic, legislation technique, and computer law. Paolo Torroni is Assistant Professor in computing at the Faculty of Engineering of the University of Bologna, Italy. He obtained a PhD in Computer Science and Electronic Engineering in 2002, with a dissertation on logic-based agent reasoning and interaction. His research interests mainly focus on computational logic and multi-agent systems research, including logic programming, abductive and hypothetical reasoning, agent interaction, dialogue, negotiation, and argumentation. He is in the steering committee of the CLIMA and DALT international workshops and of the Italian logic programming interest group GULP.     

Conceptualizations of slope in Mexican intended curriculum

Slope is a fundamental mathematics concept in middle and high school that transcends to the university level. An understanding of slope is needed at the university level since slope plays an important role in understanding problems involving variation and change. In this study Mexican curricula documents were examined to determine which conceptualizations of slope are addressed in the intended mathematics curriculum. To explain the results, we use conceptualizations of slope identified in previous research. Our findings reveal that, to a certain extent, the conceptualizations proposed in the Mexican intended mathematics curriculum differ slightly in terms of the emphasis and timing of instruction from what others have identified in the U.S., with slope as a geometric ratio receiving less emphasis in the Mexican curriculum. There was also noted discontinuity within the Mexican curriculum in introducing slope in grade 9 and subsequently introducing of linear functions in grade 10 without explicit mention of slope. Suggestions are made for future studies, both to consider the conceptualizations of slope promoted in the Mexican textbooks and the impact they have in classroom instruction and student learning of slope.