propagation function
Recently Published Documents


TOTAL DOCUMENTS

44
(FIVE YEARS 10)

H-INDEX

8
(FIVE YEARS 0)

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Gengxin Sun ◽  
Chih-Cheng Chen

Most of the existing influence maximization algorithms are not suitable for large-scale social networks due to their high time complexity or limited influence propagation range. Therefore, a D-RIS (dynamic-reverse reachable set) influence maximization algorithm is proposed based on the independent cascade model and combined with the reverse reachable set sampling. Under the premise that the influence propagation function satisfies monotonicity and submodularity, the D-RIS algorithm uses an automatic debugging method to determine the critical value of the number of reverse reachable sets, which not only obtains a better influence propagation range but also greatly reduces the time complexity. The experimental results on the two real datasets of Slashdot and Epinions show that D-RIS algorithm is close to the CELF (cost-effective lazy-forward) algorithm and higher than RIS algorithm, HighDegree algorithm, LIR algorithm, and pBmH (population-based metaheuristics) algorithm in influence propagation range. At the same time, it is significantly better than the CELF algorithm and RIS algorithm in running time, which indicates that D-RIS algorithm is more suitable for large-scale social network.


PLoS ONE ◽  
2021 ◽  
Vol 16 (6) ◽  
pp. e0252346
Author(s):  
Dominik Müller ◽  
Thorben Klamt ◽  
Lara Gentemann ◽  
Alexander Heisterkamp ◽  
Stefan Michael Klaus Kalies

Whereas it is evident that a well aligned and regular sarcomeric structure in cardiomyocytes is vital for heart function, considerably less is known about the contribution of individual elements to the mechanics of the entire cell. For instance, it is unclear whether altered Z-disc elements are the reason or the outcome of related cardiomyopathies. Therefore, it is crucial to gain more insight into this cellular organization. This study utilizes femtosecond laser-based nanosurgery to better understand sarcomeres and their repair upon damage. We investigated the influence of the extent and the location of the Z-disc damage. A single, three, five or ten Z-disc ablations were performed in neonatal rat cardiomyocytes. We employed image-based analysis using a self-written software together with different already published algorithms. We observed that cardiomyocyte survival associated with the damage extent, but not with the cell area or the total number of Z-discs per cell. The cell survival is independent of the damage position and can be compensated. However, the sarcomere alignment/orientation is changing over time after ablation. The contraction time is also independent of the extent of damage for the tested parameters. Additionally, we observed shortening rates between 6–7% of the initial sarcomere length in laser treated cardiomyocytes. This rate is an important indicator for force generation in myocytes. In conclusion, femtosecond laser-based nanosurgery together with image-based sarcomere tracking is a powerful tool to better understand the Z-disc complex and its force propagation function and role in cellular mechanisms.


Author(s):  
Gengxin Sun ◽  
Chih-Cheng Chen

Most of the existing influence maximization algorithms are not suitable for large-scale social networks due to their high time complexity or limited influence propagation range. Therefore, a D-RIS influence maximization algorithm is proposed based on the independent cascade model and combined with the reverse reachable set sampling. Under the premise that the influence propagation function satisfies monotonicity and submodularity, the D-RIS algorithm uses automatic debugging method to determine the critical value of the number of reverse reachable sets, which not only obtains a better influence propagation range, and greatly reduce the time complexity. The experimental results on the two real data sets of Slashdot and Epinions show that D-RIS algorithm is close to the CELF algorithm and higher than RIS algorithm, HighDegree algorithm, LIR algorithm and pBmH algorithm in influence propagation range. At the same time, it is significantly better than the CELF algorithm and RIS algorithm in running time, which indicates that D-RIS algorithm is more suitable for large scale social network.


2020 ◽  
Vol 185 ◽  
pp. 01044
Author(s):  
Yue Yu ◽  
Qingyu Ge ◽  
Chongqing Jiao

A hybrid genetic algorithm and vector fitting based approach is proposed for the approximation of the propagation function of transmission lines. In this work, the process of guessing the number of poles and then adjusting corresponding delay times in the conventional method is improved by the genetic algorithm. The proposed approach can result in a better approximation of propagation function, which is proven by a successful implementation to an overhead single core coaxial cable.


2019 ◽  
Author(s):  
Jamie Nicholas Shelley

This paper and accompanying Python/C++ Framework is the product of the Authors perceived problems with narrow (Discrimination based) AI. (Artificial Intelligence) The Framework attempts to develop a genetic transfer of experience through potential structural expressions using a common regulation/exchange value (‘energy’) to create a model whereby neural architecture and all unit processes are co-dependently developed . These expressions are born from fractal definition, stochastically tuned and managed by genetic experience; successful routes are maintained through global rules: (Stability of signal propagation/function over cross functional (external state, internal immediate state, and genetic bias towards selection of previous expressions)).These principles are aimed towards creating a diverse and robust network, hopefully reducing the need for transfer learning and computationally expensive translations as demand on compute increases.


Sign in / Sign up

Export Citation Format

Share Document