نتایج جستجو برای: server breakdowns

تعداد نتایج: 53791  

Journal: :Knowl.-Based Syst. 1994
Gerhard Fischer

2007
ZBIGNIEW LEYK

ZBIGNIEW LEYK Abstract. One of the disadvantages of Krylov subspace iterative methods is the possibility of breakdown. This occurs when it is impossible to get the next approximation of the solution to the system of linear equations Au = f . There are two di erent situations: lucky breakdown, when we have found the solution and hard breakdown, when the next Krylov subspace cannot be generated a...

Journal: :Proceedings of the ACM on Human-Computer Interaction 2019

Journal: :Physical Review Special Topics - Accelerators and Beams 2009

1997
I C Legrand

Distributed processing systems are considered to solve the challenging requirements of trigger and data acquisition systems for future HEP experiments. The aim of this work is to present a software environment to control and monitor large scale parallel processing systems based on a distributed client-server approach developed in Java. One server task may control several processing nodes, switc...

Journal: :JCM 2017
Youssef Khaoula Michio Okada

In our current research, we assessed the feasibility of integrating a dual coded robot’s feedback. Dual coded feedback consists of the robot combining it visible behaviors (e.g.: the robot’s movement) with auditory icons which we refer to as Inarticulate Utterances (IUs). In our study, we investigate whether using dual coded robot’s feedback during the HumanRobot Interaction (HRI) may help main...

1996
Steve Easterbrook

ion, differentiation, definition, summarisation: These provide points where shared understanding is explicitly checked and discussed. Abstraction is used to ignore detail in order to establish the overall concepts. Summarisation is used by the hearer, both to check that something has been understood correctly, and as an indication of closure on a topic. Report writing: This forces a group to se...

Journal: :Physical review letters 2000
Cohen Erez ben-Avraham Havlin

A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k) = ck(-alpha). We study the stability of such networks with respect to crashes, such as random removal of sites. Our approach, based on percolation theory, leads to a general condition for the critical fraction of nodes, p(c), that need...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید