نتایج جستجو برای: rework loops

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

Journal: :mathematics interdisciplinary research 0
akhilesh chandra yadav m g kashi vidyapith varanasi

in this short article, we observe that the path of particle of mass $m$ moving along $mathbf{r}= mathbf{r}(t)$ under pseudo-force $mathbf{a}(t)$, $t$ denotes the time, is given by $mathbf{r}_d= int(frac{dmathbf{r}}{dt} mathbf{a}(t)) dt +mathbf{c}$. we also observe that the effective force $mathbf{f}_e$ on that particle due to pseudo-force $mathbf{a}(t)$, is given by $ mathbf{f}_e= mathbf{f} mat...

Journal: :Journal of Construction Engineering and Management 2017

2003
Paul Rayson Bernadette Sharp Albert Alderson John Cartmell Caroline Chibelushi Rodney J. Clarke Alan J. Dix Victor Onditi Amanda Quek Devina Ramduny-Ellis Andy Salter Hanifa Shah Ian Sommerville Philip C. Windridge

The Tracker project is studying rework in systems engineering projects. Our hypothesis is that providing decision makers with information about previous relevant decisions will assist in reducing the amount of rework in a project. We propose an architecture for the flexible integration of the tools implementing the variety of theories and models used in the project. The techniques include ethno...

2015
S. P Prakash

Floating purpose is that the most vital a part of several fashionable chip. The amalgamate floating-point add–subtract unit is helpful for digital signal process (DSP) applications like quick Fourier rework (FFT) and separate circular function rework (DCT) butterfly operations. IEEE 754 normal specifies the ways for binary and decimal floating purpose arithmetic unit. Moreover, single precisene...

2007
Christian Hagen Falk Bruckmann

We represent thin and dressed Polyakov loops as spectral sums of eigenvalues of differential operators on the lattice. For that purpose we calculate complete sets of eigenvalues of the staggered Dirac and the covariant Laplace operator for several temporal boundary conditions. The spectra from different boundary conditions can be combined such that they represent single (thin) Polyakov loops, o...

Journal: :Discrete Mathematics 2002
Helmut Karzel Silvia Pianta Elena Zizioli

We consider a generalization of the representation of the so-called co-Minkowski plane (due to H. and R. Struve) to an abelian group (V;+) and a commutative subgroup G of Aut(V;+). If P = G × V satis7es suitable conditions then an invariant re8ection structure (in the sense of Karzel (Discrete Math. 208=209 (1999) 387–409)) can be introduced in P which carries the algebraic structure of K-loop ...

2004
Ramon Costa Durward K. Sobek

Iteration in design has different meanings, ranging from simple task repetition to heuristic reasoning processes. Determining the need to iterate is important to improve the design process on cost, time, and quality, but currently there is no categorization of iterations conducive to this goal. After exploring the possible causes and attempts to address them, we propose to classify iterations a...

Journal: :International Journal of Artificial Intelligence in Education 2015

Journal: :Journal of Infrastructure Systems 2017

Journal: :Computer Science and Information Systems 2021

Software development is often affected by user/system requirements changes. To implement changes, a system which being developed needs to be reworked. However, the term ?Rework? has not been clearly defined in literature. Depending on complexity of amount rework required varies from some software module modifications non-trivial alteration design system. The effort associated with such obviousl...

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

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