scholarly journals Fault-Aware Resource Allocation for Heterogeneous Data Sources with Multipath Routing

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Xiaomei Zhang ◽  
Qiang Chen ◽  
Zhicai Shi ◽  
Jianru Liang

With the rapid development of cloud computing and big data, diverse types of traffic generated from heterogeneous data sources are delivered throughout communication networks, which consist of various node kinds such as digital sensors and smart actuators, and different applications. Due to the shared medium, communication networks are vulnerable to misbehaving nodes, and it is a crucial aspect to maintain an acceptable level of service degradation. This paper studies the fault-aware resource allocation problem by exploiting multipath routing and dynamic rate assignment for heterogeneous sources. We estimate the impacts of faults and formulate the resource allocation as a lossy network flow optimization problem based on these estimates. The traditional flow optimization solutions focus on homogeneous traffic. In our work, we model the performance of heterogeneous applications as a relaxed utility function and develop an effective utility framework of rate control for heterogeneous sources with multipath routing in presence of misbehaving nodes. We design a distributed algorithm to decide the routing strategy and obtain the rate assignments on the available paths in a lossy utility fair manner. Extensive performance evaluations corroborate the significant performance of our algorithm in effective utility and utility fairness in the presence of misbehaving nodes.

2016 ◽  
Vol 53 ◽  
pp. 172-191 ◽  
Author(s):  
Eduardo M. Eisman ◽  
María Navarro ◽  
Juan Luis Castro

iScience ◽  
2021 ◽  
pp. 103298
Author(s):  
Anca Flavia Savulescu ◽  
Emmanuel Bouilhol ◽  
Nicolas Beaume ◽  
Macha Nikolski

2015 ◽  
Author(s):  
Lisa M. Breckels ◽  
Sean Holden ◽  
David Wojnar ◽  
Claire M. Mulvey ◽  
Andy Christoforou ◽  
...  

AbstractSub-cellular localisation of proteins is an essential post-translational regulatory mechanism that can be assayed using high-throughput mass spectrometry (MS). These MS-based spatial proteomics experiments enable us to pinpoint the sub-cellular distribution of thousands of proteins in a specific system under controlled conditions. Recent advances in high-throughput MS methods have yielded a plethora of experimental spatial proteomics data for the cell biology community. Yet, there are many third-party data sources, such as immunofluorescence microscopy or protein annotations and sequences, which represent a rich and vast source of complementary information. We present a unique transfer learning classification framework that utilises a nearest-neighbour or support vector machine system, to integrate heterogeneous data sources to considerably improve on the quantity and quality of sub-cellular protein assignment. We demonstrate the utility of our algorithms through evaluation of five experimental datasets, from four different species in conjunction with four different auxiliary data sources to classify proteins to tens of sub-cellular compartments with high generalisation accuracy. We further apply the method to an experiment on pluripotent mouse embryonic stem cells to classify a set of previously unknown proteins, and validate our findings against a recent high resolution map of the mouse stem cell proteome. The methodology is distributed as part of the open-source Bioconductor pRoloc suite for spatial proteomics data analysis.AbbreviationsLOPITLocalisation of Organelle Proteins by Isotope TaggingPCPProtein Correlation ProfilingMLMachine learningTLTransfer learningSVMSupport vector machinePCAPrincipal component analysisGOGene OntologyCCCellular compartmentiTRAQIsobaric tags for relative and absolute quantitationTMTTandem mass tagsMSMass spectrometry


2018 ◽  
Vol 42 (1) ◽  
pp. 39-61 ◽  
Author(s):  
Marko Gulić ◽  
Marin Vuković

Ontology matching plays an important role in the integration of heterogeneous data sources that are described by ontologies. In order to determine correspondences between ontologies, a set of matchers can be used. After the execution of these matchers and the aggregation of the results obtained by these matchers, a final alignment method is executed in order to select appropriate correspondences between entities of compared ontologies. The final alignment method is an important part of the ontology matching process because it directly determines the output result of this process. In this paper we improve our iterative final alignment method by introducing an automatic adjustment of final alignment threshold as well as a new rule for determining false correspondences with similarity values greater than adjusted threshold. An evaluation of the method is performed on the test ontologies of the OAEI evaluation contest and a comparison with other final alignment methods is given.


Sign in / Sign up

Export Citation Format

Share Document