Organization, Transformation, and Propagation of Mathematical Knowledge in Ωmega

Mathematical assistance systems and proof assistance systems in general have traditionally been developed as large, monolithic systems which are often hard to maintain and extend. In this article we propose a component network architecture as a means to design and implement such systems. Under this view a mathematical assistance system is an integrated knowledge-based system composed as a network of individual, specialized components. These components manipulate and mutually exchange different kinds of mathematical knowledge encoded within different document formats. Consequently, several units of mathematical knowledge coexist throughout the system within these components and this knowledge changes non-monotonically over time. Our approach has resulted in a lean and maintainable system code and makes the system open for extensions. Moreover, it naturally decomposes the global and complex reasoning and truth maintenance task into local reasoning and truth maintenance tasks inside the system components. The interplay between neighboring components in the network is thereby realized by nonmonotonic updates over agreed interface representations encoding different kinds of mathematical knowledge. This work has been funded by the DFG Collaborative Research Center on Resource-Adaptive Cognitive Processes, SFB 378, and was supported by grants from Studienstiftung des Deutschen Volkes e.V .     

Analysis of Linear Triangular Elements for Convection-diffusion Problems by Streamline Diffusion Finite Element Methods

This paper is devoted to studying the superconvergence of streamline diffusion finite element methods for convection-diffusion problems.In [8],under the condition thatε≤h~2 the optimal finite element error estimate was obtained in L~2-norm.In the present paper,however,the same error estimate result is gained under the weaker condition thatε≤h.     

Micro-Local Analysis with Fourier Lebesgue Spaces. Part?I

Let ω,ω ₀ be appropriate weight functions and q∈[1,∞]. We introduce the wave-front set, WF_FL^q(w)(f)\mathrm{WF}_{\mathcal{F}L^{q}_{(\omega)}}(f) of f ? S￠f\in \mathcal{S}' with respect to weighted Fourier Lebesgue space FL^q_(w)\mathcal{F}L^{q}_{(\omega )}. We prove that usual mapping properties for pseudo-differential operators Op (a) with symbols a in S^(w₀)_r,0S^{(\omega _{0})}_{\rho ,0} hold for such wave-front sets. Especially we prove that

Mathematical model for crack arrest of a transversely cracked piezoelectromagnetic strip – Part I

A magnetic, electric and mechanical yield model is proposed for a cracked piezoelectromagnetic ceramic narrow strip. The strip is subjected to anti-plane mechanical and in-plane electric and magnetic loads, consequently the crack opens in self-similar fashion forming a magnetic, a saturation and a slide zone ahead each tip. These in turn are arrested by prescribing a magnetic, electric and mechanical load, respectively. Employing Fourier integral transform the problem reduces to the solution of three dual integral equations. The solution of dual integral equations is then expressed in terms of Fredholm integral equation of second kind. Expressions are derived for yield induction zone, slide-yield zone and saturation zone lengths, energy release rate. A case study is carried for BaTiO₃–CoFe₂O₄ and results are presented graphically. It is shown that proposed model is capable of crack opening arrest under small-scale-yielding.     

General purpose heuristics for integer programming—Part I

In spite of the many special purpose heuristics for specific classes of integer programming (IP) problems, there are few developments that focus on general purpose integer programming heuristics. This stems partly from the perception that general purpose methods are likely to be less effective than specialized procedures for specific problems, and partly from the perception that there is no unifying theoretical basis for creating general purpose heuristics. Still, there is a general acknowledgment that methods which are not limited to solving IP problems on a class by class basis, but which apply to a broader range of problems, have significant value. We show that certain ideas proposed in the 1970s, which are often overlooked, can be reformulated and linked with more recent developments to give a useful theoretical framework for generating general purpose IP heuristics. This framework, which has the appeal of being highly visual, makes use of cutting plane derivations that also give a natural basis for marrying heuristics with exact branch and cut methods for integer programming problems.     

Constrained Extremum Problems and Image Space Analysis–Part I: Optimality Conditions

Image space analysis is a new tool for studying scalar and vector constrained extremum problems as well as generalized systems. In the last decades, the introduction of image space analysis has shown that the image space associated with the given problem provides a natural environment for the Lagrange theory of multipliers and that separation arguments turn out to be a fundamental mathematical tool for explaining, developing and improving such a theory. This work, with its 3 parts, aims at contributing to describe the state-of-the-art of image space analysis for constrained optimization and to stress that it allows us to unify and generalize the several topics of optimization. In this 1st part, after a short introduction of such an analysis, necessary and sufficient optimality conditions are treated. Duality and penalization are the contents of the 2nd part. The 3rd part deals with generalized systems, in particular, variational inequalities and Ky Fan inequalities. Some further developments are discussed in all the parts.