A path planning approach for crowd evacuation in buildings based on improved artificial bee colony algorithm

Liu, Hong; Xu, Bin; Lu, Dianjie; Zhang, Guijuan

doi:10.1016/j.asoc.2018.04.015

Cited by 211 publications

(89 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Eq. (19) can also be solved by the algorithm proposed in (Huang et al, 2015;Liu et al, 2018a). The optimization for w L could be derived in a similar way.…”

Section: Optimizationmentioning

confidence: 99%

Multiview Consensus Graph Learning for lncRNA–Disease Association Prediction

Tan

Sun

et al. 2020

Front. Genet.

View full text Add to dashboard Cite

Long noncoding RNAs (lncRNAs) are a class of noncoding RNA molecules longer than 200 nucleotides. Recent studies have uncovered their functional roles in diverse cellular processes and tumorigenesis. Therefore, identifying novel disease-related lncRNAs might deepen our understanding of disease etiology. However, due to the relatively small number of verified associations between lncRNAs and diseases, it remains a challenging task to reliably and effectively predict the associated lncRNAs for given diseases. In this paper, we propose a novel multiview consensus graph learning method to infer potential disease-related lncRNAs. Specifically, we first construct a set of similarity matrices for lncRNAs and diseases by taking advantage of the known associations. We then iteratively learn a consensus graph from the multiple input matrices and simultaneously optimize the predicted association probability based on a multi-label learning framework. To convey the utility of our method, three state-of-the-art methods are compared with our method on three widely used datasets. The experiment results illustrate that our method could obtain the best prediction performance under different cross validation schemes. The case study analysis implemented for uterine cervical neoplasms further confirmed the utility of our method in identifying lncRNAs as potential prognostic biomarkers in practice.

show abstract

“…Eq. (19) can also be solved by the algorithm proposed in (Huang et al, 2015;Liu et al, 2018a). The optimization for w L could be derived in a similar way.…”

Section: Optimizationmentioning

confidence: 99%

Multiview Consensus Graph Learning for lncRNA–Disease Association Prediction

Tan

Sun

et al. 2020

Front. Genet.

View full text Add to dashboard Cite

show abstract

“…Considering the credible interaction, An et al focus on assigning the crowdsourcing sensing tasks [12]. In the field of environmental monitoring, a path planning approach is introduced for crowd evacuation in buildings [13]. Besides, there are some related researches on E-healthcare service for the crowdsourcing IoT and crowdsourcing industrial-IoT (IIoT) applications [14,15].…”

Section: Related Workmentioning

confidence: 99%

Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing

Zhai

Wang

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Mobile crowdsourcing takes advantage of mobile devices such as smart phones and tablets to process data for a lot of applications (e.g., geotagging for mobile touring guiding monitoring and spectrum sensing). In this paper, we propose a mobile crowdsourcing paradigm to make a task requester exploit encountered mobile workers for high-quality results. Since a task may be too complex for a single worker, it is necessary for a task requester to divide a complex task into several parts so that a mobile worker can nish a part of the task easily. We describe the task crowdsourcing process and propose the worker arrival model and task model. Furthermore, the probability that all parts of the complicated task are executed by mobile workers is introduced to evaluate the result of task crowdsourcing. Based on these models, considering computing capacity and rewards for mobile workers, we formulate a task partition problem to maximize the introduced probability which is used to evaluate the result of task crowdsourcing. en, using a Markov chain, a task partition policy is designed for the task requester to realize high-quality mobile crowdsourcing. With this task partition policy, the task requester is able to divide the complicated task into precise number of parts based on mobile workers' arrival, and the probability that the total parts are executed by mobile workers is maximized. Also, the invalid number of task assignment attempts is analyzed accurately, which is helpful to evaluate the resource consumption of requesters due to probing potential workers. Simulations show that our task partition policy improves the results of task crowdsourcing.

show abstract

“…Ordinary differential equations (ODEs)

y^{'} = f (x, y),

with

x \in double-struckR

y \in {double-struckR}^{m}

and

f : double-struckR \to {double-struckR}^{m}

, describe various problems (and in consequence can be applied) in social networks, neurocomputing, computational intelligence, or even image coding…”

Section: Introductionmentioning

confidence: 99%

“…Ordinary differential equations (ODEs) ′ = (x, ), with x ∈ R, ∈ R m and ∶ R → R m , describe various problems (and in consequence can be applied) in social networks, 1,2 neurocomputing, 3 computational intelligence, 4,5 or even image coding. 6 An interesting variant of ODEs is the general class of second order initial value problems:…”

Section: Introductionmentioning

confidence: 99%

Ninth‐order, explicit, two‐step methods for second‐order inhomogeneous linear IVPs

2020

View full text Add to dashboard Cite

In the present paper, the second‐order linear inhomogeneous initial value problems (LI‐IVP) with constant coefficients is of our interest. Two‐step hybrid methods (ie, of Numerov‐type) are considered for addressing this problem. Thus, a special set of order conditions is given and solved for derivation a low cost new method. Actually, we manage to save two stages per step. This is crucial as shown in various numerical tests where our new proposal outperforms standard methods in the relevant literature.

show abstract

A path planning approach for crowd evacuation in buildings based on improved artificial bee colony algorithm

Cited by 211 publications

References 44 publications

Multiview Consensus Graph Learning for lncRNA–Disease Association Prediction

Multiview Consensus Graph Learning for lncRNA–Disease Association Prediction

Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing

Ninth‐order, explicit, two‐step methods for second‐order inhomogeneous linear IVPs

Contact Info

Product

Resources

About