Efficient fair conjunction for structurally-recursive relations

2020 ◽  
Author(s):  
Peter Lozov ◽  
Dmitry Boulytchev
Keyword(s):  
Recursive Relations

State Estimation Using Randomly Delayed Measurements

1993 ◽  
Vol 115 (1) ◽  
pp. 19-26 ◽  
Author(s):  
A. Ray ◽  
L. W. Liou ◽  
J. H. Shen
Keyword(s):  
State Estimation ◽  
Minimum Variance ◽  
The State ◽  
Sensor Data ◽  
State Estimator ◽  
Uniform Asymptotic Stability ◽  
Simulation Experiments ◽  
State Estimate ◽  
Sampling Instant ◽  
Recursive Relations

This paper presents a modification of the conventional minimum variance state estimator to accommodate the effects of randomly varying delays in arrival of sensor data at the controller terminal. In this approach, the currently available sensor data is used at each sampling instant to obtain the state estimate which, in turn, can be used to generate the control signal. Recursive relations for the filter dynamics have been derived, and the conditions for uniform asymptotic stability of the filter have been conjectured. Results of simulation experiments using a flight dynamic model of advanced aircraft are presented for performance evaluation of the state estimation filter.

scholarly journals Recursive relations for a quiver gauge theory

2006 ◽  
Vol 2006 (10) ◽  
pp. 026-026 ◽  
Author(s):  
Jaemo Park ◽  
Woojoo Sim
Keyword(s):  
Gauge Theory ◽  
Quiver Gauge Theory ◽  
Recursive Relations

scholarly journals Mean Hitting Time for Random Walks on a Class of Sparse Networks

Entropy ◽  
2021 ◽  
Vol 24 (1) ◽  
pp. 34
Author(s):  
Jing Su ◽  
Xiaomin Wang ◽  
Bing Yao
Keyword(s):  
Random Walks ◽  
Complete Graph ◽  
Hitting Time ◽  
Electrical Networks ◽  
Kirchhoff Index ◽  
Scale Free ◽  
Closed Form Solutions ◽  
Sparse Networks ◽  
Similar Dynamic ◽  
Recursive Relations

For random walks on a complex network, the configuration of a network that provides optimal or suboptimal navigation efficiency is meaningful research. It has been proven that a complete graph has the exact minimal mean hitting time, which grows linearly with the network order. In this paper, we present a class of sparse networks G(t) in view of a graphic operation, which have a similar dynamic process with the complete graph; however, their topological properties are different. We capture that G(t) has a remarkable scale-free nature that exists in most real networks and give the recursive relations of several related matrices for the studied network. According to the connections between random walks and electrical networks, three types of graph invariants are calculated, including regular Kirchhoff index, M-Kirchhoff index and A-Kirchhoff index. We derive the closed-form solutions for the mean hitting time of G(t), and our results show that the dominant scaling of which exhibits the same behavior as that of a complete graph. The result could be considered when designing networks with high navigation efficiency.

scholarly journals Ruin Probabilities in a Finite-Horizon Risk Model with Investment and Reinsurance

2012 ◽  
Vol 49 (04) ◽  
pp. 954-966
Author(s):  
R. Romera ◽  
W. Runggaldier
Keyword(s):  
Financial Market ◽  
Continuous Time ◽  
Ruin Probability ◽  
Risk Model ◽  
Finite Horizon ◽  
Ruin Probabilities ◽  
Optimal Solutions ◽  
Semi Markov Process ◽  
Insurance Model ◽  
Recursive Relations

A finite-horizon insurance model is studied where the risk/reserve process can be controlled by reinsurance and investment in the financial market. Our setting is innovative in the sense that we describe in a unified way the timing of the events, that is, the arrivals of claims and the changes of the prices in the financial market, by means of a continuous-time semi-Markov process which appears to be more realistic than, say, classical diffusion-based models. Obtaining explicit optimal solutions for the minimizing ruin probability is a difficult task. Therefore we derive a specific methodology, based on recursive relations for the ruin probability, to obtain a reinsurance and investment policy that minimizes an exponential bound (Lundberg-type bound) on the ruin probability.

scholarly journals Ruin Probabilities in a Finite-Horizon Risk Model with Investment and Reinsurance

2012 ◽  
Vol 49 (4) ◽  
pp. 954-966 ◽  
Author(s):  
R. Romera ◽  
W. Runggaldier
Keyword(s):  
Financial Market ◽  
Continuous Time ◽  
Ruin Probability ◽  
Risk Model ◽  
Finite Horizon ◽  
Ruin Probabilities ◽  
Optimal Solutions ◽  
Semi Markov Process ◽  
Insurance Model ◽  
Recursive Relations

A finite-horizon insurance model is studied where the risk/reserve process can be controlled by reinsurance and investment in the financial market. Our setting is innovative in the sense that we describe in a unified way the timing of the events, that is, the arrivals of claims and the changes of the prices in the financial market, by means of a continuous-time semi-Markov process which appears to be more realistic than, say, classical diffusion-based models. Obtaining explicit optimal solutions for the minimizing ruin probability is a difficult task. Therefore we derive a specific methodology, based on recursive relations for the ruin probability, to obtain a reinsurance and investment policy that minimizes an exponential bound (Lundberg-type bound) on the ruin probability.

scholarly journals New Technologies of the Observer: #BringBack, Visualization and Disappearance

2017 ◽  
Vol 34 (7-8) ◽  
pp. 51-74 ◽  
Author(s):  
Sophie Day ◽  
Celia Lury
Keyword(s):  
Traffic Control ◽  
Air Traffic Control ◽  
New Technologies ◽  
Air Traffic ◽  
Kuala Lumpur ◽  
Recursive Relations

This article explores two examples of non-visibility as a way of describing the specificity of contemporary surfaces of visualization. The two cases are the disappearance of Malaysia Airlines Flight 370, the scheduled passenger flight from Kuala Lumpur to Beijing, which lost contact with air traffic control on 8 March 2014 at 01:20 MYT, and the 276 Nigerian girls who went ‘missing’ at about the same time. The analysis is developed through an exploration of these examples in terms of the patterning of vision produced in recursive relations, or relations of feedback with the environment. We argue that changes in the organization of this feedback, which we describe as ‘rendition’, equip contemporary observers with both the capacity to see ‘close up at a distance’ and the capacity to be situated adjacent, next to or ‘beside from above’.

The Values of Modular Functions and Modular Forms

2006 ◽  
Vol 49 (4) ◽  
pp. 526-535 ◽  
Author(s):  
So Young Choi
Keyword(s):  
Modular Form ◽  
Half Plane ◽  
Finite Index ◽  
Modular Forms ◽  
Fuchsian Group ◽  
Modular Functions ◽  
Genus Zero ◽  
Recursive Formulas ◽  
Upper Half Plane ◽  
Recursive Relations

AbstractLet Γ0 be a Fuchsian group of the first kind of genus zero and Γ be a subgroup of Γ0 of finite index of genus zero. We find universal recursive relations giving the qr-series coefficients of j0 by using those of the qhs -series of j, where j is the canonical Hauptmodul for Γ and j0 is a Hauptmodul for Γ0 without zeros on the complex upper half plane (here qℓ := e2πiz/ℓ). We find universal recursive formulas for q-series coefficients of any modular form on in terms of those of the canonical Hauptmodul .

Sign in / Sign up

Export Citation Format

Share Document