scholarly journals Incentivizing for Truth Discovery in Edge-assisted Large-scale Mobile Crowdsensing

Sensors ◽  
2020 ◽  
Vol 20 (3) ◽  
pp. 805
Author(s):  
Jia Xu ◽  
Shangshu Yang ◽  
Weifeng Lu ◽  
Lijie Xu ◽  
Dejun Yang
Keyword(s):  
Large Scale ◽  
Computationally Efficient ◽  
Reverse Auction ◽  
Mobile Crowdsensing ◽  
Computing Paradigm ◽  
Truth Discovery ◽  
Estimation Precision ◽  
Discovery Stage ◽  
Budget Feasible ◽  
Great Development

The recent development of human-carried mobile devices has promoted the great development of mobile crowdsensing systems. Most existing mobile crowdsensing systems depend on the crowdsensing service of the deep cloud. With the increasing scale and complexity, there is a tendency to enhance mobile crowdsensing with the edge computing paradigm to reduce latency and computational complexity, and improve the expandability and security. In this paper, we propose an integrated solution to stimulate the strategic users to contribute more for truth discovery in the edge-assisted mobile crowdsensing. We design an incentive mechanism consisting of truth discovery stage and budget feasible reverse auction stage. In truth discovery stage, we estimate the truth for each task in both deep cloud and edge cloud. In budget feasible reverse auction stage, we design a greedy algorithm to select the winners to maximize the quality function under the budget constraint. Through extensive simulations, we demonstrate that the proposed mechanism is computationally efficient, individually rational, truthful, budget feasible and constant approximate. Moreover, the proposed mechanism shows great superiority in terms of estimation precision and expandability.

Cloud-Based Multimedia Content Protection System

2020 ◽  
pp. 164-169
Author(s):  
B. Aparna ◽  
S. Madhavi ◽  
G. Mounika ◽  
P. Avinash ◽  
S. Chakravarthi
Keyword(s):  
Large Scale ◽  
Protection System ◽  
Multimedia Content ◽  
Computationally Efficient ◽  
Content Protection ◽  
Protection Systems ◽  
Multimedia Content Protection ◽  
High Scalability ◽  
Cloud Infrastructures ◽  
Rapid Deployment

We propose a new design for large-scale multimedia content protection systems. Our design leverages cloud infrastructures to provide cost efficiency, rapid deployment, scalability, and elasticity to accommodate varying workloads. The proposed system can be used to protect different multimedia content types, including videos, images, audio clips, songs, and music clips. The system can be deployed on private and/or public clouds. Our system has two novel components: (i) method to create signatures of videos, and (ii) distributed matching engine for multimedia objects. The signature method creates robust and representative signatures of videos that capture the depth signals in these videos and it is computationally efficient to compute and compare as well as it requires small storage. The distributed matching engine achieves high scalability and it is designed to support different multimedia objects. We implemented the proposed system and deployed it on two clouds: Amazon cloud and our private cloud. Our experiments with more than 11,000 videos and 1 million images show the high accuracy and scalability of the proposed system. In addition, we compared our system to the protection system used by YouTube and our results show that the YouTube protection system fails to detect most copies of videos, while our system detects more than 98% of them.

scholarly journals GIANA allows computationally-efficient TCR clustering and multi-disease repertoire classification by isometric transformation

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Hongyi Zhang ◽  
Xiaowei Zhan ◽  
Bo Li
Keyword(s):  
T Cell ◽  
T Cell Receptor ◽  
Large Scale ◽  
Cell Receptor ◽  
Alignment Algorithm ◽  
Computationally Efficient ◽  
Antigen Specificity ◽  
Non Invasive ◽  
Isometric Transformation ◽  
Specific Receptors

AbstractSimilarity in T-cell receptor (TCR) sequences implies shared antigen specificity between receptors, and could be used to discover novel therapeutic targets. However, existing methods that cluster T-cell receptor sequences by similarity are computationally inefficient, making them impractical to use on the ever-expanding datasets of the immune repertoire. Here, we developed GIANA (Geometric Isometry-based TCR AligNment Algorithm) a computationally efficient tool for this task that provides the same level of clustering specificity as TCRdist at 600 times its speed, and without sacrificing accuracy. GIANA also allows the rapid query of large reference cohorts within minutes. Using GIANA to cluster large-scale TCR datasets provides candidate disease-specific receptors, and provides a new solution to repertoire classification. Querying unseen TCR-seq samples against an existing reference differentiates samples from patients across various cohorts associated with cancer, infectious and autoimmune disease. Our results demonstrate how GIANA could be used as the basis for a TCR-based non-invasive multi-disease diagnostic platform.

scholarly journals Parallel and Streaming Truth Discovery in Large-Scale Quantitative Crowdsourcing

2016 ◽  
Vol 27 (10) ◽  
pp. 2984-2997 ◽  
Author(s):  
Robin Wentao Ouyang ◽  
Lance M. Kaplan ◽  
Alice Toniolo ◽  
Mani Srivastava ◽  
Timothy J. Norman
Keyword(s):  
Large Scale ◽  
Truth Discovery

An Efficient Preconditioner for Linear System Solution in Multi-Domain Modeling of the Circulatory System

2013 ◽  
Author(s):  
Mahdi Esmaily Moghadam ◽  
Yuri Bazilevs ◽  
Tain-Yen Hsia ◽  
Alison Marsden
Keyword(s):  
Strong Coupling ◽  
Large Scale ◽  
Computational Cost ◽  
Circulatory System ◽  
Flow Simulation ◽  
Global Dynamics ◽  
Domain Modeling ◽  
Computationally Efficient ◽  
Lumped Parameter ◽  
System Solution

A closed-loop lumped parameter network (LPN) coupled to a 3D domain is a powerful tool that can be used to model the global dynamics of the circulatory system. Coupling a 0D LPN to a 3D CFD domain is a numerically challenging problem, often associated with instabilities, extra computational cost, and loss of modularity. A computationally efficient finite element framework has been recently proposed that achieves numerical stability without sacrificing modularity [1]. This type of coupling introduces new challenges in the linear algebraic equation solver (LS), producing an strong coupling between flow and pressure that leads to an ill-conditioned tangent matrix. In this paper we exploit this strong coupling to obtain a novel and efficient algorithm for the linear solver (LS). We illustrate the efficiency of this method on several large-scale cardiovascular blood flow simulation problems.

A Low-Fidelity Stochastic Model of Viral Spread in Aircraft to Assess Risk Mitigation Strategies

2021 ◽  
Author(s):  
Leigh McCue
Keyword(s):  
Large Scale ◽  
Risk Mitigation ◽  
Mitigation Strategies ◽  
Traffic Network ◽  
Computationally Efficient ◽  
Passenger Compartment ◽  
Stochastic Effects ◽  
Viral Spread ◽  
Risk Mitigation Strategies ◽  
Baseline Health

Abstract The purpose of this work is to develop a computationally efficient model of viral spread that can be utilized to better understand influences of stochastic factors on a large-scale system - such as the air traffic network. A particle-based model of passengers and seats aboard a single-cabin 737-800 is developed for use as a demonstration of concept on tracking the propagation of a virus through the aircraft's passenger compartment over multiple flights. The model is sufficiently computationally efficient so as to be viable for Monte Carlo simulation to capture various stochastic effects, such as number of passengers, number of initially sick passengers, seating locations of passengers, and baseline health of each passenger. The computational tool is then exercised in demonstration for assessing risk mitigation of intervention strategies, such as passenger-driven cleaning of seating environments and elimination of middle seating.

Reconfigurable nonvolatile boolean logic with one-transistor-two-memristor for in-memory computing

2021 ◽  
Author(s):  
Ziling Wang ◽  
Li Luo ◽  
Jie Li ◽  
Lidan Wang ◽  
shukai duan
Keyword(s):  
Large Scale ◽  
Full Adder ◽  
Boolean Logic ◽  
Device Structure ◽  
Von Neumann ◽  
Computing Paradigm ◽  
Operation Process ◽  
Strong Candidate ◽  
High Flexibility ◽  
Logic Functions

Abstract In-memory computing is highly expected to break the von Neumann bottleneck and memory wall. Memristor with inherent nonvolatile property is considered to be a strong candidate to execute this new computing paradigm. In this work, we have presented a reconfigurable nonvolatile logic method based on one-transistor-two-memristor (1T2M) device structure, inhibiting the sneak path in the large-scale crossbar array. By merely adjusting the applied voltage signals, all 16 binary Boolean logic functions can be achieved in a single cell. More complex computing tasks including one-bit parallel full adder and Set-Reset latch have also been realized with optimization, showing simple operation process, high flexibility, and low computational complexity. The circuit verification based on cadence PSpice simulation is also provided, proving the feasibility of the proposed design. The work in this paper is intended to make progress in constructing architectures for in-memory computing paradigm.

scholarly journals A Multidimensional and Multiscale Model for Pressure Analysis in a Reservoir-Pipe-Valve System

2018 ◽  
Author(s):  
Feng Jie Zheng ◽  
Fu Zheng Qu ◽  
Xue Guan Song
Keyword(s):  
Pressure Fluctuation ◽  
Large Scale ◽  
Three Dimensional ◽  
Industrial Process ◽  
Multiscale Model ◽  
Computational Time ◽  
Small Scale ◽  
Cfd Model ◽  
Computationally Efficient ◽  
Proposed Model

Reservoir-pipe-valve (RPV) systems are widely used in many industrial process. The pressure in an RPV system plays an important role in the safe operation of the system, especially during the sudden operation such as rapid valve opening/closing. To investigate the pressure especially the pressure fluctuation in an RPV system, a multidimensional and multiscale model combining the method of characteristics (MOC) and computational fluid dynamics (CFD) method is proposed. In the model, the reservoir is modeled by a zero-dimensional virtual point, the pipe is modeled by a one-dimensional MOC, and the valve is modeled by a three-dimensional CFD model. An interface model is used to connect the multidimensional and multiscale model. Based on the model, a transient simulation of the turbulent flow in an RPV system is conducted, in which not only the pressure fluctuation in the pipe but also the detailed pressure distribution in the valve are obtained. The results show that the proposed model is in good agreement with the full CFD model in both large-scale and small-scale spaces. Moreover, the proposed model is more computationally efficient than the CFD model, which provides a feasibility in the analysis of complex RPV system within an affordable computational time.

scholarly journals FARCI: Fast and Robust Connectome Inference

2021 ◽  
Vol 11 (12) ◽  
pp. 1556
Author(s):  
Saber Meamardoost ◽  
Mahasweta Bhattacharya ◽  
Eun Jung Hwang ◽  
Takaki Komiyama ◽  
Claudia Mewes ◽  
...  
Keyword(s):  
Large Scale ◽  
Single Neuron ◽  
Computationally Efficient ◽  
Noise Levels ◽  
Two Photon ◽  
Computational Speed ◽  
Partial Correlations ◽  
Analysis Package ◽  
Matlab Package ◽  
Neural Anatomy

The inference of neuronal connectome from large-scale neuronal activity recordings, such as two-photon Calcium imaging, represents an active area of research in computational neuroscience. In this work, we developed FARCI (Fast and Robust Connectome Inference), a MATLAB package for neuronal connectome inference from high-dimensional two-photon Calcium fluorescence data. We employed partial correlations as a measure of the functional association strength between pairs of neurons to reconstruct a neuronal connectome. We demonstrated using in silico datasets from the Neural Connectomics Challenge (NCC) and those generated using the state-of-the-art simulator of Neural Anatomy and Optimal Microscopy (NAOMi) that FARCI provides an accurate connectome and its performance is robust to network sizes, missing neurons, and noise levels. Moreover, FARCI is computationally efficient and highly scalable to large networks. In comparison with the best performing connectome inference algorithm in the NCC, Generalized Transfer Entropy (GTE), and Fluorescence Single Neuron and Network Analysis Package (FluoroSNNAP), FARCI produces more accurate networks over different network sizes, while providing significantly better computational speed and scaling.

Sign in / Sign up

Export Citation Format

Share Document