12,015 research outputs found

    Intravenous ketamine for subacute treatment of refractory chronic migraine: a case series.

    Get PDF
    BACKGROUND: Refractory migraine is a challenging condition with great impact on health related quality of life. Intravenous (IV) ketamine has been previously used to treat various refractory pain conditions. We present a series of patients with refractory migraine treated with intravenous ketamine in the hospital setting. METHODS: Based on retrospective chart review, we identified six patients with refractory migraine admitted from 2010 through 2014 for treatment with intravenous ketamine. Ketamine was administered using a standard protocol starting with a dose of 0.1 mg/kg/hr and increased by 0.1 mg/kg/hr every 3 to 4 h as tolerated until the target pain score of 3/10 was achieved and maintained for at least 8 h. Visual Analogue Scale (VAS) scores at time of hospital admission were obtained as well as average baseline VAS scores prior to ketamine infusion. A phone interview was conducted for follow-up of migraine response in the 3 to 6 months following ketamine infusion. RESULTS: The study sample had a median age of 36.5 years (range 29-54) and 83% were women. Pre-treatment pain scores ranged from 9 to 10. All patients achieved a target pain level of 3 or less for 8 h; the average ketamine infusion rate at target was 0.34 mg/kg/hour (range 0.12-0.42 mg/kg/hr). One patient reported a transient out-of-body hallucination following an increase in the infusion rate, which resolved after decreasing the rate. There were no other significant side effects. CONCLUSION: IV ketamine was safely administered in the hospital setting to patients with refractory chronic migraine. Treatment was associated with short term improvement in pain severity in 6 of 6 patients with refractory chronic migraine. Prospective placebo-controlled trials are needed to assess short term and long-term efficacy of IV ketamine in refractory chronic migraine

    Logic Programming in Tabular Allegories

    Get PDF
    We develop a compilation scheme and categorical abstract machine for execution of logic programs based on allegories, the categorical version of the calculus of relations. Operational and denotational semantics are developed using the same formalism, and query execution is performed using algebraic reasoning. Our work serves two purposes: achieving a formal model of a logic programming compiler and efficient runtime; building the base for incorporating features typical of functional programming in a declarative way, while maintaining 100% compatibility with existing Prolog programs

    President’s Message: Advancing the TIDE of Technology Education

    Get PDF
    The article presents information relating to the field of technology education. Vigorous change continues in the study of technology and the delivery of technology education because of the integrating nature of technology and the need to prepare students for developing technological world to meet changing human needs. Significant strides have been made in the evolution of technology education of which we should all be very proud. In the last decade alone, the International Technology Education Association has provided the leadership for a wide range of initiatives designed to enhance technology education through technology, innovation, design, and engineering experiences at the K-12 school levels

    Mathematical modelling of the pathogenesis of multiple myeloma-induced bone disease

    Get PDF
    Multiple myeloma (MM) is the second most common haematological malignancy and results in destructive bone lesions. The interaction between MM cells and the bone microenvironment plays an important role in the development of the tumour cells and MM-induced bone disease and forms a 'vicious cycle' of tumour development and bone destruction, intensified by suppression of osteoblast activity and promotion of osteoclast activity. In this paper, a mathematical model is proposed to simulate how the interaction between MM cells and the bone microenvironment facilitates the development of the tumour cells and the resultant bone destruction. It includes both the roles of inhibited osteoblast activity and stimulated osteoclast activity. The model is able to mimic the temporal variation of bone cell concentrations and resultant bone volume after the invasion and then removal of the tumour cells and explains why MM-induced bone lesions rarely heal even after the complete removal of MM cells. The behaviour of the model compares well with published experimental data. The model serves as a first step to understand the development of MM-induced bone disease and could be applied further to evaluate the current therapies against MM-induced bone disease and even suggests new potential therapeutic targets

    Precautionary Measures for Credit Risk Management in Jump Models

    Full text link
    Sustaining efficiency and stability by properly controlling the equity to asset ratio is one of the most important and difficult challenges in bank management. Due to unexpected and abrupt decline of asset values, a bank must closely monitor its net worth as well as market conditions, and one of its important concerns is when to raise more capital so as not to violate capital adequacy requirements. In this paper, we model the tradeoff between avoiding costs of delay and premature capital raising, and solve the corresponding optimal stopping problem. In order to model defaults in a bank's loan/credit business portfolios, we represent its net worth by Levy processes, and solve explicitly for the double exponential jump diffusion process and for a general spectrally negative Levy process.Comment: 31 pages, 4 figure

    Tunable Double Negative Band Structure from Non-Magnetic Coated Rods

    Full text link
    A system of periodic poly-disperse coated nano-rods is considered. Both the coated nano-rods and host material are non-magnetic. The exterior nano-coating has a frequency dependent dielectric constant and the rod has a high dielectric constant. A negative effective magnetic permeability is generated near the Mie resonances of the rods while the coating generates a negative permittivity through a field resonance controlled by the plasma frequency of the coating and the geometry of the crystal. The explicit band structure for the system is calculated in the sub-wavelength limit. Tunable pass bands exhibiting negative group velocity are generated and correspond to simultaneously negative effective dielectric permittivity and magnetic permeability. These can be explicitly controlled by adjusting the distance between rods, the coating thickness, and rod diameters

    On a whale shark caught at Vizhinjam, Kerala

    Get PDF
    On 20th June 2005, a female whale shark Rhincodon typus entangled in a ozhukuvala net at about 1000 hrs from 45 meter depth was dragged to the Vizhinjam landing centre

    High rate locally-correctable and locally-testable codes with sub-polynomial query complexity

    Full text link
    In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs and LTCs with block length nn, constant rate (which can even be taken arbitrarily close to 1), constant relative distance, and query complexity exp(O~(logn))\exp(\tilde{O}(\sqrt{\log n})). Previously such codes were known to exist only with Ω(nβ)\Omega(n^{\beta}) query complexity (for constant β>0\beta > 0), and there were several, quite different, constructions known. Our codes are based on a general distance-amplification method of Alon and Luby~\cite{AL96_codes}. We show that this method interacts well with local correctors and testers, and obtain our main results by applying it to suitably constructed LCCs and LTCs in the non-standard regime of \emph{sub-constant relative distance}. Along the way, we also construct LCCs and LTCs over large alphabets, with the same query complexity exp(O~(logn))\exp(\tilde{O}(\sqrt{\log n})), which additionally have the property of approaching the Singleton bound: they have almost the best-possible relationship between their rate and distance. This has the surprising consequence that asking for a large alphabet error-correcting code to further be an LCC or LTC with exp(O~(logn))\exp(\tilde{O}(\sqrt{\log n})) query complexity does not require any sacrifice in terms of rate and distance! Such a result was previously not known for any o(n)o(n) query complexity. Our results on LCCs also immediately give locally-decodable codes (LDCs) with the same parameters

    Migraine: association with personality characteristics and psychopathology

    Full text link
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/72438/1/j.1468-2982.1995.1505358.x.pd
    corecore