scholarly journals A genus 4 origami with minimal hitting time and an intersection property

2021 ◽  
Vol -1 (-1) ◽  
Author(s):  
Luca Marchese
Keyword(s):  
Hitting Time ◽  
Intersection Property

scholarly journals TREASURE: Text Mining Algorithm Based On Affinity Analysis and Set Intersection to Find the Action of Tuberculosis Drugs against Other Pathogens

2021 ◽  
Vol 11 (15) ◽  
pp. 6834
Author(s):  
Pradeepa Sampath ◽  
Nithya Shree Sridhar ◽  
Vimal Shanmuganathan ◽  
Yangsun Lee
Keyword(s):  
Text Mining ◽  
Causes Of Death ◽  
Intersection Property ◽  
Research Papers ◽  
Bacterial Diseases ◽  
Mining Algorithm ◽  
Set Intersection ◽  
The World ◽  
Medical Researchers

Tuberculosis (TB) is one of the top causes of death in the world. Though TB is known as the world’s most infectious killer, it can be treated with a combination of TB drugs. Some of these drugs can be active against other infective agents, in addition to TB. We propose a framework called TREASURE (Text mining algoRithm basEd on Affinity analysis and Set intersection to find the action of tUberculosis dRugs against other pathogEns), which particularly focuses on the extraction of various drug–pathogen relationships in eight different TB drugs, namely pyrazinamide, moxifloxacin, ethambutol, isoniazid, rifampicin, linezolid, streptomycin and amikacin. More than 1500 research papers from PubMed are collected for each drug. The data collected for this purpose are first preprocessed, and various relation records are generated for each drug using affinity analysis. These records are then filtered based on the maximum co-occurrence value and set intersection property to obtain the required inferences. The inferences produced by this framework can help the medical researchers in finding cures for other bacterial diseases. Additionally, the analysis presented in this model can be utilized by the medical experts in their disease and drug experiments.

PROPER ACTIONS ON SOME EXPONENTIAL SOLVABLE HOMOGENEOUS SPACES

2005 ◽  
Vol 16 (09) ◽  
pp. 941-955 ◽  
Author(s):  
ALI BAKLOUTI ◽  
FATMA KHLIF
Keyword(s):  
Maximal Subgroup ◽  
Homogeneous Space ◽  
Lie Group ◽  
Homogeneous Spaces ◽  
Intersection Property ◽  
Nilpotent Lie Group ◽  
Proper Actions ◽  
Simply Connected

Let G be a connected, simply connected nilpotent Lie group, H and K be connected subgroups of G. We show in this paper that the action of K on X = G/H is proper if and only if the triple (G,H,K) has the compact intersection property in both cases where G is at most three-step and where G is special, extending then earlier cases. The result is also proved for exponential homogeneous space on which acts a maximal subgroup.

scholarly journals Randomization in the first hitting time problem

2009 ◽  
Vol 79 (23) ◽  
pp. 2422-2428 ◽  
Author(s):  
Ken Jackson ◽  
Alexander Kreinin ◽  
Wanhe Zhang
Keyword(s):  
Hitting Time ◽  
First Hitting Time ◽  
Time Problem

scholarly journals Birkhoff periodic orbits for twist maps with the graph intersection property

1985 ◽  
Vol 5 (4) ◽  
pp. 531-537 ◽  
Author(s):  
David Bernstein
Keyword(s):  
Periodic Orbits ◽  
Intersection Property ◽  
Twist Maps

AbstractIn this paper we show that Birkhoff periodic orbits actually exist for arbitrary monotone twist maps satisfying the graph intersection property.

scholarly journals The Hausdorff dimension and exact Hausdorff measure of random recursive sets with overlapping

2002 ◽  
Vol 31 (1) ◽  
pp. 11-21 ◽  
Author(s):  
Hongwen Guo ◽  
Dihe Hu
Keyword(s):  
Hausdorff Dimension ◽  
Hausdorff Measure ◽  
Intersection Property ◽  
Random Sets ◽  
Hausdorff Measures ◽  
Open Set Condition ◽  
Finite Intersection ◽  
Open Set ◽  
Finite Intersection Property

We weaken the open set condition and define a finite intersection property in the construction of the random recursive sets. We prove that this larger class of random sets are fractals in the sense of Taylor, and give conditions when these sets have positive and finite Hausdorff measures, which in certain extent generalize some of the known results, about random recursive fractals.

scholarly journals Adiabatic condition and the quantum hitting time of Markov chains

2010 ◽  
Vol 82 (2) ◽  
Author(s):  
Hari Krovi ◽  
Maris Ozols ◽  
Jérémie Roland
Keyword(s):  
Markov Chains ◽  
Hitting Time ◽  
Adiabatic Condition

Hitting time in an M/G/1 queue

1999 ◽  
Vol 36 (03) ◽  
pp. 934-940 ◽  
Author(s):  
Sheldon M. Ross ◽  
Sridhar Seshadri
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Arrival Rate ◽  
Hitting Time ◽  
Service Time Distribution ◽  
Expected Time ◽  
Efficient Simulation ◽  
Simulation Procedure ◽  
Poisson Arrival ◽  
Stationary Delay

We study the expected time for the work in an M/G/1 system to exceed the level x, given that it started out initially empty, and show that it can be expressed solely in terms of the Poisson arrival rate, the service time distribution and the stationary delay distribution of the M/G/1 system. We use this result to construct an efficient simulation procedure.

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.

Sign in / Sign up

Export Citation Format

Share Document