Results 111 to 120 of about 169 (168)
Gravity‐Dependent Modulation of Downbeat Nystagmus: Insights From Velocity‐Storage Dysfunction
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Downbeat nystagmus varies with head position, a phenomenon termed gravity‐dependent modulation. We aimed to clarify its mechanism using a velocity‐storage model. Methods In 10 patients with downbeat nystagmus due to cerebellar disorders, we recorded eye movements at different pitch‐ and roll‐axis head positions.
Ji‐Hyung Park +5 more
wiley +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective The prognosis of glioblastoma (GBM) remains highly unfavorable, largely due to high tumor heterogeneity and an immunosuppressive microenvironment. However, the functional role of PANoptosis in this context is poorly understood. Methods Patients were stratified via K‐means clustering. A risk score model was constructed using prognosis‐
Langfei Tian +6 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Refinement methods and refinement calculi
Software Engineering Journal, 1992A number of modern approaches to refinement are discussed and compared, and their broad classification into refinement methods and refinement calculi is explained. The refinement methods concerned are all based on the model-based specification languages VDM and Z, whereas the refinement calculi are all developments of the Dijkstra programming calculus.
H. J. Litteck, Peter J. L. Wallis
openaire +2 more sources
Refining by architectural styles or architecting by refinements
Joint proceedings of the second international software architecture workshop (ISAW-2) and international workshop on multiple perspectives in software development (Viewpoints '96) on SIGSOFT '96 workshops, 1996In L. Vidal, A.Finkelstein, G. Spanoudakis, and A. L. Wolf (eds) Joint Proceedings of the ACM SIGSOFT 96 Workshops, Part I, 2nd Int. Software Architecture Workshop. S.
MONTANGERO, CARLO, SEMINI, LAURA
openaire +3 more sources
Journal of Algorithms, 1993
Factor refinement (in \(\mathbb Z\)) refers to the transition from \(m=m_ 1 m_ 2\) to \(m=\prod n_ i^{e_ i}\) where the \(n_ i\) are not necessarily prime but \(\gcd(n_ i n_ j)=1\). The method is to use only the gcd algorithm starting with \(d=\gcd(m_ 1,m_ 2)\) and \(m=(m_ 1/d)d^ 2 (m_ 2/d)\). Then proceed by induction. The process is of complexity \(O(
Eric Bach 0001 +2 more
openaire +3 more sources
Factor refinement (in \(\mathbb Z\)) refers to the transition from \(m=m_ 1 m_ 2\) to \(m=\prod n_ i^{e_ i}\) where the \(n_ i\) are not necessarily prime but \(\gcd(n_ i n_ j)=1\). The method is to use only the gcd algorithm starting with \(d=\gcd(m_ 1,m_ 2)\) and \(m=(m_ 1/d)d^ 2 (m_ 2/d)\). Then proceed by induction. The process is of complexity \(O(
Eric Bach 0001 +2 more
openaire +3 more sources
Alternatives to Laboratory Animals, 2013
Russell and Burch's principle of refinement has endured from its inception in the 1950s, to appear in today's EU ...
openaire +2 more sources
Russell and Burch's principle of refinement has endured from its inception in the 1950s, to appear in today's EU ...
openaire +2 more sources
Science in China Series F: Information Sciences, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Metavariables and Conditional Refinements in the Refinement Calculus
1994We describe two techniques for the refinement calculus that facilitate goal-directed development. The techniques achieve this by allowing the deferring of decisions about the precise form of refinement steps, so high-level choices can be expressed as soon as those choices are appropriate.
Raymond G. Nickson, Lindsay J. Groves
openaire +2 more sources
Journal of the London Mathematical Society, 1975
A partition of a set is refined by splitting one of the subsets into two smaller subsets. Let \(f(n)\) denote the number of ways of transforming \(n\) indistinguishable objects into \(n\) singletons via a sequence of \(n-1\) refinements. The authors show that there exist constants \(c_1\) and \(c_2\) such that \(c^n_1n^{n/2}
Erdős, Paul +2 more
openaire +2 more sources
A partition of a set is refined by splitting one of the subsets into two smaller subsets. Let \(f(n)\) denote the number of ways of transforming \(n\) indistinguishable objects into \(n\) singletons via a sequence of \(n-1\) refinements. The authors show that there exist constants \(c_1\) and \(c_2\) such that \(c^n_1n^{n/2}
Erdős, Paul +2 more
openaire +2 more sources