SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Cohen P) srt2:(2000-2004)"

Sökning: WFRF:(Cohen P) > (2000-2004)

  • Resultat 1-10 av 24
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Axelson, Olav, 1937-, et al. (författare)
  • Regulatory toxicology and pharmacology.
  • 2003
  • Ingår i: International journal of occupational and environmental health. - 1077-3525 .- 2049-3967. ; 9, s. 386-389
  • Tidskriftsartikel (refereegranskat)
  •  
2.
  •  
3.
  •  
4.
  •  
5.
  • Vanholder, R, et al. (författare)
  • Uremic toxicity: present state of the art
  • 2001
  • Ingår i: The International journal of artificial organs. - : SAGE Publications. - 0391-3988 .- 1724-6040. ; 24:10, s. 695-725
  • Tidskriftsartikel (refereegranskat)abstract
    • The uremic syndrome is a complex mixture of organ dysfunctions, which is attributed to the retention of a myriad of compounds that under normal condition are excreted by the healthy kidneys (uremic toxins). In the area of identification and characterization of uremic toxins and in the knowledge of their pathophysiologic importance, major steps forward have been made during recent years. The present article is a review of several of these steps, especially in the area of information about the compounds that could play a role in the development of cardiovascular complications. It is written by those members of the Uremic Toxins Group, which has been created by the European Society for Artificial Organs (ESAO). Each of the 16 authors has written a state of the art in his/her major area of interest.
  •  
6.
  • Berlow, E.L., et al. (författare)
  • Interaction strengths in food webs : Issues and opportunities
  • 2004
  • Ingår i: Journal of Animal Ecology. - : Wiley. - 0021-8790 .- 1365-2656. ; 73:3, s. 585-598
  • Forskningsöversikt (refereegranskat)abstract
    • 1. Recent efforts to understand how the patterning of interaction strength affects both structure and dynamics in food webs have highlighted several obstacles to productive synthesis. Issues arise with respect to goals and driving questions, methods and approaches, and placing results in the context of broader ecological theory. 2. Much confusion stems from lack of clarity about whether the questions posed relate to community-level patterns or to species dynamics, and to what authors actually mean by the term 'interaction strength'. Here, we describe the various ways in which this term has been applied and discuss the implications of loose terminology and definition for the development of this field. 3. Of particular concern is the clear gap between theoretical and empirical investigations of interaction strengths and food web dynamics. The ecological community urgently needs to explore new ways to estimate biologically reasonable model coefficients from empirical data, such as foraging rates, body size, metabolic rate, biomass distribution and other species traits. 4. Combining numerical and analytical modelling approaches should allow exploration of the conditions under which different interaction strengths metrics are interchangeable with regard to relative magnitude, system responses, and species identity. 5. Finally, the prime focus on predator-prey links in much of the research to date on interaction strengths in food webs has meant that the potential significance of nontrophic interactions, such as competition, facilitation and biotic disturbance, has been largely ignored by the food web community. Such interactions may be important dynamically and should be routinely included in future food web research programmes.
  •  
7.
  • Campieri, M, et al. (författare)
  • Session II and III panel discussion
  • 2000
  • Ingår i: DRUGS OF TODAY. - 1699-3993. ; 36, s. 93-101
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
  •  
8.
  • Cohen, D, et al. (författare)
  • Building tractable disjunctive constraints
  • 2000
  • Ingår i: Journal of the ACM. - : Association for Computing Machinery (ACM). - 0004-5411 .- 1557-735X. ; 47:5, s. 826-853
  • Tidskriftsartikel (refereegranskat)abstract
    • Many combinatorial search problems can be expressed as 'constraint satisfaction problems'. This class of problems is known to be NP-hard in general, but a number of restricted constraint classes have been identified which ensure tractability. This paper presents the first general results on combining tractable constraint classes to obtain larger, more general, tractable classes. We give examples to show that many known examples of tractable constraint classes, from a wide variety of different contexts, can be constructed from simpler tractable classes using a general method. We also construct several new tractable classes that have not previously been identified.
  •  
9.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 24

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy