An efficient filtered scheme for some first order Hamilton-Jacobi-Bellman equations

We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are not monotone but still satisfy some $\epsilon$-monotone property. Convergence results and precise error estimates are given, of the order of $\sqrt{\Delta x}$ where $\Delta x$ is the mesh size. The framework allows to construct finite difference discretizations that are easy to implement, high--order in the domains where the solution is smooth, and provably convergent, together with error estimates. Numerical tests on several examples are given to validate the approach, also showing how the filtered technique can be applied to stabilize an otherwise unstable high--order scheme.Comment: 20 pages (including references), 26 figure

An adaptive ANOVA stochastic Galerkin method for partial differential equations with random inputs

It is known that standard stochastic Galerkin methods encounter challenges when solving partial differential equations with high dimensional random inputs, which are typically caused by the large number of stochastic basis functions required. It becomes crucial to properly choose effective basis functions, such that the dimension of the stochastic approximation space can be reduced. In this work, we focus on the stochastic Galerkin approximation associated with generalized polynomial chaos (gPC), and explore the gPC expansion based on the analysis of variance (ANOVA) decomposition. A concise form of the gPC expansion is presented for each component function of the ANOVA expansion, and an adaptive ANOVA procedure is proposed to construct the overall stochastic Galerkin system. Numerical results demonstrate the efficiency of our proposed adaptive ANOVA stochastic Galerkin method

Perception Of Postnatal Mothers Regarding Respectful Maternity Care Admitted In A Selected Hospital, Odisha- Pilot Study

Background: Respectful maternity care refers to care organized for and provided to all women in a manner that maintains their dignity, privacy and confidentiality, ensures freedom from harm and mistreatment, and enables informed choice and continuous support during labour and Childbirth. Methods: A quantitative approach and Descriptive design was used. The sample size of 40 were selected by using Non-Probability; purposive sampling technique. Data were collected from the postnatal mothers after delivery by means of structured Perception Interview Schedule. Analysis was done using descriptive  statistics. Results: The findings of the study revealed that around 31(77.5%)mothers had negative perception towards respectful maternity care. Conclusion: This Study concluded that the there is urgent need to create awareness among women, health care providers regarding importance of respectful maternity care.

PRIVACY DISPERSED DATA FINDING WITH BROADCASTING IN WSNS

Data resilience bolster fact a decidedly necessary send aside deduplication warehouse deal with as determined is thoroughly one copy through file specifically hoarded in reach steward reciprocal separately entire owners. Thus, assuring of high data solidarity not beyond de-duplication method is an eminent quarrel and the fortitude of preceding managements enrol single-waitress conditions. We make cornerstone practice to construe program of appropriated stable corporation and ask a wonderful dispersed rehearse by more forward compliance status data chunks are dispersed crosswise assorted fluster trip attendants. Most of the real work cannot precisely cope adherence yet tag adherence contends past dispersed storehouse industry’s. The safeguard requirements of data hide longer tag docility are nevertheless achieved by deterministic deserted disposal distribution not over appropriated structures, rather than applying merging encryption like in soon structures. Our techniques see about definitions described in ask exemption wear. Distinctive feature of our order is that data certainty, counting tag rationality is achieved

Prevalence, awareness, treatment and control of hypertension among adults of Raipur city, Chhattisgarh, India: a cross sectional study

Background: Hypertension is prevalent all over the world. Usually it is readily detectable, easily treatable condition and if left untreated may leads to serious complications. In considerable proportion of cases the disease tends to be asymptomatic for prolonged time, hence also labelled as ‘Silent killer’. High blood pressure (BP) is a major risk factor for cardiovascular disease and better control can lead to prevention of 300,000 of the 1.5 million annual deaths from cardiovascular diseases in India. The objective of the study was to find the prevalence, awareness, treatment and control status of hypertension among adults of Raipur city.Methods: A community based cross sectional study was carried out in 768 subjects of age 25-59 years residing in Raipur city, Chhattisgarh, India. A predesigned, pretested questionnaire was used for data collection. To classify blood pressure JNC VII criteria was used.Results: The prevalence of hypertension was 29.0 %. Out of 223 hypertensive (223/768), 59.2% were aware about their hypertensive status, in them 76.9% were on treatment and 49.5% were under control.Conclusions: There was striking lack of awareness of the condition and a suboptimal rate of control among those treated. These finding emphasize public health importance of hypertension in Raipur city and there is urgent need to address this through targeted intervention

IDENTIFY SCHEME GRADE FOR PORTABLE APPLICATIONS

Inside the literature works since there are some related studies, like web ranking junk e-mail recognition, recognition of internet review junk e-mail additionally to mobile application recommendation, impracticality of recognition of ranking fraud for mobile programs remains under-investigated. For achieving within the crucial void, we advise to build up a ranking fraud recognition system intended for mobile programs. We submit an incredible-natural vision of ranking fraud while growing your ranking fraud recognition system intended for mobile programs. It's extended by means of other domain created particulars for ranking fraud recognition. Inside the recommended system of ranking fraud recognition system for mobile programs, it's worth watching the whole evidences are acquired by means of modelling of programs ranking, rating and review behaviours completely through record ideas tests

ESMP: A high-throughput computational pipeline for mining SSR markers from ESTs

With the advent of high-throughput sequencing technology, sequences from many genomes are being deposited to public databases at a brisk rate. Open access to large amount of expressed sequence tag (EST) data in the public databases has provided a powerful platform for simple sequence repeat (SSR) development in species where sequence information is not available. SSRs are markers of choice for their high reproducibility, abundant polymorphism and high inter-specific transferability. The mining of SSRs from ESTs requires different high-throughput computational tools that need to be executed individually which are computationally intensive and time consuming. To reduce the time lag and to streamline the cumbersome process of SSR mining from ESTs, we have developed a user-friendly, web-based EST-SSR pipeline “EST-SSR-MARKER PIPELINE (ESMP)”. This pipeline integrates EST pre-processing, clustering, assembly and subsequently mining of SSRs from assembled EST sequences. The mining of SSRs from ESTs provides valuable information on the abundance of SSRs in ESTs and will facilitate the development of markers for genetic analysis and related applications such as marker-assisted breeding

Mining for SSRs and FDMs from expressed sequence tags of Camellia sinensis

Simple Sequence Repeats (SSRs) developed from Expressed Sequence Tags (ESTs), known as EST-SSRs are most widely used and potentially valuable source of gene based markers for their high levels of crosstaxon portability, rapid and less expensive development. The EST sequence information in the publicly available databases is increasing in a faster rate. The emerging computational approach provides a better alternative process of development of SSR markers from the ESTs than the conventional methods. In the present study, 12,851 EST sequences of Camellia sinensis, downloaded from National Center for Biotechnology Information (NCBI) were mined for the development of Microsatellites. 6148 (4779 singletons and 1369 contigs) non redundant EST sequences were found after preprocessing and assembly of these sequences using various computational tools. Out of total 3822.68 kb sequence examined, 1636 (26.61%) EST sequences containing 2371 SSRs were detected with a density of 1 SSR/1.61 kb leading to development of 245 primer pairs. These mined EST-SSR markers will help further in the study of variability, mapping, evolutionary relationship in Camellia sinensis. In addition, these developed SSRs can also be applied for various studies across species

An Improved Chaotic Grey Wolf Optimization Algorithm (CGWO)

Grey Wolf Optimization (GWO) is a new type of swarm-based technique for dealing with realistic engineering design constraints and unconstrained problems in the field of metaheuristic research. Swarm-based techniques are a type of population-based algorithm inspired by nature that can produce low-cost, quick, and dependable solutions to a wider variety of complications. It is the best choice when it can achieve faster convergence by avoiding local optima trapping. This work incorporates chaos theory with the standard GWO to improve the algorithm's performance due to the ergodicity of chaos. The proposed methodology is referred to as Chaos-GWO (CGWO). The CGWO improves the search space's exploration and exploitation abilities while avoiding local optima trapping. Using different benchmark functions, five distinct chaotic map functions are examined, and the best chaotic map is considered to have great mobility and ergodicity characteristics. The results demonstrated that the best performance comes from using the suitable chaotic map function, and that CGWO can clearly outperform standard GWO