Intelligent Medicine Kit for Healthcare Monitoring, An IOT Based Solution

Increase in chronic diseases worldwide demands efficient healthcare solutions for maintaining well-beingof people. Treatment requires timely in-take of medicines and strict adherence to routine. This lack of adherenceis estimated to cause many deaths and hospitalizations. If we can get people to take their medications regularly,they won’t develop complications. In addition to improving patient outcomes, medication adherence will reducehealth care costs associated with these conditions. Healthcare monitoring solutions based on Internet of Things(IoT) technology has drawn significant research attention. This paper proposes an IoT based user configurablecustomized intelligent medicine kit augmented with Wi-Fi and Bluetooth Low Energy technologies. It hascapability to detect whether patient is taking all prescribed medicines on fix schedule and intelligentlycommunicates the same to patient and their close relatives using uniquely created Four Tier Notification System(FTNS), thus helping patient to live a healthy life. The paper discusses a novel theme on the functioning of amedical grade device which would consume information from sensor and send it to the central server with amaximum possibility of success using Four Tier Notification System (FTNS). This novel approach discusseshandshaking of connection to the central serve with a fallback mechanism to achieve maximum success of datasynchronization. This paper also discusses how this useful data from medicine kit can help healthcare sector toclosely track patient's physical activities and helps to influence the way healthcare sector operates in future

Minimizing Rental Cost under Specified Rental Policy in Two Stage Flow Shop, the Processing Time Associated with Probabilities Including Break-down Interval and Job – Block Criteria

In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. This paper is an attempt to study the two machine general flow shop problem in which the processing time of the jobs are associated with probabilities, following some restrictive renting policy including break-down interval and equivalent job-block criteria. The objective of the paper is to find an algorithm to minimize the rental cost of the machines under specified rental policy with break-down interval and job block criteria. The proposed method is very simple and easy to understand and also, provide an important tool for decision makers. The method is justified with the help of numerical example and a computer program

Government Process Re-engineering for the Empowerment of the Women Victimized by Gender Biased Atrocities

Uttar Pradesh (UP) is the most populous state of India and 17% of the total population of the country resides in the state. As per Census India 2011, the female population is about 50% while the status of women empowerment is not up to the mark. The women empowerment is necessary for the transformational and affirmative impact on the society. There are various barriers to women empowerment- poverty, low education levels, unemployment, patriarchal attitude and gender based atrocity against women. Atrocity against the women is one of the major barriers for their physical, mental, social and economical growth. For empowering women against the atrocities, Government of Uttar Pradesh (GoUP) has implemented an innovative Government Process Re-engineering approach by integrating Department of Health, Women Welfare and Police through Rani Laxmi Bai Mahila Samman Kosh Portal which is a common online portal for all the stakeholders with end-to-end solutions. This paper draws the light on heinous crimes against the women in the society. We also focus to explore the immediate assistance provided by Government of Uttar Pradesh (GoUP) in the form of monetary and medical relief including reconstructive surgeries to women who are victims of heinous crimes, as well as educational assistance to the victims and their minor children using Government Process Re-engineering tool- Rani Laxmi Bai Mahila Samman Kosh Portal

TESTING DNA VARIATION IN KABULI CHICKPEA SEEDS THROUGH ISSR-PCR

Objective: Chickpea is an annual legume known for its high seed protein thus beneficial for one’s health and well-being. Of the two chickpea seed types, Kabuli seeds have reasonably high-protein and -carbohydrate contents, as a result, set up more commercial demand. Methods: Inter simple sequence repeat (ISSR) markers are useful in the areas of genetic diversity. The present study attempted ISSR-PCR experimentation in testing DNA variation predominantly in Kabuli chickpea seed accessions employing 10 different set of ISSR primers. Results: In vitro amplification by PCR revealed an average number of bands per primer per accession which accounted to 8.7. Maximum number of bands (25) scored by the primer UBC-836 while least number of bands (12) were displayed by UBC-811. Conclusion: The accession JGK-1 and IPCK-12-288 presented divergent DNA polymorphic among all chickpea accessions tested and therefore found distinct. The genetic divergence at DNA level existed between these chickpea accessions can be used proficiently for future plant breeding program

Bicriteria in n x 3 Flow Shop Scheduling under Specified Rental Policy, Processing Time Associated with Probabilities including Transportation Time and Job Block Criteria

This paper deals with bicriteria in n-jobs, 3-machines flowshop scheduling problem in which the processing times are associated with probabilities including transportation time and job block criteria. The objective of the study is to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtains the minimum makespan. A heuristic approach method to find optimal or near optimal sequence has been discussed. A computer programme followed by a numerical illustration is give to clarify the algorithm. Keywords: Flowshop Scheduling, Heuristic, Processing Time, Transportation Time, Rental Cost, Idle Time, Job block, Makespa

On Linkage of a Flow Shop Scheduling Model Including Job Block Criteria with a Parallel Biserial Queue Network

This paper is an attempt to establish a linkage between a flowshop scheduling model having job block criteria with a parallel biserial queue network linked with a common channel in series. The arrival and service pattern both follows Poisson law in queue network. The generating function technique, law of calculus and statistical tools have been used to find out the various characteristics of queue. Further the completion time of jobs in a queue system form the set up time for the first machine in the scheduling model. A heuristic approach to find an optimal sequence of jobs with a job block criteria with minimum total flow time when the jobs are processed in a combined system with a queue network is discussed. The proposed method is easy to understand and also provide an important tool for the decision makers when the production is done in batches. A computer programme followed by a numerical illustration is given to justify the algorithm. Keywords: Queue Network, Mean Queue length, Waiting time, Processing time, Job-block, Makespan, Biserial Channe