Results 121 to 130 of about 169 (168)
Some of the next articles are maybe not open access.
Plastic & Reconstructive Surgery, 2020
Summary: With a growing massive weight loss population, upper arm contouring continues to rise in popularity. Refinements in technique, such as modification of skin excision patterns and the adjunct use of liposuction, have allowed for safe and reproducible results.
Rod J, Rohrich +2 more
openaire +2 more sources
Summary: With a growing massive weight loss population, upper arm contouring continues to rise in popularity. Refinements in technique, such as modification of skin excision patterns and the adjunct use of liposuction, have allowed for safe and reproducible results.
Rod J, Rohrich +2 more
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.
Mathias Funk, Yu Zhang
openaire +1 more source
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.
Mathias Funk, Yu Zhang
openaire +1 more source
The Least Conjunctive Refinement and Promotion in the Refinement Calculus
Formal Aspects of Computing, 1999Abstract. A syntactic calculation of Morgan's least conjunctive refinement operator for predicate transformers is developed. The operator is used to develop a general approach to lifting relational operators to predicate transformer operators.
openaire +3 more sources
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2015
Algorithms for solving the consensus problem are fundamental to distributed computing. Despite their brevity, their ability to operate in concurrent, asynchronous, and failure-prone environments comes at the cost of complex and subtle behaviors. Accordingly, understanding how they work and proving their correctness is a non-trivial endeavor where ...
Ognjen Maric +2 more
openaire +2 more sources
Algorithms for solving the consensus problem are fundamental to distributed computing. Despite their brevity, their ability to operate in concurrent, asynchronous, and failure-prone environments comes at the cost of complex and subtle behaviors. Accordingly, understanding how they work and proving their correctness is a non-trivial endeavor where ...
Ognjen Maric +2 more
openaire +2 more sources
2006
The purpose of this initial chapter is to introduce concepts and techniques assumed as general background in the remaining chapters of this book. The relevant notions are introduced using a simple and well-known programming notation: Dijkstra’s language of guarded commands [18], presented in Section [1].
Ana Cavalcanti 0001 +2 more
openaire +2 more sources
The purpose of this initial chapter is to introduce concepts and techniques assumed as general background in the remaining chapters of this book. The relevant notions are introduced using a simple and well-known programming notation: Dijkstra’s language of guarded commands [18], presented in Section [1].
Ana Cavalcanti 0001 +2 more
openaire +2 more sources
Alternatives to Laboratory Animals, 2013
The freedom of choice of the experimenter is often very much wider than it at first appears. The full use of this freedom is the mark alike of humane and successful experimentation.
openaire +2 more sources
The freedom of choice of the experimenter is often very much wider than it at first appears. The full use of this freedom is the mark alike of humane and successful experimentation.
openaire +2 more sources
2002
We describe refinement in Circus, a concurrent specification language that integrates imperative CSP, Z, and the refinement calculus. Each Circus process has a state and accompanying actions that define both the internal state transitions and the changes in control flow that occur during execution.
Augusto Sampaio 0001 +2 more
openaire +1 more source
We describe refinement in Circus, a concurrent specification language that integrates imperative CSP, Z, and the refinement calculus. Each Circus process has a state and accompanying actions that define both the internal state transitions and the changes in control flow that occur during execution.
Augusto Sampaio 0001 +2 more
openaire +1 more source
Science, 1982
Processes for refining biomass from trees or from agricultural residues are fast approaching commercialization. Advances have been made in acidic and enzymatic hydrolysis of the cellulose component of biomass and in some newer processes for biomass refining which leave the lignin fraction relatively intact.
openaire +2 more sources
Processes for refining biomass from trees or from agricultural residues are fast approaching commercialization. Advances have been made in acidic and enzymatic hydrolysis of the cellulose component of biomass and in some newer processes for biomass refining which leave the lignin fraction relatively intact.
openaire +2 more sources
1993
The refinement calculus, based on weakest preconditions, elaborates program developments as a series of steps linked by a mathematical refinement relation. Specifications and executable code are regarded equally as programs, allowing a gradual transformation from one to the other.
openaire +1 more source
The refinement calculus, based on weakest preconditions, elaborates program developments as a series of steps linked by a mathematical refinement relation. Specifications and executable code are regarded equally as programs, allowing a gradual transformation from one to the other.
openaire +1 more source
2015
Counterexample-guided abstraction refinement CEGAR is a property-directed approach for the automatic construction of an abstract model for a given system. The approach learns information from infeasible error paths in order to refine the abstract model.
Dirk Beyer 0001 +2 more
openaire +1 more source
Counterexample-guided abstraction refinement CEGAR is a property-directed approach for the automatic construction of an abstract model for a given system. The approach learns information from infeasible error paths in order to refine the abstract model.
Dirk Beyer 0001 +2 more
openaire +1 more source