scholarly journals Recovery Failure Probability of Power-Based NOMA on the Uplink of a 5G Cell for an Arbitrary Number of Superimposed Signals

2018 ◽  
Author(s):  
Maria Luisa Merani
Keyword(s):  
Failure Probability ◽  
Arbitrary Number ◽  
Superimposed Signals

Kinematic analysis and deformation of a planar lattice with an arbitrary number of panels

2020 ◽  
pp. 15-19
Author(s):  
M.N. Kirsanov
Keyword(s):  
Exact Solution ◽  
Kinematic Analysis ◽  
Arbitrary Number ◽  
Design Parameters ◽  
Lattice Deformation ◽  
Planar Lattice ◽  
Force Loading

Formulae are obtained for calculating the deformations of a statically determinate lattice under the action of two types of loads in its plane, depending on the number of panels located along one side of the lattice. Two options for fixing the lattice are analyzed. Cases of kinematic variability of the structure are found. The distribution of forces in the rods of the lattice is shown. The dependences of the force loading of some rods on the design parameters are obtained. Keywords: truss, lattice, deformation, exact solution, deflection, induction, Maple system. [email protected]

Recent advances on urban taxi sharing systems with the path arrival probability

2020 ◽  
Vol 13 ◽  
Author(s):  
Dui Hongyan ◽  
Zhang Chi
Keyword(s):  
Failure Probability ◽  
Traffic Congestion ◽  
Optimal Strategy ◽  
Time Windows ◽  
Optimal Path ◽  
Route Planning ◽  
Driving Time ◽  
Load Rate ◽  
Travel Efficiency ◽  
Arrival Probability

Background : Taxi sharing is an emerging transportation arrangement that helps improve the passengers’ travel efficiency and reduce costs. This study proposes an urban taxi sharing system. Methods: Considering each side congestion of the transport network, their corresponding reliability and failure probability are analyzed. Under the constraints of the number of passengers and their own time windows, the analysis is performed on passengers whose optimal path is inclusive. Results: According to the optimal strategy, the different passengers can be arranged into the same taxi to realize the taxi sharing. Then the shared taxi route can be optimized. Conclusion: Due to the reasonable vehicle route planning and passenger combination, these can effectively alleviate the traffic congestion, save the driving time, reduce the taxi no-load rate, and save the driving distance. At last, a numerical example is used to demonstrate the proposed method.

scholarly journals Development of fragility curves for railway ballast and embankment scour due to overtopping flood flow

2016 ◽  
Author(s):  
Ryota Tsubaki ◽  
Koji Ichii ◽  
Jeremy D. Bricker ◽  
Yoshihisa Kawahara
Keyword(s):  
Spatial Distribution ◽  
Failure Probability ◽  
Fragility Curves ◽  
Railway Track ◽  
Single Track ◽  
Hydraulic Analysis ◽  
Railway Ballast ◽  
Log Normal ◽  
Flood Flow

Abstract. Fragility curves evaluating risk of railway track ballast and embankment fill scour were developed. To develop fragility curves, two well-documented single-track railway washouts during two recent floods in Japan were investigated. Type of damage to the railway was categorized into no damage, ballast scour, and embankment scour, in order of damage severity. Railway overtopping surcharge for each event was estimated via hydrologic and hydraulic analysis. Normal and log-normal fragility curves were developed based on failure probability derived from field records. A combined ballast and embankment scour model was validated by comparing the spatial distribution of railway scour with the field damage record.

The inverse problem of recovering the coefficients of a differential equations on a graph

2020 ◽  
Vol 28 (5) ◽  
pp. 727-738
Author(s):  
Victor Sadovnichii ◽  
Yaudat Talgatovich Sultanaev ◽  
Azamat Akhtyamov
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Differential Equations ◽  
Boundary Value Problem ◽  
Boundary Conditions ◽  
Finite Number ◽  
Characteristic Equation ◽  
Arbitrary Number ◽  
New Class ◽  
Finite Set

AbstractWe consider a new class of inverse problems on the recovery of the coefficients of differential equations from a finite set of eigenvalues of a boundary value problem with unseparated boundary conditions. A finite number of eigenvalues is possible only for problems in which the roots of the characteristic equation are multiple. The article describes solutions to such a problem for equations of the second, third, and fourth orders on a graph with three, four, and five edges. The inverse problem with an arbitrary number of edges is solved similarly.

scholarly journals Free fermions, vertex Hamiltonians, and lower-dimensional AdS/CFT

2021 ◽  
Vol 2021 (2) ◽  
Author(s):  
Marius de Leeuw ◽  
Chiara Paletta ◽  
Anton Pribytok ◽  
Ana L. Retore ◽  
Alessandro Torrielli
Keyword(s):  
Spectral Problem ◽  
Transfer Matrix ◽  
Arbitrary Number ◽  
Free Fermion ◽  
Nearest Neighbour ◽  
Bogoliubov Transformation ◽  
Free Fermions ◽  
New Models ◽  
Lower Dimensional

Abstract In this paper we first demonstrate explicitly that the new models of integrable nearest-neighbour Hamiltonians recently introduced in PRL 125 (2020) 031604 [36] satisfy the so-called free fermion condition. This both implies that all these models are amenable to reformulations as free fermion theories, and establishes the universality of this condition. We explicitly recast the transfer matrix in free fermion form for arbitrary number of sites in the 6-vertex sector, and on two sites in the 8-vertex sector, using a Bogoliubov transformation. We then put this observation to use in lower-dimensional instances of AdS/CFT integrable R-matrices, specifically pure Ramond-Ramond massless and massive AdS3, mixed-flux relativistic AdS3 and massless AdS2. We also attack the class of models akin to AdS5 with our free fermion machinery. In all cases we use the free fermion realisation to greatly simplify and reinterpret a wealth of known results, and to provide a very suggestive reformulation of the spectral problem in all these situations.

scholarly journals Language Family Engineering with Product Lines of Multi-level Models

2021 ◽  
Author(s):  
Juan de Lara ◽  
Esther Guerra
Keyword(s):  
Software Engineering ◽  
Arbitrary Number ◽  
Formal Theory ◽  
The Other ◽  
Language Family ◽  
Top Down ◽  
Product Lines ◽  
Modelling Languages ◽  
Multi Level ◽  
Definition Of

AbstractModelling is an essential activity in software engineering. It typically involves two meta-levels: one includes meta-models that describe modelling languages, and the other contains models built by instantiating those meta-models. Multi-level modelling generalizes this approach by allowing models to span an arbitrary number of meta-levels. A scenario that profits from multi-level modelling is the definition of language families that can be specialized (e.g., for different domains) by successive refinements at subsequent meta-levels, hence promoting language reuse. This enables an open set of variability options given by all possible specializations of the language family. However, multi-level modelling lacks the ability to express closed variability regarding the availability of language primitives or the possibility to opt between alternative primitive realizations. This limits the reuse opportunities of a language family. To improve this situation, we propose a novel combination of product lines with multi-level modelling to cover both open and closed variability. Our proposal is backed by a formal theory that guarantees correctness, enables top-down and bottom-up language variability design, and is implemented atop the MetaDepth multi-level modelling tool.

Sign in / Sign up

Export Citation Format

Share Document