中文
相关论文

相关论文: Allowed patterns of symmetric tent maps via commut…

200 篇论文

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

组合数学 · 数学 2012-08-29 Guillem Perarnau

Commuting operations greatly simplify consistency in distributed systems. This paper focuses on designing for commutativity, a topic neglected previously. We show that the replicas of \emph{any} data type for which concurrent operations…

分布式、并行与集群计算 · 计算机科学 2009-09-29 Marc Shapiro , Nuno Preguiça

We propose a macroscopic traffic network flow model suitable for analysis as a dynamical system, and we qualitatively analyze equilibrium flows as well as convergence. Flows at a junction are determined by downstream supply of capacity as…

系统与控制 · 计算机科学 2015-05-25 Samuel Coogan , Murat Arcak

We show how random feature maps can be used to forecast dynamical systems with excellent forecasting skill. We consider the tanh activation function and judiciously choose the internal weights in a data-driven manner such that the resulting…

机器学习 · 计算机科学 2025-04-01 Pinak Mandal , Georg A. Gottwald

This paper presents a systematic approach for analyzing the departure-time choice equilibrium (DTCE) problem of a single bottleneck with heterogeneous commuters. The approach is based on the fact that the DTCE is equivalently represented as…

最优化与控制 · 数学 2025-09-16 Takashi Akamatsu , Kentaro Wada , Takamasa Iryo , Shunsuke Hayashi

Human mobility patterns are complex and distinct from one person to another. Nevertheless, motivated by tremendous potential benefits of modeling such patterns in enabling new mobile services and technologies, researchers have attempted to…

网络与互联网体系结构 · 计算机科学 2013-07-09 Seyed Kaveh Fayazbakhsh

Lattice-based random walk models are widely used to study populations of migrating cells with motility bias and proliferation. Crowding is typically represented by volume exclusion, where each lattice site can be occupied by at most one…

种群与进化 · 定量生物学 2026-01-28 Michael J. Plank , Matthew J. Simpson

One of the challenges to reduce the gap between the machine and the human level driving is how to endow the system with the learning capacity to deal with the coupled complexity of environments, intentions, and dynamics. In this paper, we…

机器人学 · 计算机科学 2021-01-12 Yunkai Wang , Dongkun Zhang , Jingke Wang , Zexi Chen , Yue Wang , Rong Xiong

Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…

动力系统 · 数学 2014-03-07 Gregory R. Conner , Wolfram Hojka

Using the spectral subspaces obtained in [HS], Brown's results on the Brown measure of an operator in a type II_1 factor (M,tr) are generalized to finite sets of commuting operators in M. It is shown that whenever T_1,..., T_n in M are…

算子代数 · 数学 2007-05-23 Hanne Schultz

New sufficient conditions for the characterization of dwell-times for linear impulsive systems are proposed and shown to coincide with continuous decrease conditions of a certain class of looped-functionals, a recently introduced type of…

最优化与控制 · 数学 2012-06-05 Corentin Briat , Alexandre Seuret

We explore the probabilistic foundations of shared control in complex dynamic environments. In order to do this, we formulate shared control as a random process and describe the joint distribution that governs its behavior. For…

机器人学 · 计算机科学 2015-08-10 Pete Trautman

We present a way of introducing joint distibution function and its marginal distribution functions for non-compatible observables. Each such marginal distribution function has the property of commutativity. Models based on this approach can…

量子物理 · 物理学 2007-05-23 Oľga Nánásiová , Andrei Yu. Khrennikov

Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding…

组合数学 · 数学 2017-02-16 Anton Khoroshkin , Boris Shapiro

We use a simple model to extend network models for activated dynamics to a continuous landscape with a well-defined notion of distance and a direct connection to many-body systems. The model consists of a tracer in a high-dimensional funnel…

无序系统与神经网络 · 物理学 2020-05-13 Matthew R. Carbone , Valerio Astuti , Marco Baity-Jesi

We prove that for any dimension function $h$ with $h \prec x^d$ and for any countable set of linear patterns, there exists a compact set $E$ with $\mathcal{H}^h(E)>0$ avoiding all the given patterns. We also give several applications and…

经典分析与常微分方程 · 数学 2017-12-13 Alexia Yavicoli

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…

组合数学 · 数学 2019-04-26 Cunsheng Ding , Akihiro Munemasa , Vladimir Tonchev

A new functional model for pairs of commuting isometries is described. Intertwining operators between such models are then studied in order to approach the classification of invariant subspaces of such pairs.

谱理论 · 数学 2008-05-27 H. Bercovici , R. G. Douglas , C. Foias

We investigate a Cucker-Smale-type flocking model for multi-agent systems that move with constant speed. The model incorporates both kinematic observables and internal energy (temperatures) in the agents' interactions. Traditionally,…

经典分析与常微分方程 · 数学 2023-04-04 Hyunjin Ahn , Junhyeok Byeon , Seung-Yeal Ha

In this paper, we mainly study two notions of pattern avoidance in parking functions. First, for any collection of length 3 patterns, we compute the number of parking functions of size $n$ that avoid them under the first notion. This is…

组合数学 · 数学 2024-09-23 Jun Yan