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]

Albert Einstein encapsulated a commonly held view within the scientific community when he wrote in his book Out of My Later Years (Einstein 1950, page 54) ‘When we say that we understand a group of natural phenomena, we mean that we have found a constructive theory which embraces them.’ This represents a dual challenge to the scientist: on the one hand, to explain the real world in a very basic, and if possible, mathematical, way; but on the other, to characterise the extent to which this is even possible. Recent years have seen the mathematics of computability play an increasingly vital role in pushing forward basic science and in illuminating its limitations within a creative coming together of researchers from different disciplines. This special issue of Mathematical Structures in Computer Science is based on the special session ‘Computability of the Physical’ at the International Conference Computability in Europe 2010, held at Ponta Delgada, Portugal, in June 2010, and it, together with the individual papers it contains, forms what we believe to be a special contribution to this exciting and developing process. [ABSTRACT FROM AUTHOR]

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.

This special issue of the Journal Mathematical Methods in the Applied Sciences on the topic of Modelling, Analysis, and Applications is devoted to the development of mathematical modelling, analysis, and applications, from theoretical and numerical perspectives, involving different applied sciences and engineering. It collects invited contributions, from selected quality full papers submitted to the International Conference on Mathematical Analysis and Applications in Science and Engineering (ICMA2SC2022). The conference took place in Porto, Portugal in 27–29 June 2022 (https://www.isep.ipp.pt/Page/ViewPage/ICMASC). [ABSTRACT FROM AUTHOR]

No abstract received. [ABSTRACT FROM AUTHOR]

This special issue of Mathematical Structures in Computer Science contains a selection of papers presented at three satellite events of CONCUR'09, which was held between 31 August and 5 September 2009 in Bologna (Italy). Specifically, it contains three papers from the 16th International Workshop on Expressiveness in Concurrency (EXPRESS'09), one paper from the 2nd Interaction and Concurrency Experience (ICE'09) and two papers from the 6th Workshop on Structural Operational Semantics (SOS'09). [ABSTRACT FROM PUBLISHER]

The article reports on the International Workshop in Sequential Methodologies, held at Auburn University in Alabama from July 22 to 25, 2007. Some of the topics discussed included sequential selection of a quality group and monitoring the mean and variability of multivariate processes. The third Abraham Wald Prize in Sequential Analysis was awarded to Michael Baron during the workshop.

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]

This Special Issue is dedicated to explicate and discuss methodological issues in the interdisciplinary research field of mathematical and computational approaches to music. It arose from a lively panel discussion at the third International Conference on Mathematics and Computation in Music 2011 in Paris. We have organized this panel in order to initiate the much needed interdisciplinary dialogue on the How, Why, and What of our modelling of and theorizing about music in the wide field of science, humanities and cognitive approaches to music research. From the contributions of the three panelists to this Special Issue, we extract key topics that the interdisciplinary scientific community needs to address in order to enable the different disciplines to productively complement one another in achieving a comprehensive approach to music as a complex, yet fundamental human trait. [ABSTRACT FROM PUBLISHER]

The article offers information on the special issue of Distributed Computing. The issue is based on papers which originally appeared in preliminary and abbreviated form in the Proceedings of the 19th International Symposium on Distributed Computing (DISC) that was held in Poland on September 26-29, 2005. Based on the quality and representation of the range of topics addressed in the Symposium, the papers were chosen by the Program Committee from the extended abstracts.

Variable selection in the presence of outliers may be performed by using a robust version of Akaike's information criterion (AIC). In this paper, explicit expressions are obtained for such criteria when S- and MM-estimators are used. The performance of these criteria is compared with the existing AIC based on M-estimators and with the classical non-robust AIC. In a simulation study and in data examples, we observe that the proposed AIC with S and MM-estimators selects more appropriate models in case outliers are present. [ABSTRACT FROM PUBLISHER]

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]

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]

Fischer and Rabin proved in (Proceedings of the SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27–41, ) that the decision problem for Presburger Arithmetic has at least double exponential worst-case complexity (for deterministic and for nondeterministic Turing machines). In Kapovich et al. (J. Algebra 264(2):665–694, ) a theory of generic-case complexity was developed, where algorithmic problems are studied on “most” inputs instead of set of all inputs. A question rises about existing of more efficient (say, polynomial) generic algorithm deciding Presburger Arithmetic on a set of closed formulas of asymptotic density 1. We prove in this paper that there is not an exponential generic decision algorithm working correctly on an input set of asymptotic density exponentially converging to 1 (so-called strongly generic sets). [ABSTRACT FROM AUTHOR]

We consider text retrieval applications that assign query-specific relevance scores to documents drawn from particular collections. Such applications represent a primary focus of the annual Text Retrieval Conference (TREC), where the participants compare the empirical performance of different approaches. P(K), the proportion of the top K documents that are relevant, is a popular measure of retrieval effectiveness. Participants in the TREC Very Large Corpus track have observed that when the target is a random sample from a collection, P(K) is substantially smaller than when the target is the entire collection. Hawking and Robertson (2003) confirmed this finding in a number of experimental settings. Hawking et al. (1999) posed as an open research question the cause of this phenomenon and proposed five possible explanatory hypotheses. In this paper, we present a mathematical analysis that sheds some light on these hypotheses and complements the experimental work of Hawking and Robertson (2003). We will also introduce C(L), contamination at L, the number of irrelevant documents amongst the top L relevant documents, and describe its properties. Our analysis shows that while P(K) typically will increase with collection size, the phenomenon is not universal. That is, the asymptotic behavior of P(K) and C(L) depends on the score distributions and relative proportions of relevant and irrelevant documents in the collection. [ABSTRACT FROM AUTHOR]

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.

Information about a meeting that was held in Mahdia, Tunisia on February 25-March 1, 2017, hosted by the organization Tunisian Mathematical Society (TMS). Topics include mathematical research, study and teaching of mathematics and promotion of mathematics. The meeting featured TMS president Ali Baklouti.

The article announces on the 7th International conference on numerical methods for thermal problems. The Organizing Committee will welcome the submission of papers describing recent work within the general area. It is expected that most submitted papers will report on recently developed computational techniques, in particular finite difference and finite element methods. However, papers dealing with the comparison of standard numerical models with experimental data are also welcome. Abstracts of approximately 500 words proposing papers in the above or related fields of study are invited immediately or at the latest by 20 December 1990.

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: We are presenting in this volume selected, peer-reviewed, short papers that were presented at the EURO Mini Conference XXVIII on Variable Neighborhood Search (MEC XXVIII - VNS) which was held during October 4–7, 2012, in Herceg Novi, Montenegro. [Copyright &y& Elsevier]

Abstract: In this paper, we improve the existing bounds [Calamoneri, T. and B. Sinaimeri, -Labeling of Oriented Planar Graphs (Extended Abstract), in: Proc. 12th Italian Conference on Theoretical Computer Science, (2010)] for 2-dipath and oriented span for the class of planar graphs with girth 5, 11, 16, cactus, wheels and leaf independent Halin graphs. Some of these bounds are tight. [Copyright &y& Elsevier]

Hans Duistermaat was scheduled to lecture in the 2010 School on Poisson Geometry at IMPA, but passed away suddenly. This is a record of a talk I gave at the 2010 Conference on Poisson Geometry (the week after the School) to share some of my memories of him and to give a brief assessment of his impact on the subject. [ABSTRACT FROM AUTHOR]

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]

Editorial. Comments on a Czech-U.S. workshop on iterative methods and parallel computing held in 1997. Organizers and sponsors; Research in the field; Presentations and demonstrations.

The article presents information on several developments in the field of Mathematics in 1998. It refers to the simple sounding conjecture about sphere-packing by mathematician, Johannes Kepler. It is an explanation for the small world phenomenon and a mathematical theory for origami, a Japanese art for paper folding. It is a new approach to paradoxes in mathematical game theory that solves the mathematical problem in origami. Another development that occurred in the field of Mathematics is the quadrennial International Congress of Mathematicians that was held in Berlin, Germany. The congress awarded prizes to distinguished young mathematicians. The article also analyzes the game theory for "Chicken" game. It reflects that the game presents difficulties for game theorists and highlights that in such games the best method to follow is the strategy of acting irrationally.

Explains that this special issue of "Numerical Linear Algebra with Applications" is devoted to the 2002 International Conference on "Preconditioning Methods for Optimal Control and Constrained Optimization Problems" held on October 23-25, 2002 in Netherlands. Goal of addressing complex issues related to preconditioning methods for constrained optimization and optimal control.

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