نتایج جستجو برای: update

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

2015
Isabella Hatak Teemu Kautonen Matthias Fink Juha Kansikas

a Institute for SME Management and Entrepreneurship, WU Vienna University of Economics and Business, Welthandelsplatz 1, 1020 Vienna, Austria b Aalto University School of Business, P.O. Box 21230, 00076 Aalto, Finland c Institute for Innovation, Johannes Kepler University Linz, Altenbergerstrasse 69, 4040 Linz, Austria d University of Jyväskylä School of Business and Economics, P.O. Box 35, 400...

Journal: :acta medica iranica 0
sahar taba taba vakili department of internal medicine, shahid beheshti university of medical sciences, tehran, iran. mohammad taher department of internal medicine, tehran university of medical sciences, tehran, iran. nasser ebrahimi daryani department of gastroenterology, imam khomeini hospital, tehran university of medical sciences, tehran, iran.

the present treatment goals for inflammatory bowel diseases (ibd) especially ulcerative colitis (uc) include rapid induction of clinical remission, steroid-free maintenance of clinical remission, mucosal healing and improvement of quality of life in uc patients. immunomodulators have been reserved for steroid- dependent or steroid- refractory uc patients. among these agents, azathioprine/6-merc...

Journal: :CoRR 2014
Srikrishnan Divakaran

For the static list update problem, given an ordered list ρ0 (an ordering of the list L = { aa, a2, ..., al }), and a sequence σ = (σ1, σ2, ..., σm) of requests for items in L, we characterize the list reorganizations in an optimal offline solution in terms of an initial permutation of the list followed by a sequence of m element transfers, where an element transfer is a type of list reorganiza...

2012
Paul E. McKenney Silas Boyd-Wickizer Jonathan Walpole

Read-copy update (RCU) has been used in the Linux kernel for more than a decade, raising the question of exactly what it is used for. To answer this question, we briefly survey use of RCU in the Linux kernel, addressing the why, where, and how of its usage. This document also includes a novel graphical depiction of the relationships among several patterns of RCU usage.

2016
Wolfhard Hansen Ivan Netuka

Let φ be a locally upper bounded Borel measurable function on a Greenian open set Ω in Rd and, for every x ∈ Ω, let vφ(x) denote the infimum of the integrals of φ with respect to Jensen measures for x on Ω. Twenty years ago, B.J. Cole and T.J. Ransford proved that vφ is the supremum of all subharmonic minorants of φ on X and that the sets {vφ < t}, t ∈ R, are analytic. In this paper, a differen...

2013
SHENG-JHIH WU MOODY T. CHU

DIAGONAL ELEMENTS, EIGENVALUES, AND SINGULAR VALUES DRAFT AS OF April 30, 2013 SHENG-JHIH WU AND MOODY T. CHU Abstract. Diagonal entries and eigenvalues of a Hermitian matrix, diagonal entries and singular values of a general matrix, and eigenvalues and singular values of a general matrix satisfy necessarily some majorization relationships which turn out also to be sufficient conditions. The in...

2008
Ambroise Krebs Cédric Pradalier Roland Siegwart

The terrain classification is a very important subject to the all-terrain robotics community. The knowledge of the type of terrain allows a rover to deal with its environment more efficiently. The work presented in this paper shows that it is possible to differentiate terrains based on their aspects, using exteroceptive sensors, as well as based on their influence on the rover’s behavior, using...

2009
Satoru Fujishige Ping Zhan

We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding t.he minimum-norm point in a polytope.

2009
ROBERT P. KERTZ R. P. KERTZ

If X"0, Xx_ is an arbitrarily-dependent sequence of random variables taking values in [0,1] and if V( X0,X¡,... ) is the supremum, over stop rules /, of EX,, then the set of ordered pairs {(.*, v): x V(X0, Xx,.. .,Xn) and y £(maxyS„X¡) for some X0,..., Xn] is precisely the set C„= {(x,y):x<y<x(\ + n(\ *'/")); 0 « x « l}; and the set of ordered pairs {(x, y): x V(X0, X,,...) and y £(sup„ X„) for...

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

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