Search

In this note we want to show that the PCR6 fusion rule works and redistributes the conflicting mass properly, contrarily to the authors' assertion that "he focal element {v3} absorbs almost all of the conflicting mass (the majority)."We also question the validity of the new CREC rule of combination presented by the authors. [ABSTRACT FROM AUTHOR]

Abstract: This special issue contains the revised and extended versions of three papers presented in the 4th Workshop on Advances in Model-Based Testing (A-MOST 2008). In addition to an executive summary of these three papers, this preface briefly reviews the papers published in the four editions of the A-MOST workshop. We hope that the reader will find this special issue interesting and informative. [Copyright &y& Elsevier]

A preface for the special issue of "Journal of Global Optimization" featuring papers selected from the 8th International Conference on Optimization: Techniques and Applications held in Shanghai, China is presented.

These remarks are based on a talk the writer gave at the 11th International Conference in Fixed Point Theory and Applications, held at Galatasaray University in Istanbul, Turkey, July 20-24, 2015. They represent selected thoughts on a career in research, largely devoted to metric fixed point theory, that has spanned over 50 years. [ABSTRACT FROM AUTHOR]

Abstract: We investigate the problem of the maximum number of different cubic subwords (of the form ) in a given word. We also consider square subwords (of the form ). The problem of the maximum number of squares in a word is not well understood. Several new results related to this problem are presented in the paper. We consider two simple problems related to the maximum number of subwords which are squares or which are highly repetitive; then we provide a nontrivial estimation for the number of cubes. We show that the maximum number of squares such that is not a primitive word (nonprimitive squares) in a word of length is exactly , and the maximum number of subwords of the form , for , is exactly . In particular, the maximum number of cubes in a word is not greater than either. Using properties of occurrences of cubes, we improve this bound significantly. We show that the maximum number of cubes in a word of length is between and . 2 [2] In particular, we improve the lower bound from the conference version of the paper by Kubica et al. (2009) [18]. [Copyright &y& Elsevier]

Abstract: In this paper, under weaker hypothesis, the global existence of oscillatory solutions is established for a forced second order nonlinear delay differential equation. The results of this paper generalize and improve some known results. [Copyright &y& Elsevier]

The article presents information related to the 43rd International Conference on Decision and Control (CDC). The 43rd CDC was held in December 14-17, 2004 at the Atlantis Hotel, Nassau and sponsored by the Society for Industrial and Applied Mathematics, Japanese Society of Instrument and Control Engineers, and European Control Association. The program included 936 sectional reports carefully chosen from a total 1879 submitted reports. The Conference was held in honor of the 50th Control Systems Society Anniversary to trace the development of the Society and Conferences on Decision and Control, as well as to review the state-of-the-art in control as a whole.

Discussions under this title were held during a round table in frames of the International Conference "Fractional Differentiation and Its Applications" (ICFDA'18) held in 16-18 July 2018, Amman, The Hashemite Kingdom of Jordan, see details at http://conferences.ju.edu.jo/en/icfda2018/Home.aspx. The intention of this round table was to continue the useful traditions from the first conferences on the Fractional Calculus topics, to pose open problems, challenging hypotheses and questions "where to go", to discuss them and try to find ways to resolve. [ABSTRACT FROM AUTHOR]

Abstract: This paper is essentially the talk that I delivered in the minisymposium in honor of Miroslav Fiedler at the 17th ILAS meeting in Braunschweig, Germany. [Copyright &y& Elsevier]

Abstract: This introductory paper describes the main topics of this special issue, dedicated to Leonardo Traversoni, known at the international level as the promoter of the conference series “Multivariate Approximation: Theory and Applications”, to celebrate his 60th birthday. [Copyright &y& Elsevier]

Abstract: In this paper, we further investigate the consistency problem for the qualitative temporal calculus introduced by Pujari et al. [A.K. Pujari, G.V. Kumari, A. Sattar, INDU: An interval and duration network, in: Australian Joint Conference on Artificial Intelligence, 1999, pp. 291–303]. We prove the intractability of the consistency problem for the subset of pre-convex relations, and the tractability of strongly pre-convex relations. Furthermore, we also define another interesting set of relations for which the consistency problem can be decided by the , a method similar to the usual path-consistency method. Finally, we prove that the is also complete for the set of atomic relations of implying that the intervals have the same duration. [Copyright &y& Elsevier]

A preface to the journal "Mathematical Modelling and Analysis 2009" is presented.

Information about several topics discussed at the 5th Asian Mathematical Conference held June 22-26, 2009 at the Putra World Trade Center in Kuala Lumpur, Malaysia is presented. Topics include the developments in difference sets applied to signal sequences, the bounded convergence theorem for Choquet integral, and the use of adaptive finite element method in the Laplace-Beltrami operator. The event featured several mathematicians including Siu Lun Ma, Jun Kawabe, and Khamron Mekchay.

The article presents the author's view on the importance of mathematical analysis in evidential interference. An overview of the New Evidence Scholarship (NES), the shift in legal scholarship in the English-speaking world is provided. The author cites the conference on graphic and visual representations of evidence and interference in legal settings held at Cardozo School of Law in New York City on January 28-29, 2007 to further explain the relationship between visualization and graphs.