3 results
Search Results
2. Le paracétamol dans le traitement des douleurs arthrosiques.
- Author
-
Brandt, Kenneth
- Subjects
- *
OSTEOARTHRITIS , *KNEE diseases , *NONSTEROIDAL anti-inflammatory agents , *JOINT diseases , *DRUG side effects , *PAIN management , *BLOOD platelet aggregation , *MYOCARDIAL infarction , *CYCLOOXYGENASE 2 inhibitors - Abstract
Osteoarthritis (OA) is the most common joint disease and OA of the knee, in particular, is the major cause of chronic disability among people >65 years. Because nonsteroidal anti-inflammatory drugs (NSAIDs) improve symptoms in many patients with OA, it is widely considered that OA pain is due to synovial inflammation. However, OA pain may arise also from subchondral bone, the joint capsule, ligaments, tendons, entheses and periarticular muscle spasm. In many patients, the relief of OA pain and overall satisfaction with therapy may be as great with paracetamol (acetaminophen [APAP]) as with an NSAID. Cyclo-oxygenase (COX)-1-sparing NSAIDs (coxibs) are no more effective in the treatment of OA pain than non-selective NSAIDs and, although they may significantly decrease the risk of serious adverse effects related to gastrointestinal ulcers (GI) and ulcer complications, their gastroprotective effect may be reduced by concomitant administration of low-dose aspirin. Also, they may increase the risk of myocardial infarction in predisposed individuals. Because coxibs do not inhibit platelet aggregation, if prophylaxis against thromboembolic disease is required in patients being treated with a selective COX-2 inhibitor, low-dose aspirin should be used in conjunction with the coxib. Furthermore, nonselective NSAI Ds and coxibs may have adverse effects on the kidney, fracture healing and salt and water homeostasis. This paper discusses the relative positioning of APAP, NSAIDs and coxibs in the management of OA, on the basis of considerations of tolerability, efficacy and costs. [ABSTRACT FROM AUTHOR]
- Published
- 2003
3. Fast Range Searching with Delaunay Triangulations.
- Author
-
Binhai Zhu
- Subjects
- *
DATA structures , *ALGORITHMS , *ELECTRONIC data processing , *FOUNDATIONS of arithmetic - Abstract
This paper studies the idea of answering range searching queries using simple data structures. The only data structure we need is the Delaunay Triangulation of the input points. The idea is to first locate a vertex of the (arbitrary) query polygon and walk along the boundary of the polygon in the Delaunay Triangulation and report all the points enclosed by the query polygon. For a set of uniformly distributed random points in 2-D and a query polygon the expected query time of this algorithm is , where Q is the size of the query polygon , is the expected number of output points, is a parameter related to the shape of the query polygon and n, and is always bounded by the sum of the edge lengths of . Theoretically, when the expected query time is , which improves the best known average query time for general range searching. Besides the theoretical meaning, the good property of this algorithm is that once the Delaunay Triangulation is given, no additional preprocessing is needed. In order to obtain empirical results, we design a new algorithm for generating random simple polygons within a given domain. Our empirical results show that the constant coefficient of the algorithm is small, at least for the special (practical) cases when the query polygon is either a triangle (simplex range searching) or an axis-parallel box (orthogonal range searching) and for the general case when the query polygons are generated by our new polygon-generating algorithms and their sizes are relatively small. [ABSTRACT FROM AUTHOR]
- Published
- 2000
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.