Sleeping Mindfully

Insomnia is a disorder of hyperarousal that affects up to 30% of adults. Insomnia is based on cognitive dysfunction that causes us to worry and neuroendocrine factors that upregulate our autonomic nervous system. Studies have shown that just 10 minutes of daily mindfulness practice can improve sleep. Mindfulness is able to work at the root of both causes of insomnia. It improves our ability to relax through increasing attentional factors that impart control over stress hormones and helps reduce ruminative thoughts.https://scholarworks.uvm.edu/fmclerk/1520/thumbnail.jp

AN ANALYSIS OF ILLOCUTIONARY ACT ON JASON GRACE IN THE NOVEL “THE LOST HERO” BY RICK RIORDAN

Illocutionary acts cover the intention behind an utterance and analyze the speaker’s intent and the effect on the listener, this research aims to analyze the types of Illocutionary acts and which most dominant types of illocutionary acts used by Jason Grace in the novel “The Lost Hero”. The research used John R. Searle’s classification for the illocutionary act which consisted of representatives, directives, commisives, expressives, and declarations. This research used qualitative research with descriptive as a method. The object of this research is a novel by Rick Riordan entitled “The Lost Hero”. The instrument used for this research is content analysis mainly focused on analyzing Jason Grace's utterances in the novel. Furthermore, data analysis was conducted by the researcher by reading the novel, writing Jason Grace's utterances, and separating the utterances based on John R. Searle’s classification. The result of the research found that there are 5 types of illocutionary acts Jason Grace used in “The Lost Hero” novel. These utterances consisted of 10% declarations, 14% representatives, 26% expressives, 44% directives, and 6% commisives. The frequently used types of illocutionary acts Jason Grace used are directives utterances with commisives being the least used. Furthermore, this study found that Jason Grace's character in the novel used 5 types of illocutionary from John R. Searle’s classification

Nanomedicine for the Treatment of Non-Hodgkin Lymphoma

Non-Hodgkin lymphoma, or NHL, is the predominant category of lymphoma. NHL is a type of lymphoid hematopoietic malignancy which approximately 70,000 Americans are diagnosed with annually, with the number of diagnoses growing annually. For decades, chemotherapy was the standard treatment of care, but since the discovery in 1997, monoclonal antibodies are increasingly used as an alternate form of therapy. Nonetheless, almost 20,000 Americans succumb to NHL annually, which highlights the translational gap between preclinical research and the market. Although a lot of progress has been made in therapy options by immunotherapy and combination chemotherapy, the ingenuity of nanomedicine may bridge the translational difficulties while serving as a novel form of therapy capable of eradicating solid tumors. The versatility of nanoparticles allows for personalized approach to NHL, as opposed to generalized medicine, since the subtypes of lymphoma are pathologically very different from one another

Edge covering with budget constrains

We study two related problems: finding a set of k vertices and minimum number of edges (kmin) and finding a graph with at least m' edges and minimum number of vertices (mvms). Goldschmidt and Hochbaum \cite{GH97} show that the mvms problem is NP-hard and they give a 3-approximation algorithm for the problem. We improve \cite{GH97} by giving a ratio of 2. A 2(1+\epsilon)-approximation for the problem follows from the work of Carnes and Shmoys \cite{CS08}. We improve the approximation ratio to 2. algorithm for the problem. We show that the natural LP for \kmin has an integrality gap of 2-o(1). We improve the NP-completeness of \cite{GH97} by proving the pronlem are APX-hard unless a well-known instance of the dense k-subgraph admits a constant ratio. The best approximation guarantee known for this instance of dense k-subgraph is O(n^{2/9}) \cite{BCCFV}. We show that for any constant \rho>1, an approximation guarantee of \rho for the \kmin problem implies a \rho(1+o(1)) approximation for \mwms. Finally, we define we give an exact algorithm for the density version of kmin.Comment: 17 page

A Conceptual Framework for Studying Institutions in Watershed Development

Improving productivity and incomes in rainfed areas is a major challenge in India, and a key to achieving this is improving the use of land and water which are the principal constraints in these areas. A major initiative through which this is pursued in India is Watershed Development (WSD) programs which have been taken up under different schemes funded by the Government of India and the state governments. Since poverty is particularly acute in the rainfed areas, large expenditures to the tune of about US$ 500 million per year are being made on WSD programs. A hierarchy of complex institutional arrangements of the government and other bodies undertakes the planning and implementation of WSD to the district and village levels. Institutional weaknesses are a significant challenge and often lead to poor implementation and results. The paper develops a conceptual framework for the study of institutional setups in the implementation of watershed development programmes. It uses the theoretical fundamentals of new institutional economics, and concepts of organizational design and governance from management sciences. It related these to observations from six in-depth case studies of watershed development projects in state of Andhra Pradesh, India which has the largest number of such projects. The framework that emerges may be useful for examining the institutional setups and performance of watershed development activities in various areas, as well as the better design of the institutional setups for watershed and other development programmes in India and elsewhere.