Search

Compared with the two-valued memristor, the three-valued memristor has higher data density, richer dynamic characteristics, and more potential in digital logic and chaotic circuit. The present model of the three-valued memristor has several limitations. It doesn't perform well enough in three-valued applications since its hysteresis loops are linear and asymmetric. The mathematical model of the three-valued memristor with nonlinear and symmetric hysteresis loops is proposed in this research. To further investigate the electrical characteristics of the three-valued memristor, a circuit emulator of the memristor has been constructed with fundamental components. Multisim simulations and hardware experiments demonstrate the emulator's effectiveness. The three-valued memristor application in chaotic circuits shows fascinating dynamic characteristics and lays the foundation for future research. • The mathematical model of the three-valued memristor with nonlinear and symmetric hysteresis loops is proposed in this paper. • A circuit emulator of the three-valued memristor is proposed and verified using hardware and software. • The three-valued memristor application in chaotic circuits shows fascinating dynamic characteristics. [ABSTRACT FROM AUTHOR]

In this article, we consider a 4-dimensional predator–prey chemostat model of nitrogen-phytoplankton-rotifer interactions with staged structure proposed by Blasius et al. (2020). Although it is still difficult to prove the simulation observations in Blasius et al. (2020) by mathematical arguments, we explore the dynamics in order to better understand the dynamical mechanism of cyclic persistence for this model. We firstly investigate the corresponding system without staged structure, i.e., when the juvenile is absent, the asymptotical behavior of the solutions is given. When the juvenile is present, a threshold condition for the uniform persistence of the 4-dimensional system is provided. Finally, by choosing the life development time delay as a bifurcation parameter, we show that the system admits periodic solutions near one semi-equilibrium undergoing Hopf bifurcation. The rigorous theoretical analytic work in this paper provides some helpful transient information between coherent oscillation and non-coherent oscillation described by the experimental data of Blasius et al. (2020). [ABSTRACT FROM AUTHOR]

In wet-lab experiments, the slime mold Physarum polycephalum has demonstrated its ability to tackle a variety of computing tasks, among them the computation of shortest paths and the design of efficient networks. For the shortest path problem, a mathematical model for the evolution of the slime is available and it has been shown in computer experiments and through mathematical analysis that the dynamics solves the shortest path problem. In this paper, we generalize the dynamics to the network design problem. We formulate network design as the problem of constructing a network that efficiently supports a multi-commodity flow problem. We investigate the dynamics in computer simulations and analytically. The simulations show that the dynamics is able to construct efficient and elegant networks. In the theoretical part we show that the dynamics minimizes an objective combining the cost of the network and the cost of routing the demands through the network. We also give alternative characterizations of the optimum solution. [ABSTRACT FROM AUTHOR]

As a type of uncertain differential equations, uncertain spring vibration equation is driven by Liu process. This paper proposes a concept of α -path, and shows that the solution of an uncertain spring vibration equation can be expressed by a family of solutions of second-order ordinary differential equations. This paper also proves that the inverse uncertainty distribution of solution of uncertain spring vibration equation is just the α -path of uncertain spring vibration equation, and a numerical algorithm is designed. Moreover, a formula to calculate the expected value of solution of uncertain spring vibration equation is derived. Finally, several numerical examples are provided to illustrate the efficiency of the numerical method. [ABSTRACT FROM AUTHOR]

For a Tychonoff space X , we denote by C p ( X ) the space of all real-valued continuous functions on X with the topology of pointwise convergence. In this paper we continue to study different selectors for sequences of dense sets of C p ( X ) started to study in the paper [14] . A set A ⊆ C p ( X ) will be called 1 -dense in C p ( X ) , if for each x ∈ X and an open set W in R there is f ∈ A such that f ( x ) ∈ W . We give the characterizations of selection principles S 1 ( A , A ) , S f i n ( A , A ) and S 1 ( S , A ) where • A — the family of 1-dense subsets of C p ( X ) ; • S — the family of sequentially dense subsets of C p ( X ) , through the selection principles of a space X . In particular, we give the functional characterizations of the Rothberger and Menger properties. [ABSTRACT FROM AUTHOR]

Typed models of connector/component composition specify interfaces describing ports of components and connectors. Typing ensures that these ports are plugged together appropriately, so that data can flow out of each output port and into an input port. These interfaces typically consider the direction of data flow and the type of values flowing. Components, connectors, and systems are often parameterised in such a way that the parameters affect the interfaces. Typing such connector families is challenging. This paper takes a first step towards addressing this problem by presenting a calculus of connector families with integer and boolean parameters. The calculus is based on monoidal categories, with a dependent type system that describes the parameterised interfaces of these connectors. We use families of Reo connectors as running examples, and show how this calculus can be applied to Petri Nets and to BIP systems. The paper focuses on the structure of connectors— well-connectedness —and less on their behaviour, making it easily applicable to a wide range of coordination and component-based models. A type-checking algorithm based on constraints is used to analyse connector families, supported by a proof-of-concept implementation. [ABSTRACT FROM AUTHOR]

In this paper, it is addressed by mathematical analysis how network-oriented modeling relates to the dynamical systems perspective on mental processes. It has been mathematically proven that any dynamical system can be modeled as a temporal-causal network model and that any adaptive dynamical system (of any order) can be modeled by a self-modeling network (of the same order). [ABSTRACT FROM AUTHOR]

Tumor growth models have proved as an important tool to produce an engineering background for cancer therapy either by designing therapeutic procedures combined with control engineering or by using the models for simulations and evaluation of treatment procedures. Mathematical modeling has been critical for the description of tumor growth, which is a highly complex process, as a finely chiseled tumor growth model always outlines the measurements and the physiological processes of the tumors. Therefore, a mathematical model involving partial differential equations for the growth of tumor have been studied, modified and developed in this paper. It is based on the deterministic model of an avascular tumor growth which is framed in a system of nonlinear coupled PDEs, describing the proliferating, quiescent, necrotic, and surrounding cells densities, accompanied by a supply of the nutrients. These equations are explained numerically by the Finite Difference Method. Furthermore, the simulations are carried out by introducing the Gompertz growth rate function for mitosis rate function g(c) of proliferating cells in the model. The discretization forms a system of coupled nonlinear difference equations which are solved at each iteration. The algorithm is implemented sequentially in MATLAB 2018a and numerical results suggest that the employed model is an authentic tool for analyzing the dynamics of tumor. [ABSTRACT FROM AUTHOR]

Matt Blum conjectured that the- number of tilings of a hexagonal dungeon with side-lengths a , 2 a , b , a , 2 a , b (for b ≥ 2 a ) equals 1 3 2 a 2 1 4 ⌊ a 2 ∕ 2 ⌋ . Ciucu and the author of the present paper proved the conjecture by using Kuo’s graphical condensation method. In this paper, we investigate a 3-parameter refinement of the conjecture and its application to enumeration of tilings of several new types of the hexagonal dungeons. [ABSTRACT FROM AUTHOR]

Strict distinguishability is the property of two systems to generate identical output signals only for the zero control input and the zero initial state vector. The objective of this paper is to characterize this property for single-output nonlinear control-affine systems. In this context, we first introduce the indistinguishability zone of the systems. This zone represents the set of control inputs and initial state vectors that make the output signals of the systems indistinguishable. The explicit identification of the elements of this set is proposed in the paper. From this result, necessary and sufficient conditions for strict distinguishability are then established under suitable assumptions. [ABSTRACT FROM AUTHOR]

This paper proposes a novel optimization algorithm for grouping problems, the Grouping Coral Reefs Optimization algorithm, and describes its application to a Mobile Network Deployment Problem (MNDP) under four optimization criteria. These criteria include economical cost and coverage, and also electromagnetic pollution control and capacity constraints imposed at the base stations controllers, which are novel in this study. The Coral Reefs Optimization algorithm (CRO) is a recently-proposed bio-inspired approach for optimization, based on the simulation of the processes that occur in coral reefs, including reproduction, fight for space or depredation. This paper presents a grouping version of the CRO, which has not previously evaluated before. Grouping meta-heuristics are characterized by variable-length encoding solutions, and have been successfully applied to a number of different optimization and assignment problems. The GCRO proposed is a novel contribution to the intelligent systems field, which is able to improve results obtained by two alternative grouping algorithms such as grouping genetic algorithms and grouping Harmony Search. The performance of the proposed GCRO and the algorithms for comparison has been tested with real data in a case study of a MNDP in Alcalá de Henares, Madrid, Spain. [ABSTRACT FROM AUTHOR]

Our paper introduces a new methodology to solve group decision-making problems under fuzzy and dynamic environment. The methodology takes group members’ linguistically defined pair wise preferences of alternatives in different time intervals and aggregates them across the intervals to obtain each member's net preference levels. Each member's net preference levels are again aggregated across the members to obtain the group's preference. Our paper attaches higher importance to the members whose involvement in the decision process is more recent than the members who opined their views in the past. The fuzzy aggregation operator, IOWA (Induced Ordered Weighted Average) is used to aggregate their views in accordance to their importance in the group. The Ranked_List algorithm, introduced in our paper, inputs the aggregated views of the members in pair wise form and produces the set of sequences of ranked list of alternatives representing the group's consensus view as output. The Ranked_List algorithm is validated and analyzed through a series of synthetic data sets and its results are compared with a movie selection case study. The methodology is illustrated with a numerical example. [ABSTRACT FROM AUTHOR]

The main aim of this paper is to connect R-fuzzy sets and type-2 fuzzy sets, so as to provide a practical means to express complex uncertainty without the associated difficulty of a type-2 fuzzy set. The paper puts forward a significance measure, to provide a means for understanding the importance of the membership values contained within an R-fuzzy set. The pairing of an R-fuzzy set and the significance measure allows for an intermediary approach to that of a type-2 fuzzy set. By inspecting the returned significance degree of a particular membership value, one is able to ascertain its true significance in relation, relative to other encapsulated membership values. An R-fuzzy set coupled with the proposed significance measure allows for a type-2 fuzzy equivalence, an intermediary, all the while retaining the underlying sentiment of individual and general perspectives, and with the adage of a significantly reduced computational burden. Several human based perception examples are presented, wherein the significance degree is implemented, from which a higher level of detail can be garnered. The results demonstrate that the proposed research method combines the high capacity in uncertainty representation of type-2 fuzzy sets, together with the simplicity and objectiveness of type-1 fuzzy sets. This in turn provides a practical means for problem domains where a type-2 fuzzy set is preferred but difficult to construct due to the subjective type-2 fuzzy membership. [ABSTRACT FROM AUTHOR]

The presence of the golden mussel in Brazil is a matter of great concern and causes harm to the country, particularly affecting the power generation sector. Infestation control represents a challenge, and there is a need to mathematically describe the dynamics of the problem. This work proposes to analyze a mathematical model based on differential equations that relate the populations of larvae, mussels, and algae. For this model, the critical points and stationary states are determined, seeking steady-state conditions stability, through the basic reproduction rate. In addition, it presents the sensitivity analysis of the parameters involved. The paper results are relevant as they allow mathematical interpretation of the golden mussel infestation potential through the basic reproduction rate. Furthermore, the sensitivity analysis suggests how important the parameters are for this potential. For that matter, this work can provide baseline information to guide future control strategies as it provides quantification of the species involved over time as well as a condition for infestation. • Mussel-algae interaction model. • Stability analysis of stationary solutions of the model. • Basal reproduction rate for the golden mussel model. [ABSTRACT FROM AUTHOR]

This paper shows that a hazard function can be additively decomposed, and with the additively decomposed hazard function, it shows that one can identify the others' effects which come from interactions between potential adopters and the adopters who bought at every adoption time interval. Also, from the additive decomposition of the discrete Bass hazard function, it derives the discrete Bass model which is consistent with the continuous version of Bass model. Furthermore, the coefficients of the derived discrete Bass model are expressed as the functions of coefficients of the continuous Bass model. Based on the derived discrete Bass model, thus, this paper presents a valuation scheme (calculator) for adopter groups which are classified by every observation time. The valuation calculator allows managers to calculate adopters' values only with the estimates of the continuous Bass model. [ABSTRACT FROM AUTHOR]

This paper studies zeros of networked linear systems with time-invariant interconnection topology. While the characterization of zeros is given for both heterogeneous and homogeneous networks, homogeneous networks are explored in greater detail. In the current paper, for homogeneous networks with time-invariant interconnection dynamics, it is illustrated how the zeros of each individual agent’s system description and zeros definable from the interconnection dynamics contribute to generating zeros of the whole network. We also demonstrate how zeros of networked systems and those of their associated blocked versions are related. [ABSTRACT FROM AUTHOR]

In this paper we continue work from a previous paper on the fragility and indestructibility of the tree property. We present the following: (1) A preservation lemma implicit in Mitchell's PhD thesis, which generalizes all previous versions of Hamkins' Key lemma. (2) A new proof of the ‘superdestructibility’ theorems of Hamkins and Shelah. (3) An answer to a question from our previous paper on the apparent consistency strength of the assertion “The tree property at ℵ 2 is indestructible under ℵ 2 -directed closed forcing”. (4) Two models for successive failures of weak square on long intervals of cardinals. [ABSTRACT FROM AUTHOR]

In the last decades, gain-scheduling control techniques have consolidated as an efficient answer to analysis and synthesis problems for non-linear systems. Among the approaches proposed in the literature, the linear parameter varying (LPV) and Takagi–Sugeno (TS) paradigms have proved to be successful in dealing with the different trials that the analyzer, or the designer, of a gain-scheduled control system has to face. Despite the strong similarities between the two paradigms, research on LPV and TS systems has been performed in an independent way and some results that could be useful for both paradigms were obtained only for one of them. However, in recent works, some clues that there is a very close connection between LPV and TS worlds have been presented. The present paper openly addresses the presence of strong analogies between LPV and TS models, in an attempt to establish a bridge between these two worlds, so far considered different. In particular, this paper addresses the modeling problem, presenting two methods for the automated generation of LPV and TS systems, and introducing some measures in order to compare the obtained models. A mathematical example is used to illustrate the proposed methods. [ABSTRACT FROM AUTHOR]

The paper presents results of analysis of existing mathematical models for orbital debris fragments breakup in high velocity collisions. The breakup models are modified and updated taking into account the latest breakup criteria, experimental data and basic conservation laws. The model examples are analyzed, the criterion is developed for distinguishing fragments, which will stay in orbit after collision event. • Analysis of mathematical models for orbital debris fragments breakup is presented. • The breakup models are modified and updated. • Criterion for distinguishing fragments, which will stay in orbit, is developed. [ABSTRACT FROM AUTHOR]

This survey paper aims at providing a "literary" anthology of mathematical morphology on graphs. It describes in the English language many ideas stemming from a large number of different papers, hence providing a unified view of an active and diverse field of research. [ABSTRACT FROM AUTHOR]

In this paper, a new mathematical model related to a mining extraction project under uncertainty is proposed. The underlying stochastic factors are the commodity price and the remaining resource, the dynamics of which are introduced. In the stochastic differential equation satisfied by the remaining resource, the extraction rate is involved. The main innovative modelling feature, comes from considering the extraction rate to be proportional to the commodity price, which is more realistic. In this way, an ultraparabolic hypoelliptic differential operator governs the associated PDE of the mathematical model. The mathematical analysis allows to obtain the existence and uniqueness of a classical solution. Uniqueness follows from a suitable Feynman–Kac representation formula. Existence of a classical solution is obtained after a suitable change of variables, the determination of sub and supersolutions and passing to the limit from problems in bounded domains to the unbounded one. For the numerical solution, after justifying the required boundary conditions on the computational bounded domain, the proposed numerical techniques mainly consist of a Crank–Nicolson characteristics method for the time discretization to cope with the convection dominating setting and Lagrange finite elements for the discretization in the commodity and resource variables. Finally, some numerical examples are discussed to illustrate the good performance of the new model and the proposed numerical methods. [ABSTRACT FROM AUTHOR]

• A meta-plate with high-static-low-dynamic stiffness local resonators is proposed. • Mathematical modeling of the meta-plate is established and solved by plane-wave expansion method. • The band gaps are predicted analytically and validated by numerical simulations. • The meta-plate with HSLD resonators can generate very low-frequency band gaps. Aiming to attenuate very low-frequency flexural wave in a thin plate, this paper proposes a meta-plate model by periodically attaching high-static-low-dynamic-stiffness (HSLDS) resonators onto the thin plate. The HSLDS resonator consists of a linear spring with a negative stiffness mechanism (NSM) in parallel, and thus its stiffness can be adjusted to any low values within a range from zero to the stiffness of the linear spring. Using the plane-wave expansion (PWE) method, and considering the linearized stiffness of the resonator, the dispersion relation of the meta-plate can be derived and the band structure can be obtained. A dynamic model of the meta-plate with the original nonlinear stiffness under external excitations is also established. The numerical simulations are carried out by the Galerkin method to evaluate the band structure and study the propagation of the flexural wave along the meta-plate with different azimuth angles. The analytical results exhibit good agreement with the numerical ones, which indicates that the proposed meta-plate can create a very low-frequency band gap. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we present a multipoint machining method for the 5-axis machining of triangulated surfaces with radiused end mills. The main idea is to drop the tool onto the surface to find an initial point of contact, and then rotate the tool while maintaining tangency with this initial point of contact until a second point of contact is found. The proposed procedure ensures a gouge-free position with two points of contact, allowing for a larger side step than a single point of contact method. This proof of concept paper presents the mathematical equations that must be solved to position the tool with two points of contacts on an STL surface. The paper further verifies the concept with simulations and presents experimental results to confirm the simulations. [Copyright &y& Elsevier]

A range of new fractional-order love dynamics is modelled in this paper using the Caputo (power-law), Caputo–Fabrizio (exponential decay-law) and Atangana–Baleanu (Mittag-Leffler-law) fractional operators. We utilize the new fractional Adams–Bashforth schemes for the approximation of these derivatives. This method was developed with the standard differentiation technique by applying the fundamental theorem of calculus and taking the difference of two times levels at t = (t n , t n + 1). The stability analysis applies the theory of classical order differential equations and dynamical system. The Existence and uniqueness of solution of fractional dynamics is proved by adopting the fixed-point theorem. Numerical results presented for various α − values justify the theoretical findings. It was observed that modelling of interpersonal and romantic love affairs with fractional derivative could exhibit some strange emotional attractors. • Fractional two-step Adams–Bashforth methods. • Numerical approximation and simulation. • Existence and uniqueness of solutions via fixed-point theorem. • The Caputo, Caputo–Fabrizio and Atangana–Baleanu fractional derivatives. [ABSTRACT FROM AUTHOR]

• A novel fractional discrete multivariate grey model is proposed. • The proposed model is proved to be an unbiased model theoretically. • A revised Grey Wolf Optimizer is introduced to optimize the fractional order. • The proposed model outperforms other nine grey models in four case studies. • The proposed model presents high potential in real world applications. Fractional order accumulation is a novel and popular tool which is efficient to improve accuracy of the grey models. However, most existing grey models with fractional order accumulation are all developed on the conventional methodology of grey models, which may be inaccurate in the applications. In this paper an existing fractional multivariate grey model with convolution integral is proved to be a biased model, and then a novel fractional discrete multivariate grey model based on discrete modelling technique is proposed, which is proved to be an unbiased model with mathematical analysis and stochastic testing. An algorithm based on the Grey Wolf Optimizer is introduced to optimize the fractional order of the proposed model. Four real world case studies with updated data sets are executed to assess the effectiveness of the proposed model in comparison with nine existing multivariate grey models. The results show that the Grey Wolf Optimizer-based algorithm is very efficient to optimize the fractional order of the proposed model, and the proposed model outperforms other nine models in the all the real world case studies. [ABSTRACT FROM AUTHOR]

Abstract In this paper we present some characterizations for quasi-arithmetic operator means (among them the arithmetic and harmonic means) on the positive definite cone of the full algebra of Hilbert space operators, and also for the Kubo–Ando geometric mean on the positive definite cone of a general non-commutative C ⁎ -algebra. [ABSTRACT FROM AUTHOR]

Abstract In this paper, we study the problem of estimating certain functionals generated by some maps defined on a linear space endowed with the structure of a normal decomposition system. We reduce such task to the case of a subsystem of the given system. Thus we develop a result of Drury (2004) [4] stated for functionals induced by isoclinally metaconvex maps on Hermitian matrices. Some applications are shown. [ABSTRACT FROM AUTHOR]

Highlights • Dynamical analysis has been provided to describe nonlinear behavior of supercavitating vehicles. • Robust H∞ loop-shaping synthesis with modified PID algorithm is proposed to control the dive plane maneuver of the HSSV. • Multi-objective control problems are solved using BMI optimization of an equivalent Schur formula. • Control scheme has the low order structure and provides robustness against uncertainties. • Integrated robust controller can deal with high parametric uncertainties and suppress exogenous disturbances and sensor noises. Abstract The high-speed supercavitating vehicle (HSSV) utilizes advanced technology that enables an underwater vehicle to reach its unprecedented high speed. The vertical motion control of the HSSV is challenging problem because of its complex dynamics with nonlinear planing force, parametric uncertainties, external disturbances, actuator saturation, and sensor noises. This paper deals with dynamical analysis and a robust H∞ loop-shaping synthesis with modified PID (proportional-integral-derivative) algorithm to control the dive plane maneuver of the HSSV. Typically, the control scheme has the low order structure and provides robustness against dynamic uncertainties, which can be implemented using the bilinear matrix inequality (BMI) optimization of an equivalent Schur formula. Simulation results show that the controlled vehicle system provides good performance and high robustness against uncertainties, ensuring no-overshoot and fast in time-domain responses. In addition, the control algorithm can decouple the dynamic interactions in the multi-input multi-output (MIMO) system, overcoming parametric uncertainty, planing force, and actuator saturation while minimizing the effect of the strong external disturbances and measurement noises. [ABSTRACT FROM AUTHOR]

Highlights • A novel spacetime meshless method for solving the backward heat conduction problem. • Numerical approximation using the Trefftz basis function of the heat equation. • Collocating the boundary points in the spacetime coordinate system in the Trefftz method. • Highly accurate numerical solutions can be obtained comparing to that from conventional time-marching scheme. • Boundary data on the inaccessible boundary can be recovered even the partial data on the final time boundary are absent. Abstract This paper presents a novel space–time meshless method for solving the backward heat conduction problem (BHCP). A numerical approximation is obtained using the Trefftz basis function of the heat equation. The Trefftz method, which differs from conventional collocation methods based on a set of unstructured points in space, is used in this study to collocate boundary points in the space–time coordinate system such that the initial and boundary conditions can both be treated as boundary conditions on the space–time domain boundary. Because the solution in time on the boundary of the domain is unknown, the BHCP can be transformed into an inverse boundary value problem. The numerical solution is obtained by superpositioning the Trefftz base functions that automatically satisfy the governing equation. The validity of the proposed method is established for several test problems, including the one-dimensional BHCP and two-dimensional BHCP. The accuracy of the proposed method is compared with that of a conventional time-marching scheme based on the finite difference method. The results demonstrate that highly accurate numerical solutions can be obtained and errors may not accumulate over the entire time domain. Moreover, the boundary data on the inaccessible boundary can be recovered even when the partial data on the final time boundary are absent. [ABSTRACT FROM AUTHOR]

Highlights • A degradation interaction model is proposed for a two-component system. • Economic dependence between components is studied. • An opportunistic maintenance policy is proposed for a two-component system with both economic and degradation interaction. • A case study of a gearbox platform is investigated. • Particle filter is implemented to estimate the parameters of the proposed model. Abstract This paper develops a model of a condition-based maintenance policy for a two-component system with both stochastic and economic dependencies. The stochastic dependency is such that the degradation rate of each component depends not only on its own state (degradation level) but also on the state of the other component. The economic dependency is such that combining multiple maintenance activities has lower cost than performing maintenance on components separately. To select a component or components to be preventively maintained, adaptive preventive maintenance and opportunistic maintenance rules are proposed. A cost model is developed to find the optimal values of decision variables. A case study of a gearbox system demonstrates the utility of the proposed model. [ABSTRACT FROM AUTHOR]

Abstract In this paper, we consider discontinuous sub-elliptic systems with VMO-coefficients for the controllable growth case of p ≥ 2 in the Heisenberg group. Based on a generalization of the technique of A -harmonic approximation with the superquadratic growth case, a partial Hölder continuity result for weak solutions of discontinuous sub-elliptic systems with VMO-coefficients is established. In particular, the primary model covered by our analysis is the non-degenerate p -sub-Laplace system involving super-quadratic controllable growth terms. [ABSTRACT FROM AUTHOR]

Abstract In this paper we study the small data scattering of Hartree type semirelativistic equation in space dimension 3. The Hartree type nonlinearity is [ V ∗ | u | 2 ] u and the potential V which generalizes the Yukawa has some growth condition. We show that the solution scatters to linear solution if an initial data given in H s , 1 is sufficiently small and s > 1 4. Here, H s , 1 is Sobolev type space taking in angular regularity with norm defined by ‖ φ ‖ H s , 1 = ‖ φ ‖ H s + ‖ ∇ S φ ‖ H s . To establish the results we employ the recently developed Strichartz estimate which is L θ 2 -averaged on the unit sphere S 2 and construct the resolution space based on U p - V p space. [ABSTRACT FROM AUTHOR]

Abstract In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, f n : { − 1 , 1 } n → { − 1 , 1 } were introduced. We continue their study of how these definitions relate to noise stability and noise sensitivity. Our main results are that the set of volatile sequences of Boolean functions is a natural way "dense" in the set of all sequences of Boolean functions, and that the set of non-volatile Boolean sequences is not "dense" in the set of noise stable sequences of Boolean functions. [ABSTRACT FROM AUTHOR]

Abstract We consider branching processes consisting of particles (individuals) of two types (type L and type S) in which only particles of type L have offspring, proving estimates for the survival probability and the (tail of) the distribution of the total number of particles. Such processes are in some sense closer to single- than to multi-type branching processes. Nonetheless, the second, barren, type complicates the analysis significantly. The results proved here (about point and survival probabilities) are a key ingredient in the analysis of bounded-size Achlioptas processes in a recent paper by the last two authors. [ABSTRACT FROM AUTHOR]

Abstract We study Vaught's problem for weakly o-minimal theories of convexity rank 1. We investigate such theories having less than 2 ω countable models and prove their binarity. The main result of the paper is a description of the countable spectrum of weakly o-minimal theories of convexity rank 1. [ABSTRACT FROM AUTHOR]

Abstract This article is a survey paper on solving spacecraft trajectory optimization problems. The solving process is decomposed into four key steps of mathematical modeling of the problem, defining the objective functions, development of an approach and obtaining the solution of the problem. Several subcategories for each step have been identified and described. Subsequently, important classifications and their characteristics have been discussed for solving the problems. Finally, a discussion on how to choose an element of each step for a given problem is provided. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the dynamics of a non-autonomous dynamical system ( X , F ) generated by a uniformly convergent sequence of continuous self maps on X . We relate the dynamical behavior of ( X , F ) with the dynamical behavior of the limiting system (and vice versa). In the process, we relate properties like equicontinuity, minimality, various forms of mixing and sensitivities, dense periodicity and denseness of proximal pairs (cells) for the two systems. We also give examples to investigate the necessity of the conditions imposed. [ABSTRACT FROM AUTHOR]

It is known that the pass move is not an unknotting operation in classical knot theory. In this paper, we prove that the pass move is an unknotting operation in welded knot theory. [ABSTRACT FROM AUTHOR]

In this paper, we introduce obnoxious effects into obnoxious facility location games on a line, where each agent i has a private location x i on a closed interval [ 0 , 1 ] and one facility will be built on a location y in the interval according to the bids of all the agents. In addition, there are two thresholds d 1 and d 2 in the utility function of each agent, where 0 ≤ d 1 ≤ d 2 ≤ 1 . Denote d ( y , x i ) = | y − x i | to be the distance between agent i and the facility on the location y . The utility function of agent i is 0 if d ( y , x i ) is at most d 1 ; 1 if d ( y , x i ) is at least d 2 ; otherwise a linear increasing function between 0 and 1. Each agent attempts to get the largest utility while the social welfare is to maximize the sum of all the agents' utilities. The classic obnoxious facility game [4,11] is a special case of our problem when d 1 = 0 and d 2 = 1 . In this work, we first study the hardness of approximate mechanism design on this generalized problem, which states that our problem cannot admit any deterministic strategy-proof mechanism with bounded approximation ratio if d 1 ≥ 1 2 . Then we limit the thresholds to some ranges, both deterministic and randomized strategy-proof mechanisms are studied, and the approximation ratios vary with the specific values of d 1 and d 2 . [ABSTRACT FROM AUTHOR]

A continuum X is said to be semi-Kelley provided that for each subcontinuum K and for every two maximal limit continua M and L in K either M ⊂ L or L ⊂ M . In this paper we show that the property of being semi-Kelley is a sequentially strong Whitney-reversible property, with this result we obtain that the property of being semi-Kelley is a Whitney-reversible property, answering a question posed by A. Illanes in [2] . Moreover, we generalize the Charatonik's Theorem ( [4, p. 83, 4.5] ) and we prove a version of this theorem on n -fold Symmetric Product. [ABSTRACT FROM AUTHOR]

Let X and Y be metric continua. We consider the following property (*): if M is a subcontinuum of X × Y such that π X ( M ) = X and π Y ( M ) = Y , where π X and π Y are the respective projections on X and Y , then M has small connected neighborhoods in X × Y . Property (*) has been studied by D. P. Bellamy, J. M. Łysko and the first named author. In this paper we continue studying property (*) in products of continua. We prove: (a) the product of homogeneous continua having the fixed point property has property (*); (b) the product of a solenoid and any Knaster continuum has property (*); (c) there exists a Kelley continuum X such that X × [ 0 , 1 ] does not have property (*); and (d) the product of a chainable Kelley continuum and [ 0 , 1 ] has property (*). [ABSTRACT FROM AUTHOR]