نتایج جستجو برای: parity space

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

1973
Matej Pavšič

Having in mind that physical systems have different levels of structure we develop the concept of external, internal and total improper Lorentz transformation (space inversion and time reversal). A particle obtained from the ordinary one by the application of internal space inversion or time reversal is generally a different particle. From this point of view the intrinsic parity of a nuclear pa...

Journal: :Journal of animal science 2007
J L Salak-Johnson S R Niekamp S L Rodriguez-Zas M Ellis S E Curtis

Different floor space allowances for dry, pregnant sows in pens were evaluated to determine the impacts of space on sow performance, productivity, and body lesions during 2 consecutive farrowings. Treatment groups of 5 sows/pen were assigned to 1.4, 2.3, or 3.3 m(2) of floor space/sow or of 5 sows in individual stalls (1.34 m(2)). The experiment consisted of 6 replications (blocks 1 to 6), and ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید چمران اهواز 1390

abstract:assume that y is a banach space such that r(y ) ? 2, where r(.) is garc?a-falset’s coefficient. and x is a banach space which can be continuously embedded in y . we prove that x can be renormed to satisfy the weak fixed point property (w-fpp). on the other hand, assume that k is a scattered compact topological space such that k(!) = ? ; and c(k) is the space of all real continuous ...

2013
Clare N. Jonas Mary Jane Spiller Ashok Jansari Jamie Ward

In Dehaene’s (1992) theory of the mental number line, number and space are implicitly associated, giving rise to the spatial-numerical association of response codes (SNARC) effect, in which smaller numbers are more readily associated with the left side of space, larger numbers with the right, during a parity judgement task. Others, however, have argued that the SNARC effect is flexible (e.g. Bä...

Journal: :Quarterly journal of experimental psychology 2014
Clare N Jonas Mary Jane Spiller Ashok Jansari Jamie Ward

In the theory of the mental number line, number, and space are implicitly associated, giving rise to the spatial-numerical association of response codes (SNARC) effect, in which smaller numbers are more readily associated with the left side of space and larger numbers with the right, during a parity judgement task. Others, however, have argued that the SNARC effect is flexible and better explai...

2004
Shreyas Sundaram Christoforos N. Hadjicostis

In this paper, we consider protection schemes for linear timeinvariant (LTI) controllers in switched systems. These controllers are often digital in nature and, as such, are subject to internal hardware malfunctions (faults). A discrete-time (DT) LTI system is usually protected against faults by embedding the state-space of the original system into the state-space of a higher dimensional redund...

2013
Lei Tian Hong Jiang Dan Feng Qin Xin Sai Huang

In this paper, we propose an architectural approach, Supplementary Partial Parity (SPP), to addressing the availability issue of parity encoded RAID systems. SPP exploits free storage space and idle time to generate and update a set of partial parity units that cover a subset of disks (or data stripe units) during failure-free and idle/lightly-loaded periods, thus supplementing the existing ful...

Journal: :Int. J. Systems Science 2009
Maiying Zhong Qiang Ding Peng Shi

This paper deals with problems of parity space-based fault detection for a class of discrete-time linear Markovian jump systems. A new algorithm is firstly introduced to reduce the computation of mode-dependent redundancy relation parameter matrices. Different from the case of linear time invariant systems, the parity space-based residual generator for a Markovian jump system cannot be designed...

Journal: :CoRR 2014
Martin Hofmann Harald Ruess

We define memory-efficient certificates for μ-calculus model checking problems based on the well-known correspondence of the μ-calculus model checking with winning certain parity games. Winning strategies can independently checked, in low polynomial time, by observing that there is no reachable strongly connected component in the graph of the parity game whose largest priority is odd. Winning s...

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

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