Skip to main content

STOCHASTIC DECISION MAKING FOR ADAPTIVE CROWDSOURCING IN MEDICAL BIG-DATA PLATFORMS


STOCHASTIC DECISION MAKING FOR ADAPTIVE CROWDSOURCING IN MEDICAL BIG-DATA PLATFORMS

ABSTRACT
Two novel algorithms for adaptive crowdsourcing in medical imaging big-data platforms is considered, namely, a max-weight scheduling algorithm for medical cloud platforms and a stochastic decision-making algorithm for distributed power-and-latency-aware dynamic buffer management in medical devices. In the first algorithm, medical cloud platforms perform a joint queue-backlog and rate-aware scheduling decisions for matching deployed access points (APs) and medical users where APs are eventually connected to medical clouds. In the second algorithm, each scheduled medical device computes the amounts of power allocation to upload its own medical data to medical big-data clouds with stochastic decision making considering joint energy-efficiency and buffer stability optimization.




INTRODUCTION
In recent years, the volume of medical data generated by large hospitals is becoming increasingly large due to technological advancements in medical devices, including high-resolution magnetic resonance imaging (MRI), motion MRI, ultrasound, and digital microscopy. Furthermore, centralized storage of medical records is a common practice for sharing medical data among medical practitioners. Oftentimes, medical records are collected and uploaded to the centralized medical record using modern mobile equipments, such as smart phones, and via wireless access points (APs). Because of the sensitive nature of medical data, data aggregation, needs to be privacy preserving. Therefore, interconnecting medical storage platforms with external networks (such as the Internet) is not recommended. Medical data in the proposed medical storage platform is often gathered and organized by fixed users—e.g., purposed medical tablets, smartphones, computed tomography scanners, etc.—with the principle of crowdsourcing.


EXISTING SYSTEM
Ø There is no prior work on scheduling and buffer management in the context of medical big-data platforms
Ø In the general wireless scheduling literature, the sum-rate-maximization (SRM) scheduling is one of the well known schemes that is most closely related to proposed max-weight scheduling.
Disadvantages
Ø Since the SRM schedules user based only on data rates
Ø SRM Schedules has no effect on buffer-backlog and management.





PROPOSED SYSTEM
Ø In this proposed medical storage system, 60-GHz wireless technologies is considered for in-hospital wireless network access. The choice of wireless technologies has been widely advocated and accepted in the literature because of high data rates achieved by ultrawide-bandwidth; e.g., 2.16 GHz in one subchannel and four subchannels in one channel.
Ø Two algorithms are proposed to address the scheduler and buffer management in medical platforms.
Ø The proposed medical platform makes scheduling decisions in each time unit for matching deployed APs and MUs, where the APs are eventually connected to medical platforms.
Ø The proposed medical platform makes the scheduling decision according to the principle of max-weight, which considers data rates between APs and MUs and the queuebacklog size for medical devices.


Advantages
Ø Efficient medical platform design
Ø Address the problem of buffer management and scheduler design
Ø Avoid data overflow and loss in medical devices.


HARDWARE REQUIREMENTS
Processor                     : Any Processor above 500 MHz.
Ram                              :  128Mb.
Hard Disk                    :  10 Gb.
Compact Disk             :  650 Mb.
Input device                :  Standard Keyboard and Mouse.
Output device             :  VGA and High Resolution Monitor.

SOFTWARE SPECIFICATION
Operating System            : Windows Family.
Programming Language   : JDK 1.5 or higher
Database                  : MySQL 5.0




Comments

Popular posts from this blog

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search ABSTRACT: In this paper, With advances in geo-positioning technologies and geo-location services, there are a rapidly growing amount of spatiotextual objects collected in many applications such as location based services and social networks, in which an object is described by its spatial location and a set of keywords (terms). Consequently, the study of spatial keyword search which explores both location and textual description of the objects has attracted great attention from the commercial organizations and research communities. In the paper, we study two fundamental problems in the spatial keyword queries: top k spatial keyword search (TOPK-SK), and batch top k spatial keyword search (BTOPK-SK). Given a set of spatio-textual objects, a query location and a set of query keywords, the TOPK-SK retrieves the closest k objects each of which contains all keywords in the query. BTOPK-SK is the batch processing of sets...

A simple and reliable touch sensitive security system CODING

#include <REGX51.H> #include "lcd.c" #define MAX_DELAY() delay(65000) sbit Vibra_Sense=P3^1; sbit Buz=P1^0; void intro() {  lcd_init();  lcd_str("Touch Sensitive ",0x80);  lcd_str("Security System ",0xc0);  MAX_DELAY();MAX_DELAY();  lcd_clr();  }  void main()  { unsigned int i = 0, j= 0; intro();    while(1)    { lcd_str("Security Syst On",0x80); lcd_str("No Vibra Detectd",0xc0); Buz = 1; if(Vibra_Sense == 1) { while(Vibra_Sense == 1) delay(1000); } else { while(Vibra_Sense == 0) delay(1000); } Buz = 0; lcd_str("Vibraton Detectd",0xc0);delay(65000); while(1);    }  }

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud Abstract                                                                                                                                                      ...