linear index
Recently Published Documents


TOTAL DOCUMENTS

105
(FIVE YEARS 11)

H-INDEX

16
(FIVE YEARS 1)

2020 ◽  
Vol 38 (1) ◽  
pp. 123
Author(s):  
Ruiyun Jiao ◽  
Lichao Dou ◽  
Wenqian Zhang ◽  
Kaiyun Zhan
Keyword(s):  

Computation ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 92
Author(s):  
Mario Versaci ◽  
Giovanni Angiulli ◽  
Fabio La Foresta

In this paper, we introduce a new dynamic model of simulation of electrocardiograms (ECGs) affected by pathologies starting from the well-known McSharry dynamic model for the ECGs without cardiac disorders. In particular, the McSharry model has been generalized (by a linear transformation and a rotation) for simulating ECGs affected by heart diseases verifying, from one hand, the existence and uniqueness of the solution and, on the other hand, if it admits instabilities. The results, obtained numerically by a procedure based on a Four Stage Lobatto IIIa formula, show the good performances of the proposed model in producing ECGs with or without heart diseases very similar to those achieved directly on the patients. Moreover, verified that the ECGs signals are affected by uncertainty and/or imprecision through the computation of the linear index and the fuzzy entropy index (whose values obtained are close to unity), these similarities among ECGs signals (with or without heart diseases) have been quantified by a well-established fuzzy approach based on fuzzy similarity computations highlighting that the proposed model to simulate ECGs affected by pathologies can be considered as a solid starting point for the development of synthetic pathological ECGs signals.


2020 ◽  
Vol 32 (4) ◽  
pp. 838-863
Author(s):  
Mengshan Xu ◽  
Taisuke Otsu

2020 ◽  
pp. 101-111
Author(s):  
G. Kopij

The line transect method was applied to assess the linear index of abundance and community structure of birds breeding in an area of Kalahari woodland used as range land for cattle. Four transects were designed along roads traversing the ranch. Each transect was 2.5 km long and was surveyed three times in 2014 and 2015. A total of 47 bird species were recorded but only 25-31 species were recorded on any particular transect. In the neighbouring pristine Kalahari woodland, the number of bird species on a12 km long transect was much higher (n = 88), and ranged in some sections (each 1.2 km in length) from 35 to 53. On any particular section, the number of dominant species ranged from 5 to 7, and their cumulative dominance on each section was similar, ranging from 53-56 %, while the community dominance index ranged from 0.23 to 0.35. The most numerous species were the Cape turtle dove and emerald-spotted wood dove, which were dominant on all sections. Together they comprised 28 % of all breeding birds. The avian community in the Kalahari woodland in Sachinga LDC did not differ from the neighbouring pristine woodland either in terms of species diversity or evenness. However, it differed significantly in terms of species richness, the proportion of main ecological guilds, and linear index of abundance of particular species. These differences could be mainly due to the structure of woody vegetation, which is much thicker in Sachinga than in the pristine woodland not used as pasture for cattle. The thickening of this vegetation on the ranch could have been caused by heavy grazing pressure by the cattle. Data published through GBIF (Doi: https://doi.org/10.15470/rova7r)


Entropy ◽  
2020 ◽  
Vol 22 (6) ◽  
pp. 646
Author(s):  
Anoop Thomas ◽  
Balaji Sundar Rajan

The connections between index coding and matroid theory have been well studied in the recent past. Index coding solutions were first connected to multi linear representation of matroids. For vector linear index codes, discrete polymatroids, which can be viewed as a generalization of the matroids, were used. The index coding problem has been generalized recently to accommodate receivers that demand functions of messages and possess functions of messages. In this work we explore the connections between generalized index coding and discrete polymatroids. The conditions that need to be satisfied by a representable discrete polymatroid for a generalized index coding problem to have a vector linear solution is established. From a discrete polymatroid, an index coding problem with coded side information is constructed and it is shown that if the index coding problem has a certain optimal length solution then the discrete polymatroid is representable. If the generalized index coding problem is constructed from a matroid, it is shown that the index coding problem has a binary scalar linear solution of optimal length if and only if the matroid is binary representable.


Author(s):  
Kaiyun Zhan ◽  
Jing Wang ◽  
Zhendong Yang ◽  
Ruiyun Jiao ◽  
Bing Liu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document