Maria Visa


     Related Videos
Zak at the Hippocrates Health Institute week 3 day 4 (part 3 of 3)
Maria E. Sandgren, MD, UW Health Obstetrics and Gynecology
Maria E. Sandgren, MD, UW Health Obstetrics and Gynecology
IEO Interviews: Circulating tumour cells
Toll-like receptor signaling in the intestine: friend or foe (Part 2)
Toll-like receptor signaling in the intestine: friend or foe (Part 4)
Toll-like receptor signaling in the intestine: friend or foe (Part 5)
Toll-like receptor signaling in the intestine: friend or foe (Part 3)
Toll-like receptor signaling in the intestine: friend or foe (Part 1)
Insidermedicine in 60 - August 27, 2007

     Related Groups
Maria Bethânia (Maria Bethânia 1965 album)
Santa Maria dei Miracoli and Santa Maria in Montesanto
Maria
Maria Est
Maria Maria
Maria Tipo
  • Maria Tipo

  • Maria Tipo (born in Naples, December 23rd, 1931) is an Itali...

Maria (given name)
Maria Mai
  • Maria Mai

  • Maria Mài is a village on the island of Aruba, located towa...

I Did What I Did for Maria
Black Maria

  •  Doc. Url:    Embed Code: 

  • IEEE  status
    (0) (0 Votes)
    Views: (2012)  
    Date:
    (Publication Date: 22-24 May 20...)  
    Pages:
    ()
  • Author:  Visa, Maria
    ¿Transilvania¿ University of Brasov, Romania;

  • Abstract:  Abstract Not Available

Write a Comment
     Related Documents
The big mother of all dualities M?ller algorithm 2002 2 citations ? 1 self
building adaptive courses?
KRDB RESEARCH CENTRE KNOWLEDGE REPRESENTATION 2007
A utility-theory-consistent system-of-demand-equations approach to household travel choice...
Modeling the Effects of Contention on Application Performance in Multi-User Environments 1...
  • Modeling the Effects of Contention on Application Performance in Multi-User Envi...

  • . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xix 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Scheduling Parallel Applications on Distributed Systems . . . 5 1.3 Estimating Contention Effects . . . . . . . . . . . . . . . . . 6 1.4 Platforms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.5 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.5.1 Contention in Networks of Workstations . ...

Modeling the Effects of Contention on Application Performance in Multi-User Environments 1...
  • Modeling the Effects of Contention on Application Performance in Multi-User Envi...

  • . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xix 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Scheduling Parallel Applications on Distributed Systems . . . 5 1.3 Estimating Contention Effects . . . . . . . . . . . . . . . . . 6 1.4 Platforms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.5 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.5.1 Contention in Networks of Workstations . ...

Modeling the Effects of Contention on Application Performance in Multi-User Environments 1...
  • Modeling the Effects of Contention on Application Performance in Multi-User Envi...

  • . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xix 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Scheduling Parallel Applications on Distributed Systems . . . 5 1.3 Estimating Contention Effects . . . . . . . . . . . . . . . . . 6 1.4 Platforms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.5 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.5.1 Contention in Networks of Workstations . ...

Modeling the Effects of Contention on Application Performance in Multi-User Environments 1...
  • Modeling the Effects of Contention on Application Performance in Multi-User Envi...

  • . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xix 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Scheduling Parallel Applications on Distributed Systems . . . 5 1.3 Estimating Contention Effects . . . . . . . . . . . . . . . . . 6 1.4 Platforms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.5 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.5.1 Contention in Networks of Workstations . ...

Automaton-Descriptions and Theorem-Proving A Marriage made in Heaven 1999
  • Automaton-Descriptions and Theorem-Proving A Marriage made in Heaven 1999

  • In this paper, Finite-State-Automata (FSA) and theorem-proving approaches to spoken dialogue systems (SLDS) are contrasted to each other. FSA are too rigid to deal with unpredictable user reactions, such as corrections or counter-questions, whereas planbased approaches are usually too complex to be effectively used, given the unreliability of word recognition and the elliptical and unconventional nature of spontaneous speech. As an alternative, a Dialogue Manager architecture is proposed which uses knowledge on both the possible sequences of di...

Automaton-Descriptions and Theorem-Proving A Marriage made in Heaven 1999
  • Automaton-Descriptions and Theorem-Proving A Marriage made in Heaven 1999

  • In this paper, Finite-State-Automata (FSA) and theorem-proving approaches to spoken dialogue systems (SLDS) are contrasted to each other. FSA are too rigid to deal with unpredictable user reactions, such as corrections or counter-questions, whereas planbased approaches are usually too complex to be effectively used, given the unreliability of word recognition and the elliptical and unconventional nature of spontaneous speech. As an alternative, a Dialogue Manager architecture is proposed which uses knowledge on both the possible sequences of di...

Automaton-Descriptions and Theorem-Proving A Marriage made in Heaven 1999
  • Automaton-Descriptions and Theorem-Proving A Marriage made in Heaven 1999

  • In this paper, Finite-State-Automata (FSA) and theorem-proving approaches to spoken dialogue systems (SLDS) are contrasted to each other. FSA are too rigid to deal with unpredictable user reactions, such as corrections or counter-questions, whereas planbased approaches are usually too complex to be effectively used, given the unreliability of word recognition and the elliptical and unconventional nature of spontaneous speech. As an alternative, a Dialogue Manager architecture is proposed which uses knowledge on both the possible sequences of di...

A Framework Supporting Integrated Transaction and Session Management for Cooperative Appli...
  • A Framework Supporting Integrated Transaction and Session Management for Coopera...

  • This report presents a framework of integrated transaction and session management to meet the requirements of applications based on group work. Transaction management is provided in order to guarantee data consistency and recovery from failures with the additional benefit of structuring complex applications as nested transactions. Visibility between users is achieved by allowing unfinished work to be transferred between users or by establishing a synchronous session. Within a session users can update shared objects in turns and be notified of o...

Reformulation in Planning 2002
  • Reformulation in Planning 2002

  • Reformulation of a problem is intended to make the problem more amenable to efficient solution. This is equally true in the special case of reformulating a planning problem. This paper considers various ways in which reformulation has been exploited in planning. In particular, it considers reformulation of planning problems to exploit structure within them by allowing deployment of specialised sub-solvers, capable of tackling sub-problems with greater efficiency than generic planning technologies. The relationship between this reformulation of ...

Reformulation in Planning 2002
  • Reformulation in Planning 2002

  • Reformulation of a problem is intended to make the problem more amenable to efficient solution. This is equally true in the special case of reformulating a planning problem. This paper considers various ways in which reformulation has been exploited in planning. In particular, it considers reformulation of planning problems to exploit structure within them by allowing deployment of specialised sub-solvers, capable of tackling sub-problems with greater efficiency than generic planning technologies. The relationship between this reformulation of ...

[Population sturcture of the Gorno-MariÄ­skiÄ­ region of the MariÄ­ El Republic]
  • [Population sturcture of the Gorno-MariÄ­skiÄ­ region of the MariÄ­ El Republic]

  • The genetic structure of the population of the Gorno-Mariiskii raion, Marii El Republic, was studied. The population consists of two major groups, highland Mari and Russians. The former constitute the majority of the rural population, and the latter, the majority of the urban one. A marked ethnicity-related marriage assortation was found. The value of random inbreeding was estimated using frequencies of surnames. It varied from 0.00015 to 0.00069 (the weighted average was 0.00026). The local inbreeding (a) for Gorno-Mariiskii raion estimated ac...




























 

Powered free by PHPmotion