Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sisi Fan

dblp:185/8093 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
moment closure approximation
0.212016
MEANS: python package for Moment Expansion Approximation, iNference and Simulation · Bioinform. 2016
Bioinformatics and computational biology › systems biology › biochemical reaction network modeling
biochemical network simulation
0.112016
MEANS: python package for Moment Expansion Approximation, iNference and Simulation · Bioinform. 2016

Methods — techniques the papers use, named apart from their topics

parametric moment closure · 0.2moment expansion approximation · 0.2
YearPublicationVenuePosition
2018 Coverage Control of Sensor Networks in IoT Based on RPSO
abstract
In this paper, we proposed a novel method to solve the coverage control problem of sensor networks in the Internet of Things (IoT). The coverage control is an important index to evaluate the performance of network services. Ensuring the quality of network services, it is mainly to maximize the coverage of the network and minimize the energy consumption at the same time for the purpose of extending the network life cycle effect. Because of the overlay redundancy, it adopts the sleeping scheduling mechanism of nodes. The optimal solution is obtained after utilizing the coverage rate and the node sleep rate as the optimization objective function. Particle swarm optimization (PSO) is a group intelligent optimization algorithm. In practical applications, PSO often convergence in the local optimal solution prematurely. In order to balance the global search ability and convergence speed of PSO, We have improved the PSO based on the resampling technique, named resampled PSO (RPSO). The RPSO can not only maintain the diversity of the population, which can avoid premature convergence of the algorithm to some extent, but also ensure that each particle is active, reducing the calculation of redundancy, thereby improving the efficiency of the algorithm. The experimental results show that the RPSO can deal with complex multipeak optimization problem efficiently and reliably. Then the RPSO is used to solve the coverage control problem of sensor networks in IoT and has a great performance.
Xiaohui Wang 0003, Hao Zhang 0044, Sisi Fan, Haoran Gu
IEEE Internet Things J.3
2016 MEANS: python package for Moment Expansion Approximation, iNference and Simulation
abstract
MOTIVATION: Many biochemical systems require stochastic descriptions. Unfortunately these can only be solved for the simplest cases and their direct simulation can become prohibitively expensive, precluding thorough analysis. As an alternative, moment closure approximation methods generate equations for the time-evolution of the system's moments and apply a closure ansatz to obtain a closed set of differential equations; that can become the basis for the deterministic analysis of the moments of the outputs of stochastic systems. RESULTS: We present a free, user-friendly tool implementing an efficient moment expansion approximation with parametric closures that integrates well with the IPython interactive environment. Our package enables the analysis of complex stochastic systems without any constraints on the number of species and moments studied and the type of rate laws in the system. In addition to the approximation method our package provides numerous tools to help non-expert users in stochastic analysis. AVAILABILITY AND IMPLEMENTATION: https://github.com/theosysbio/means CONTACTS: [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Sisi Fan, Quentin Geissmann, Eszter Lakatos, Saulius Lukauskas, Angelique Ale, Ann C. Babtie, Paul D. W. Kirk, Michael P. H. Stumpf
Bioinform.1