Search

Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can be conveniently expressed in terms of (normal) factor graphs. As an application, we give an alternative proof of a classical duality result of Kramers and Wannier, which expresses the partition function of the 2-D Ising model at a low temperature in terms of the partition function of the 2-D Ising model at a high temperature. Moreover, we discuss analogous results for the 3-D Ising model and the Potts model. [ABSTRACT FROM AUTHOR]

In this paper, we study the Onsager-Machlup function and its relationship to the Freidlin-Wentzell function for measures equivalent to arbitrary infinite dimensional Gaussian measures. The Onsager-Machlup function can serve as a density on infinite dimensional spaces, where a uniform measure does not exist, and has been seen as the Lagrangian for the "most likely element". The Freidlin-Wentzell rate function is the large deviations rate function for small-noise limits and has also been identified as a Lagrangian for the "most likely element". This leads to a conundrum - what is the relationship between these two functions? We show both pointwise and G-convergence (which is essentially the convergence of minimizers) of the Onsager-Machlup function under the small-noise limit to the Freidlin-Wentzell function - and give an expression for both. That is, we show that the small-noise limit of the most likely element is the most likely element in the small noise limit for infinite dimensional measures that are equivalent to a Gaussian. Examples of measures include the law of solutions to path-dependent stochastic differential equations and the law of an infinite system of random algebraic equations. [ABSTRACT FROM AUTHOR]

Creativity is a complex, multi-faceted concept encompassing a variety of related aspects, abilities, properties and behaviours. If we wish to study creativity scientifically, then a tractable and well-articulated model of creativity is required. Such a model would be of great value to researchers investigating the nature of creativity and in particular, those concerned with the evaluation of creative practice. This paper describes a unique approach to developing a suitable model of how creative behaviour emerges that is based on the words people use to describe the concept. Using techniques from the field of statistical natural language processing, we identify a collection of fourteen key components of creativity through an analysis of a corpus of academic papers on the topic. Words are identified which appear significantly often in connection with discussions of the concept. Using a measure of lexical similarity to help cluster these words, a number of distinct themes emerge, which collectively contribute to a comprehensive and multi-perspective model of creativity. The components provide an ontology of creativity: a set of building blocks which can be used to model creative practice in a variety of domains. The components have been employed in two case studies to evaluate the creativity of computational systems and have proven useful in articulating achievements of this work and directions for further research. [ABSTRACT FROM AUTHOR]

We give some remarks on the recent paper [J. Math. Inequal. 13 (4) (2019), 1235– 1244]. Some misleading conclusions of their stability results are carefully discussed and corrected. Moreover, we reestablish their results with a more general assumption and a stronger conclusion. [ABSTRACT FROM AUTHOR]

In this paper, we will investigate the effect of diffusion, which is ubiquitous in nature, on the immune system using a reaction-diffusion model in order to understand the dynamical behavior of complex patterns and control the dynamics of different patterns. Through control theory and linear stability analysis of local equilibrium, we obtain the optimal condition under which the system loses stability and a Turing pattern occurs. By combining mathematical analysis and numerical simulation, we show the possible patterns and how these patterns evolve. In addition, we establish a bridge between the complex patterns and the biological mechanism using the results from a previous study in Nature Cell Biology. The results in this paper can help us better understand the biological significance of the immune system. [ABSTRACT FROM AUTHOR]

The purpose of this paper is twofold. The first goal is to provide a simple and constructive proof of Korn inequalities in half-space with weighted norms. The proof leads to explicit values of the constants. The second objective is to use these inequalities to show that the linear elasticity system in half-space admits a coercive variational formulation. This formulation corresponds to the physical case in which the solution is evanescent at infinity. [ABSTRACT FROM AUTHOR]

In this paper, a new class of Hermite-Hadamard type integral inequalities using a strong type of convexity, known as n-polynomial exponential type s-convex function, is studied. This class is established by utilizing the Hölder's inequality, which has several applications in optimization theory. Some existing results of the literature are obtained from newly explored consequences. Finally, some novel limits for specific means of positive real numbers are shown as applications. [ABSTRACT FROM AUTHOR]

Mathematics is the most logical and unbiased scientific field there is. What is true in mathematics today will forever stay true, and mathematical arguments will always clearly indicate which side "wins". These are some of the characteristics of mathematics that I have liked very much since I was young. In this article, I will try to demonstrate the beauty of mathematics and show you that it appears in many situations in our daily lives--including places we might not expect. Then, I will give you a taste of two studies I conducted in a mathematical field called combinatorics, and I will explain how they are related to everyday problems. One of these problems is how to perform accurate mathematical analyses of large streams of data that we cannot save in a computer's memory. Finally, I will try to give you an idea of my life as a mathematician--the challenges and difficulties, alongside the immense enjoyment and satisfaction I derive from them. Join me to an extended dive into my work on the wonders of combinatorics. [ABSTRACT FROM AUTHOR]

Grey wolf optimization (GWO) algorithm is a new emerging algorithm that is based on the social hierarchy of grey wolves as well as their hunting and cooperation strategies. Introduced in 2014, this algorithm has been used by a large number of researchers and designers, such that the number of citations to the original paper exceeded many other algorithms. In a recent study by Niu et al., one of the main drawbacks of this algorithm for optimizing real‐world problems was introduced. In summary, they showed that GWO's performance degrades as the optimal solution of the problem diverges from 0. In this paper, by introducing a straightforward modification to the original GWO algorithm, that is, neglecting its social hierarchy, the authors were able to largely eliminate this defect and open a new perspective for future use of this algorithm. The efficiency of the proposed method was validated by applying it to benchmark and real‐world engineering problems. [ABSTRACT FROM AUTHOR]

In this paper we propose an approach to introduce a concept of bounded index in an infinite-dimensional space. Our object of investigation is the space ℓ∞ equipped with the norm ∥x∥∞ = sup{|xn|: n ∈ N}. We consider entire curves from C to ℓ∞ and prove a proposition indicating connection between of the l-index boundedness of every component of the curve and the l-index boundedness of the curve. Moreover, we obtain sufficient conditions of the l-index boundedness of entire curves in the space. They describe local behavior of norm of derivatives of the entire curves on the discs. Also, there is posed a problem on necessary conditions of the l-index boundedness of entire curves in infinite-dimensional spaces. [ABSTRACT FROM AUTHOR]

As an application of mathematics to engineering problems, this paper formulates a simple optimal stopping problem to decide the opening time of harvesting farmed fishery resources that maximizes an economic objective function. A sufficient condition for unique existence of the internal optimal opening time is provided and its concrete mathematical analysis is carried out. Comparative statics of the optimal opening time clearly reveals its dependence on the parameters of the farming environment. The problem is finally applied to analyzing management of a commercially important fishery resource in Japan. [ABSTRACT FROM AUTHOR]

Because of size and covariance matrix problems, computing much of anything along the nondominated frontier of a large-scale (1000-3000 securities) portfolio selection problem with semi-continuous variables is a task that has not previously been achieved. But given (a) the speed at which the nondominated frontier of a classical portfolio problem can now be computed and (b) the possibility that there might be overlaps between the nondominated frontier of the classical problem and that of the same problem but with semi-continuous variables, the paper shows how considerable amounts of the nondominated frontier of a large-scale mean-variance portfolio selection problem with semi-continuous variables can be computed in very little time. [ABSTRACT FROM AUTHOR]

This paper deals with the blow-up of the solution to a non-local reaction diffusion problem in ℝN for N = 3 under nonlinear boundary conditions. Utilizing the technique of a differential inequality, lower bounds for the blow-up time are derived when the blow-up does occur under some suitable assumptions. [ABSTRACT FROM AUTHOR]

The notions of "mathematicalness" and "mathematicability" of nature appear in the context of attempts at explaining the effectiveness of mathematics in the description of the world. Mathematicalness of nature means that structures of the world are mathematical. But is this true? Is nature mathematical? In the paper some reasons for mathematicalness of nature are considered. Mathematical analysis is widely used in physics. Its application requires continuity of time and space. There are also different kinds of infinity in the mathematical theories used in physics. This raises the issue: whether the material world is continuous or we "impose" on nature certain properties in order to use convenient mathematical tools. Is mathematics a useful tool, or does it reflect nature? So, is nature mathematical or only mathematicable? The article shows that mathematicalness of nature is only a metaphysical hypothesis. [ABSTRACT FROM AUTHOR]

The paper presents some interesting aspects related to the biography and works of Romanian mathematician Caius Iacob (1912--1992). He was famous for his works in the fields of mathematical analysis, fluid mechanics, classical hydrodynamics and compressible-flow theory. At the age of 19, he graduated from the Mathematics Faculty in Bucharest, and then he went to Paris to continue his studies at the Faculty of Sciences, where he worked on a PhD thesis under the advice of famous French mathematician Henri Villat. On 24 June 1935, Caius Iacob successfully presented to the Sorbonne committee his PhD thesis about "Determination of conjugated harmonic functions with some limit conditions, and their applications in hydrodynamics". Returning to Romania, Caius Iacob had a long and successful career teaching mathematics and mechanics at the universities of Timişoara, Cluj and Bucharest. His most important work is considered the "Mathematical introduction to the mechanics of fluids". This book, providing original ways to work with classical hydrodynamics and compressibleflow theory, was published in Romanian in 1952 and in French in 1959. In 1955, he was elected a Corresponding Member of the Romanian Academy, becoming a titular Member in 1963. He was also President of the Mathematics Section of the Romanian Academy from 1980 until the end of his life, in 1992. In 1991, he initiated the foundation of the "Romanian Academy Institute of Applied Mathematics". In 2001 the institute merged with the "Centre for Mathematical Statistics", which had been created in 1964 by mathematician Gheorghe Mihoc, thus creating the "Gheorghe Mihoc -- Caius Iacob Institute of Mathematical Statistics and Applied Mathematics" of the Romanian Academy. [ABSTRACT FROM AUTHOR]

This paper addresses the exam success rates in Mathematics 1 at the College of Polytechnics in Jihlava (CPJ). Primary data taken from the school information system cover the years 2006-2015. We carried out a success rate analysis based on several criteria (form of study, the reason for termination of studies, gender). We observed the dependence of the success rate on the aforementioned criteria and time. Plus a detailed analysis of the success rate with respect to the study programme was conducted. The contingency tables analysis and correspondence analysis were used to assess the dependencies. The research showed that the success rate in Mathematics 1 has been decreasing over the course of the monitored period of time. The success rate of full-time students is higher compared to the part-time students. Women have higher success rate than men. The respective study programmes showed equivalent results. Technical study programmes show lower success rate in mathematics. The research furthermore implies that mathematics may not always be the cause of a complete termination of studies. To reverse the trend of the growing failure rate we introduced an entrance test of high school basic mathematics followed by a course for those who fail at this test. As a part of our currently running project, our school have been innovating the e-learning modules and working on the textbooks for Seminar in Mathematics that may be completed in a form of an intensive summer or winter school in mathematics. This project's objective is an overall improvement of students' mathematical knowledge and skills. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the R package gendist that computes the probability density function, the cumulative distribution function, the quantile function and generates random values for several generated probability distribution models including the mixture model, the composite model, the folded model, the skewed symmetric model and the arc tan model. These models are extensively used in the literature and the R functions provided here are flexible enough to accommodate various univariate distributions found in other R packages. We also show its applications in graphing, estimation, simulation and risk measurements. [ABSTRACT FROM AUTHOR]

In this paper we study the powers under umbral composition and degeneration for Sheffer sequences, where we presented several applications related to Bernoulli polynomials, Frobenius-Euler polynomials, falling factorial polynomials and Bell polynomials and their degeneration cases. [ABSTRACT FROM AUTHOR]

Time delay due to maturation time, capturing time or other reasons widely exists in biological systems. In this paper, a predator-prey system of Leslie type with diffusion and time delay is studied based on mathematical analysis and numerical simulations. Conditions for both delay induced and diffusion induced Turing instability are obtained by using bifurcation theory. Furthermore, a series of numerical simulations are performed to illustrate the spatial patterns, which reveal the information of density changes of both prey and predator populations. The obtained results show that the interaction between diffusion and time delay may give rise to rich dynamics in ecosystems. [ABSTRACT FROM AUTHOR]

Waveform design is a pivotal component of the fully adaptive radar construct. In this paper, we consider waveform design for radar space time adaptive processing (STAP), accounting for the waveform dependence of the clutter correlation matrix. Due to this dependence, in general, the joint problem of receiver filter optimization and radar waveform design becomes an intractable, nonconvex optimization problem, Nevertheless, it is, however, shown to be individually convex either in the filter or in the waveform variables. We derive constrained versions of a) the alternating minimization algorithm, b) proximal alternating minimization, and c) the constant modulus alternating minimization, which, at each step, iteratively optimizes either the STAP filter or the waveform independently. A fast and slow time model permits waveform design in radar STAP, but the primary bottleneck is the computational complexity of the algorithms. [ABSTRACT FROM PUBLISHER]

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]

In a very influential paper Rota stresses the relevance of mathematical beauty to mathematical research, and claims that a piece of mathematics is beautiful when it is enlightening. He stops short, however, of explaining what he means by 'enlightening'. This paper proposes an alternative approach, according to which a mathematical demonstration or theorem is beautiful when it provides understanding. Mathematical beauty thus considered can have a role in mathematical discovery because it can guide the mathematician in selecting which hypothesis to consider and which to disregard. Thus aesthetic factors can have an epistemic role qua aesthetic factors in mathematical research. [ABSTRACT FROM AUTHOR]

Fuzzy logic is becoming one of the most-influential fields of modern mathematics with applications that impact not only other sciences, but society in general. This newly found interest in fuzzy logic is in part due to the crucial role it plays in the development of artificial intelligence. As a result, new tools and practices for the development of the above-mentioned field are in high demand. This is one of the issues this paper was composed to address. To be more specific, a sizable part of fuzzy logic is the study of fuzzy connectives. However, the current method used to generalize them is restricted to the use of basic automorphisms, which hinders the creation of new fuzzy connectives. For this reason, in this paper, a new method of generalization is conceived of that aims to generalize the fuzzy connectives using polynomial automorphism functions instead. The creation of these automorphisms is achieved through numerical analysis, an endeavor that is supported with programming applications that, using mathematical modeling, validate and visualize the research. Furthermore, the automorphisms satisfy all the necessary criteria that have been established for use in the generalization process and, consequently, are used to successfully generalize fuzzy connectives. The result of the new generalization method is the creation of new usable and flexible fuzzy connectives, which is very promising for the future development of the field.

The generalized degree distance, denoted by Hλ(G); is defined as where λ is any real number. In this paper, we discuss the mathematical properties for the generalized degree distance of four edge grafting transformations of graph. [ABSTRACT FROM AUTHOR]

In this paper we introduce FG-coupled fixed point, which is a generalization of coupled fixed point for nonlinear mappings in partially ordered complete metric spaces. We discuss existence and uniqueness theorems of FGcoupled fixed points for different contractive mappings. Our theorems generalizes the results of Gnana Bhaskar and Lakshmikantham [1]. [ABSTRACT FROM AUTHOR]

Let IK be a complete ultrametric algebraically closed field and let A be the Banach IK-algebra of bounded analytic functions in the "open" unit disk D of IK provided with the Gauss norm. Let Mult(...) be the set of continuous multiplicative semi-norms of A provided with the topology of pointwise convergence, let Multm(...) be the subset of the ε Mult(...) whose kernel is a maximal ideal and let Mult1(...) be the subset of the φ ε Mult(...) whose kernel is a maximal ideal of the form (x-a)A with a ε D. By analogy with the Archimedean context, one usually calls ultrametric Corona problem, or ultrametric Kakutani problem the question whether Mult1(...) is dense in Multm(...). In order to recall the study of this problem that was made in several successive steps, here we first recall how to characterize the various continuous multiplicative semi-norms of A, with particularly the nice construction of certain multiplicative semi-norms of A whose kernell is neither a null ideal nor a maximal ideal, due to J. Araujo. Here we prove that multbijectivity implies density. The problem of multbijectivity will be described in a further paper. [ABSTRACT FROM AUTHOR]

In previous work it was shown that the lower triangular generalized Hausdorff matrix Hαa with nonzero entries hnk= (n+α+1)-1, for a ≥ 0, is subnormal on Ι² if and only if α=0,1,2, …. For 0h : ..., is subnormal when .... In this paper we show that, when dj = Γ( j+1)Γ(h)/Γ( j+h), the square of the weights chosen above, then the corresponding operator Ch is bounded on Ι² for 0 < h < 3/2, that Hα is bounded on Ι² for all non-integer α < 0, and that Ch is closely related to Hh-1. This relationship leads to our main result that Ch is only subnormal when h = 1, when it corresponds to the original Cesaro operator with α = 0 and each dj = 1. [ABSTRACT FROM AUTHOR]

In this paper, two-species stochastic Lotka-Volterra competition system is proposed and discussed. Some sufficient conditions on the boundedness, extinction, non-persistence in the mean, and weak persistence of solutions are established. The critical value between weak persistence and extinction is obtained. [ABSTRACT FROM AUTHOR]

We consider the so-called Encrypted Davies-Meyer (EDM) construction, which turns a permutation P on {0,1}n into a function from {0,1}n to {0,1}n defined as P(P(x)⊕x). A similar construction using two independent permutations, namely P′(P(x)⊕x), was previously analyzed by Cogliati and Seurin (Advances in cryptology—CRYPTO 2016 (Proceedings, Part I). LNCS, vol 9814, pp. 121-149, 2016) who showed that when P and P′ are secret and random, then any black-box adversary needs at least roughly 22n/3 queries to distinguish the construction from a uniformly random function from {0,1}n to {0,1}n. In this paper, we focus on the single-permutation variant of the construction. Our main result is that the PRF-security of the single-permutation EDM construction is also (at least) roughly 22n/3, in the sense that any black-box adversary needs at least this number of queries to distinguish the construction from a uniformly random function. This yields the first PRP-to-PRF conversion method which uses a single permutation, does not shrink the original domain nor range of the permutation, and provides security beyond the birthday bound. [ABSTRACT FROM AUTHOR]

In this paper, proper optimality concepts in vector optimization with variable ordering structures are introduced for the first time and characterization results via scalarizations are given. New type of scalarizing functionals are presented and their properties are discussed. The scalarization approach suggested in the paper does not require convexity and boundedness conditions. [ABSTRACT FROM AUTHOR]

Bayesian network classifiers (BNCs) have demonstrated competitive classification performance in a variety of real-world applications. A highly scalable BNC with high expressivity is extremely desirable. This paper proposes Redundant Dependence Elimination (RDE) for improving the classification performance and expressivity of k-dependence Bayesian classifier (KDB). To demonstrate the unique characteristics of each case, RDE identifies redundant conditional dependencies and then substitute/remove them. The learned personalized k-dependence Bayesian Classifier (PKDB) can achieve high-confidence conditional probabilities, and graphically interpret the dependency relationships between attributes. Two thyroid cancer datasets and four other cancer datasets from the UCI machine learning repository are selected for our experimental study. The experimental results prove the effectiveness of the proposed algorithm in terms of zero-one loss, bias, variance and AUC. [ABSTRACT FROM AUTHOR]

Countries, research institutions, and scholars are interested in identifying and promoting high-impact and transformative scientific research. This paper presents a novel set of text- and citation-based metrics that can be used to identify high-impact and transformative works. The 11 metrics can be grouped into seven types: Radical-Generative, Radical-Destructive, Risky, Multidisciplinary, Wide Impact, Growing Impact, and Impact (overall). The metrics are exemplified, validated, and compared using a set of 10,778,696 MEDLINE articles matched to the Science Citation Index ExpandedTM. Articles are grouped into six 5-year periods (spanning 1983–2012) using publication year and into 6,159 fields constructed using comparable MeSH terms, with which each article is tagged. The analysis is conducted at the level of a field-period pair, of which 15,051 have articles and are used in this study. A factor analysis shows that transformativeness and impact are positively related (ρ = .402), but represent distinct phenomena. Looking at the subcomponents of transformativeness, there is no evidence that transformative work is adopted slowly or that the generation of important new concepts coincides with the obsolescence of existing concepts. We also find that the generation of important new concepts and highly cited work is more risky. Finally, supporting the validity of our metrics, we show that work that draws on a wider range of research fields is used more widely. [ABSTRACT FROM AUTHOR]

In this paper, a unique and more distinctive encryption algorithm is proposed. This is based on the complexity of highly nonlinear S box in Flesnelet domain. The nonlinear pattern is transformed further to enhance the confusion in the dummy data using Fresnelet technique. The security level of the encrypted image boosts using the algebra of Galois field in Fresnelet domain. At first level, the Fresnelet transform is used to propagate the given information with desired wavelength at specified distance. It decomposes given secret data into four complex subbands. These complex sub-bands are separated into two components of real subband data and imaginary subband data. At second level, the net subband data, produced at the first level, is deteriorated to non-linear diffused pattern using the unique S-box defined on the Galois field . In the diffusion process, the permuted image is substituted via dynamic algebraic S-box substitution. We prove through various analysis techniques that the proposed scheme enhances the cipher security level, extensively. [ABSTRACT FROM AUTHOR]

Let r ≥ 2 and r be even. An r -hypergraph G on n vertices is called odd-colorable if there exists a map φ : [ n ] → [ r ] such that for any edge { j 1 , j 2 , … , j r } of G , we have φ ( j 1 ) + φ ( j 2 ) + ⋅ ⋯ ⋅ + φ ( j r ) ≡ r ∕ 2 ( mod r ) . In this paper, we first determine that, if r = 2 q ( 2 t + 1 ) and n ≥ 2 q ( 2 q − 1 ) r , then the maximum chromatic number in the class of the odd-colorable r -hypergraphs on n vertices is 2 q , which answers a question raised by V. Nikiforov recently in Nikiforov (2017). We also study some applications of the spectral symmetry of the odd-colorable r -hypergraphs given in the same paper by V. Nikiforov. We show that the Laplacian spectrum S p e c ( L ( G ) ) and the signless Laplacian spectrum S p e c ( Q ( G ) ) of an r -hypergraph G are equal if and only if r is even and G is odd-colorable. As an application of this result, we give an affirmative answer for the remaining unsolved case r ⁄ ≡ 0 ( m o d 4 ) of a question raised in Shao et al. (2015) about whether S p e c ( L ( G ) ) = S p e c ( Q ( G ) ) implies that L ( G ) and Q ( G ) have the same H-spectrum. [ABSTRACT FROM AUTHOR]

In this paper we isolate a property for forcing notions, the *-Prikry condition, that is similar to the Prikry con- dition but that is topological: A forcing P satisfies it iff for every p ∈ P and for every open dense D ⊆ P, there are n ∈ ω and q ≤∗ p such that for any r ≤ q with l(r) = l(q) + n, r ∈ D, for some length notion l. This is implicit in many proofs in literature. We prove this for the tree Prikry forcing and the long extender Prikry forcing. [ABSTRACT FROM AUTHOR]

This paper proposes a new measure for recommendation through integrating Triangle and Jaccard similarities. The Triangle similarity considers both the length and the angle of rating vectors between them, while the Jaccard similarity considers non co-rating users. We compare the new similarity measure with eight state-of-the-art ones on four popular datasets under the leave-one-out scenario. Results show that the new measure outperforms all the counterparts in terms of the mean absolute error and the root mean square error. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the notion of weak Weak θ-φ-contraction ensuring a convergence of successive approximations but does not force the mapping to be continuous at the fixed point. Thus, we answer one more solution to the open question raised by Rhoades in [B. E. Rhoades, Fixed point theory Appl, Berkeley, CA, (1986), Contemp. Math., Amer. Math. Soc., Providence, RI, 72 (1988), 233-245]. [ABSTRACT FROM AUTHOR]

In this paper, we prove some theorems about the Hyers-Ulam stability of the functional equation f(2x + y) + f(2x - y) = 2f(x + y) + 2f(x - y) + 2[f(2x) - 2f(x)] in paranormed spaces. From these theorems, as corollaries, we obtain the stability of the above functional equation with weaker conditions controlled by product of powers of norms and mixed-type product-sum of powers of norms. [ABSTRACT FROM AUTHOR]

In their role as second messengers, cyclic nucleotides such as cAMP have a variety of intracellular effects. These complex tasks demand a highly organized orchestration of spatially and temporally confined cAMP action which should be best achieved by compartmentalization of the latter. A great body of evidence suggests that cAMP compartments may be established and maintained by cAMP degrading enzymes, e.g. phosphodiesterases (PDEs). However, the molecular and biophysical details of how PDEs can orchestrate cAMP gradients are entirely unclear. In this paper, using fusion proteins of cAMP FRET-sensors and PDEs in living cells, we provide direct experimental evidence that the cAMP concentration in the vicinity of an individual PDE molecule is below the detection limit of our FRET sensors (<100nM). This cAMP gradient persists in crude cytosol preparations. We developed mathematical models based on diffusion-reaction equations which describe the creation of nanocompartments around a single PDE molecule and more complex spatial PDE arrangements. The analytically solvable equations derived here explicitly determine how the capability of a single PDE, or PDE complexes, to create a nanocompartment depend on the cAMP degradation rate, the diffusive mobility of cAMP, and geometrical and topological parameters. We apply these generic models to our experimental data and determine the diffusive mobility and degradation rate of cAMP. The results obtained for these parameters differ by far from data in literature for free soluble cAMP interacting with PDE. Hence, restricted cAMP diffusion in the vincinity of PDE is necessary to create cAMP nanocompartments in cells. [ABSTRACT FROM AUTHOR]

In this paper we study the interval scoring rule as a mechanism to elicit subjective beliefs under varying degrees of uncertainty. In our experiment, subjects forecast the termination time of a time series to be generated from a given but unknown stochastic process. Subjects gradually learn more about the underlying process over time and hence the true distribution over termination times. We conduct two treatments, one with a high and one with a low volatility process. We find that elicited intervals are better when subjects are facing a low volatility process. In this treatment, participants learn to position their intervals almost optimally over the course of the experiment. This is in contrast with the high volatility treatment, where subjects, over the course of the experiment, learn to optimize the location of their intervals but fail to provide the optimal length. [ABSTRACT FROM AUTHOR]

Perpetual points represent a new interesting topic in the literature of nonlinear dynamics. This paper introduces some chaotic flows with four different structural features from the viewpoint of fixed points and perpetual points. [ABSTRACT FROM AUTHOR]

The origins of mathematics are likely older than the oldest cultures known to us today. However, the fact remains that our evidence for early mathematics is found only in ancient written texts, of which only a few examples have survived. Some of the earliest examples of mathematical texts come from ancient Egypt and Mesopotamia. This paper looks at the Rhind Mathematical Papyrus (c. 1575 - 1540 BCE), reinvestigating four geometrical problems (Nos. 49-52). Specifically, I retranslate each mathematical problem, as well as adding to the current scholarship by providing a transliteration and commentary for the reader, followed by a mathematical analysis of these ancient calculations. [ABSTRACT FROM AUTHOR]

In this paper, we study option pricing under a regime-switching exponential Lévy model. Assuming that the coefficients are time-dependent and modulated by a finite state Markov chain, we generalise the work in Momeya and Morales (Method Comput Appl Probab, 2014, doi:), and Siu and Yang (Acta Mathe Appl Sin 2:369-388, 2009), that is, we use a pricing method based on the Esscher transform conditional on the information available on the Markov chain. We also carry out numerical analysis, to show the impact of the risk induced by the underlying Markov chain on the price of the option. [ABSTRACT FROM AUTHOR]

Usually dynamic properties of models can be analysed by conducting simulation experiments. But sometimes, as a kind of prediction properties can also be found by calculations in a mathematical manner, without performing simulations. Examples of properties that can be explored in such a manner are: Such properties found in an analytic mathematical manner can be used for verification of the model by checking them for the values observed in simulation experiments. If one of these properties is not fulfilled, then there will be some error in the implementation of the model. In this paper some methods to analyse such properties of dynamical models will be described and illustrated for the Hebbian learning model, and for dynamic connection strengths in social networks. The properties analysed by the methods discussed cover equilibria, increasing or decreasing trends, recurring patterns (limit cycles), and speed of convergence to equilibria. [ABSTRACT FROM AUTHOR]

Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algorithm is only allowed to run for up to time D, then it is no longer guaranteed that a result can be found. In this case, the probability of finding a solution within the time D becomes a measure for the quality of the algorithm. In this paper we address this issue and provide upper and lower bounds for the probability of A finding a solution before a deadline passes under varying assumptions. We also show that the optimal restart times for a fixed cut-off algorithm running in parallel is identical for the optimal restart times for the algorithm running on a single processor. Finally, we conclude that the odds of finding a solution scale superlinearly in the number of processors. [ABSTRACT FROM AUTHOR]

Community structure is considered one of the most interesting features in complex networks. Many real-world complex systems exhibit community structure, where individuals with similar properties form a community. The identification of communities in a network is important for understanding the structure of said network, in a specific perspective. Thus, community detection in complex networks gained immense interest over the last decade. A lot of community detection methods were proposed, and one of them is the label propagation algorithm (LPA). The simplicity and time efficiency of the LPA make it a popular community detection method. However, the LPA suffers from instability detection due to randomness that is induced in the algorithm. The focus of this paper is to improve the stability and accuracy of the LPA, while retaining its simplicity. Our proposed algorithm will first detect the main communities in a network by using the number of mutual neighbouring nodes. Subsequently, nodes are added into communities by using a constrained LPA. Those constraints are then gradually relaxed until all nodes are assigned into groups. In order to refine the quality of the detected communities, nodes in communities can be switched to another community or removed from their current communities at various stages of the algorithm. We evaluated our algorithm on three types of benchmark networks, namely the Lancichinetti-Fortunato-Radicchi (LFR), Relaxed Caveman (RC) and Girvan-Newman (GN) benchmarks. We also apply the present algorithm to some real-world networks of various sizes. The current results show some promising potential, of the proposed algorithm, in terms of detecting communities accurately. Furthermore, our constrained LPA has a robustness and stability that are significantly better than the simple LPA as it is able to yield deterministic results. [ABSTRACT FROM AUTHOR]

This paper considers the problem of minimizing a nonlinear objective function subject to a system of bipolar fuzzy relational equations with max- $T_{L}$ composition, where $T_{L}$ is the Łukasiewicz triangular norm. It shows that the feasible domain, i.e., the solution set of a system of bipolar fuzzy relational equations, can be reformulated as a system of 0-1 mixed integer inequalities. Consequently, such a type of optimization problems can be handled within the framework of 0-1 mixed integer optimization requiring no particular solving techniques. [ABSTRACT FROM AUTHOR]

Mesh matching is an effective way to convert the non-conforming interfaces between two hexahedral meshes into conforming ones, which is very important for achieving high-quality finite element analysis. However, the existing mesh matching algorithm is neither efficient nor effective enough to handle complex interfaces and self-intersecting sheets. In this paper, the algorithm is improved in three aspects: (1) by introducing a more precise criteria for chord matching and the concept of partition chord set, complex interfaces with internal loops can be handled more effectively; (2) by proposing a new solution, self-intersecting sheet can be inflated and extracted locally; and (3) by putting forward a mesh quality evaluation method, the sheet extraction operation during mesh matching can be done more efficiently. Our improved mesh matching algorithm is fully automatic, and its effectiveness is demonstrated by several examples in different matching situations. [ABSTRACT FROM AUTHOR]

The importance of mathematics in the context of the scientific and technological development of humanity is determined by the possibility of creating mathematical models of the objects studied under the different branches of Science and Technology. The arithmetisation process that took place during the nineteenth century consisted of the quest to discover a new mathematical reality in which the validity of logic would stand as something essential and central. Nevertheless, in contrast to this process, the development of mathematical analysis within a framework that largely involves intuition and geometry is a fact that cannot go unnoticed amongst the mathematics community, as we shall show in this paper through the research made by Bernhard Riemann on complex variables. [ABSTRACT FROM AUTHOR]