Results 341 to 350 of about 1,081,314 (373)
Some of the next articles are maybe not open access.
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 Directive
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 Directive
openaire +2 more sources
2021
In this chapter, we will shape up visual elements and implement visual structure together with code structure. Visual elements can evolve best when the idea is still under construction, and we can follow new inspirations from working with code. We will also dig a bit deeper in working with data structures and unleash new powers of Processing.
Yu Zhang, Mathias Funk
openaire +2 more sources
In this chapter, we will shape up visual elements and implement visual structure together with code structure. Visual elements can evolve best when the idea is still under construction, and we can follow new inspirations from working with code. We will also dig a bit deeper in working with data structures and unleash new powers of Processing.
Yu Zhang, Mathias Funk
openaire +2 more sources
Science in China Series F: Information Sciences, 2008 Summary form only given. This paper presents a refinement calculus for service components. We model the behaviour of individual service by a guarded design, which enables one to separate the responsibility of clients from the commitment made by the system, and to identify a component by a set of failures and divergences.
openaire +1 more source
Analysis, 2000
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
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}
P. Erdös, Richard K. Guy, J. W. Moon
openaire +3 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}
P. Erdös, Richard K. Guy, J. W. Moon
openaire +3 more sources
On Elder‐Vass: Refining a Refinement
Journal for the Theory of Social Behaviour, 2007ABSTRACTThis paper responds to Dave Elder‐Vass's generally sympathetic critique of Margaret Archer's position on structure and emergence. Elder‐Vass does helpfully emphasize the synchronic effects of structure. Yet, it is argued here, in his treatment of structure, Elder‐Vass tends to concede too much to methodological individualism and to ...
openaire +2 more sources
Refinement patterns for ASTDs [PDF]
Formal Aspects of Computing, 2012 Abstract This paper introduces three refinement patterns for algebraic state-transition diagrams ( astds ): state refinement, transition refinement and loop-transition refinement. These refinement patterns are derived from practice in using astds for specifying information systems ...
Milhau, Jérémy +3 more
openaire +4 more sources
Refining Word Embeddings Using Intensity Scores for Sentiment Analysis
IEEE/ACM Transactions on Audio Speech and Language Processing, 2018Word embeddings that provide continuous low-dimensional vector representations of words have been extensively used for various natural language processing tasks. However, existing context-based word embeddings such as Word2vec and GloVe typically fail to
Liang-Chih Yu +3 more
semanticscholar +1 more source
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 +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 +2 more
openaire +3 more sources
Foreground Gating and Background Refining Network for Surveillance Object Detection
IEEE Transactions on Image Processing, 2019Detecting objects in surveillance videos is an important problem due to its wide applications in traffic control and public security. Existing methods tend to face performance degradation because of false positive or misalignment problems.
Zhihang Fu +5 more
semanticscholar +1 more source